/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i


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


This is Ultimate 0.1.25-1d1d2b5
[2020-10-21 22:01:55,574 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-21 22:01:55,577 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-21 22:01:55,601 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-21 22:01:55,601 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-21 22:01:55,602 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-21 22:01:55,604 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-21 22:01:55,605 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-21 22:01:55,607 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-21 22:01:55,608 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-21 22:01:55,609 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-21 22:01:55,610 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-21 22:01:55,610 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-21 22:01:55,611 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-21 22:01:55,613 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-21 22:01:55,614 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-21 22:01:55,615 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-21 22:01:55,616 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-21 22:01:55,617 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-21 22:01:55,619 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-21 22:01:55,621 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-21 22:01:55,622 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-21 22:01:55,623 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-21 22:01:55,624 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-21 22:01:55,627 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-21 22:01:55,627 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-21 22:01:55,627 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-21 22:01:55,628 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-21 22:01:55,628 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-21 22:01:55,629 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-21 22:01:55,630 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-21 22:01:55,630 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-21 22:01:55,632 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-21 22:01:55,633 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-21 22:01:55,634 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-21 22:01:55,634 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-21 22:01:55,634 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-21 22:01:55,635 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-21 22:01:55,635 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-21 22:01:55,636 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-21 22:01:55,638 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-21 22:01:55,639 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-21 22:01:55,688 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-21 22:01:55,692 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-21 22:01:55,693 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-21 22:01:55,694 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-21 22:01:55,694 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-21 22:01:55,694 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-21 22:01:55,694 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-21 22:01:55,694 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-21 22:01:55,695 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-21 22:01:55,695 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-21 22:01:55,699 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-21 22:01:55,699 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-21 22:01:55,700 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-21 22:01:55,700 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-21 22:01:55,700 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-21 22:01:55,700 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-21 22:01:55,700 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-21 22:01:55,701 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-21 22:01:55,701 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-21 22:01:55,701 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-21 22:01:55,701 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-21 22:01:55,701 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:55,702 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-21 22:01:55,702 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-21 22:01:55,702 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-21 22:01:55,702 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-21 22:01:55,702 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-21 22:01:55,702 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-21 22:01:55,703 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-21 22:01:55,703 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-21 22:01:56,002 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-21 22:01:56,013 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-21 22:01:56,016 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-21 22:01:56,018 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-21 22:01:56,018 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-21 22:01:56,019 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i
[2020-10-21 22:01:56,097 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea3c7cb7/7524015f6f2e452ca707f11ff4ccb14a/FLAGb7727b7fd
[2020-10-21 22:01:56,639 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-21 22:01:56,640 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i
[2020-10-21 22:01:56,654 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea3c7cb7/7524015f6f2e452ca707f11ff4ccb14a/FLAGb7727b7fd
[2020-10-21 22:01:56,866 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ea3c7cb7/7524015f6f2e452ca707f11ff4ccb14a
[2020-10-21 22:01:56,874 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-21 22:01:56,881 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-21 22:01:56,882 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:56,882 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-21 22:01:56,888 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-21 22:01:56,889 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:56" (1/1) ...
[2020-10-21 22:01:56,892 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d83ff23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:56, skipping insertion in model container
[2020-10-21 22:01:56,892 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:56" (1/1) ...
[2020-10-21 22:01:56,900 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-21 22:01:56,973 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-21 22:01:57,650 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:57,662 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-21 22:01:57,739 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:57,821 INFO  L208         MainTranslator]: Completed translation
[2020-10-21 22:01:57,822 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57 WrapperNode
[2020-10-21 22:01:57,822 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:57,823 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:57,823 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-21 22:01:57,824 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-21 22:01:57,833 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,855 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,902 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:57,902 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-21 22:01:57,903 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-21 22:01:57,903 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-21 22:01:57,914 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,914 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,920 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,920 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,932 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,936 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,940 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (1/1) ...
[2020-10-21 22:01:57,946 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-21 22:01:57,946 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-21 22:01:57,947 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-21 22:01:57,947 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-21 22:01:57,948 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (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-21 22:01:58,029 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-21 22:01:58,029 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-21 22:01:58,029 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-21 22:01:58,029 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-21 22:01:58,030 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-21 22:01:58,030 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-21 22:01:58,030 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-21 22:01:58,030 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-21 22:01:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-21 22:01:58,031 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-21 22:01:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-21 22:01:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-21 22:01:58,031 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-21 22:01:58,032 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-21 22:01:58,034 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-21 22:02:00,385 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-21 22:02:00,385 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-10-21 22:02:00,388 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:02:00 BoogieIcfgContainer
[2020-10-21 22:02:00,388 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-21 22:02:00,389 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-21 22:02:00,390 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-21 22:02:00,394 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-21 22:02:00,394 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:01:56" (1/3) ...
[2020-10-21 22:02:00,395 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4bdd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:02:00, skipping insertion in model container
[2020-10-21 22:02:00,395 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:57" (2/3) ...
[2020-10-21 22:02:00,396 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4bdd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:02:00, skipping insertion in model container
[2020-10-21 22:02:00,396 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:02:00" (3/3) ...
[2020-10-21 22:02:00,398 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i
[2020-10-21 22:02:00,410 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-21 22:02:00,410 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-21 22:02:00,418 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-21 22:02:00,419 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-21 22:02:00,448 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,448 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,448 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,448 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,449 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,449 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,449 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,449 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,450 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,450 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,451 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,453 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,454 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,454 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,454 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,455 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,456 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,457 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,457 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,457 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,457 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,457 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,458 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,459 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,459 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,463 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,464 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,464 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,465 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,465 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,465 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,465 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,465 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,466 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,466 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,470 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,471 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,471 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,472 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,474 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,475 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,476 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:02:00,478 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-21 22:02:00,492 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-21 22:02:00,514 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-21 22:02:00,515 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-21 22:02:00,515 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-21 22:02:00,515 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-21 22:02:00,515 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-21 22:02:00,515 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-21 22:02:00,516 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-21 22:02:00,516 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-21 22:02:00,531 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-21 22:02:00,534 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow
[2020-10-21 22:02:00,538 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow
[2020-10-21 22:02:00,540 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow
[2020-10-21 22:02:00,590 INFO  L129       PetriNetUnfolder]: 3/96 cut-off events.
[2020-10-21 22:02:00,591 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-21 22:02:00,596 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. 
[2020-10-21 22:02:00,599 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1770
[2020-10-21 22:02:00,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:00,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:00,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:00,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:00,894 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:00,895 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,958 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:00,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,964 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,964 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,968 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,969 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:00,971 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:00,975 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:00,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:00,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:00,979 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:00,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:00,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:00,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,126 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,126 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,128 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,128 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,146 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,147 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,148 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,148 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,198 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:01,203 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,203 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,204 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,208 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,209 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,210 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,217 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,220 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,265 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,266 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,266 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:01,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:01,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,273 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,544 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,545 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,546 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,546 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:01,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:01,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,552 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,602 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:01,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,637 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,641 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,642 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,653 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,658 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,658 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,828 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,829 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,854 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:01,855 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-21 22:02:01,855 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:01,898 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,898 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:01,905 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,905 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,909 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,910 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,911 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,912 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,913 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:01,913 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:01,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,918 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,920 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,966 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:01,966 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,967 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:01,967 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:01,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:01,970 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:01,973 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:01,973 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,032 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,033 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,076 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:02,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,083 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,085 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,095 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,096 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,097 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,097 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,139 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:02,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:02,144 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,145 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,203 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,203 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,204 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,204 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:02,208 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:02:02,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,212 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:02,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,259 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,260 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,263 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,265 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,265 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,268 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:02,268 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:02,270 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,270 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,275 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2020-10-21 22:02:02,736 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,737 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,784 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,787 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:02,788 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,831 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,922 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,922 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,924 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,924 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,966 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,967 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,967 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,968 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:02,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:02,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:02,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:03,039 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:03,040 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:03,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2020-10-21 22:02:03,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:03,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:02:03,066 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:03,068 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:03,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:04,424 WARN  L193               SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-21 22:02:04,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-21 22:02:04,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:04,439 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:02:04,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:05,509 WARN  L193               SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 142 DAG size of output: 121
[2020-10-21 22:02:05,860 WARN  L193               SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-21 22:02:06,074 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,074 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,076 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,077 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,078 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,078 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,080 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,081 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,082 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,082 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,085 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,106 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,214 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,233 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,236 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,237 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,238 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,240 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,245 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,245 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,247 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,247 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,249 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,250 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,425 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,447 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,448 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,451 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,461 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,461 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,463 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,464 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,528 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,529 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,530 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,533 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,533 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,536 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,537 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,539 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,539 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,540 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,542 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,576 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,581 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,581 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,733 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,733 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,734 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,734 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,735 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,742 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,743 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,744 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,744 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,746 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,768 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,798 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,799 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,799 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,801 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,801 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:06,802 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,803 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:06,815 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,815 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,816 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,818 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,818 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,840 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,841 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:06,842 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,843 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:02:06,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,863 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,863 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:02:06,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,868 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,894 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,895 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,895 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,896 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,897 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,898 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,899 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,900 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,915 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,915 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,917 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:06,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,919 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:06,975 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,976 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:06,992 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,993 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,994 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:06,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:06,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:06,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:06,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:07,304 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:07,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,306 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:07,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:07,309 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:07,309 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:07,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:07,330 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,331 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:07,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:07,332 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:07,334 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:07,334 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:07,997 WARN  L193               SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107
[2020-10-21 22:02:08,279 WARN  L193               SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 104
[2020-10-21 22:02:08,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 6, 3, 6, 3, 2, 1] term
[2020-10-21 22:02:08,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:08,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 6, 3, 6, 3, 2, 1] term
[2020-10-21 22:02:08,292 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:08,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 2, 2, 1] term
[2020-10-21 22:02:08,314 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:08,315 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 3, 2, 1] term
[2020-10-21 22:02:08,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:08,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:08,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,318 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:08,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:08,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:08,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 6, 3, 6, 3, 2, 1] term
[2020-10-21 22:02:08,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:08,324 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,324 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:08,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 6, 3, 6, 3, 6, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:08,326 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,259 WARN  L193               SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129
[2020-10-21 22:02:09,583 WARN  L193               SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-21 22:02:09,590 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:09,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:09,593 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:09,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:09,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:09,619 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:09,620 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:09,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:09,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,622 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:09,624 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,624 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:09,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,629 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,630 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:09,631 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:09,631 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,087 WARN  L193               SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110
[2020-10-21 22:02:10,258 WARN  L193               SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-21 22:02:10,325 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:10,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:02:10,327 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:10,327 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:10,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,345 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:02:10,345 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,346 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,347 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,347 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,349 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,349 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,352 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2020-10-21 22:02:10,352 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,354 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,354 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,355 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,355 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,402 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,402 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,403 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,404 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,424 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,427 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,427 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,450 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,452 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,464 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,464 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,466 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,467 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,468 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,468 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,519 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,519 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,521 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,540 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,540 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,543 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,546 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,546 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,651 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,653 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,659 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:02:10,685 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,685 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:02:10,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:02:10,691 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,692 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:02:10,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:02:10,722 INFO  L131        LiptonReduction]: Checked pairs total: 4794
[2020-10-21 22:02:10,722 INFO  L133        LiptonReduction]: Total number of compositions: 92
[2020-10-21 22:02:10,736 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow
[2020-10-21 22:02:10,821 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states.
[2020-10-21 22:02:10,825 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states.
[2020-10-21 22:02:10,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-21 22:02:10,835 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:10,837 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-21 22:02:10,837 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:10,846 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:10,846 INFO  L82        PathProgramCache]: Analyzing trace with hash 1087337, now seen corresponding path program 1 times
[2020-10-21 22:02:10,860 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:10,860 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440236689]
[2020-10-21 22:02:10,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:11,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:11,171 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-21 22:02:11,172 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440236689]
[2020-10-21 22:02:11,173 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:11,174 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:02:11,174 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769237348]
[2020-10-21 22:02:11,181 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:02:11,181 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:11,206 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:02:11,207 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,210 INFO  L87              Difference]: Start difference. First operand 662 states. Second operand 3 states.
[2020-10-21 22:02:11,401 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:11,402 INFO  L93              Difference]: Finished difference Result 552 states and 1697 transitions.
[2020-10-21 22:02:11,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:11,406 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-21 22:02:11,406 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:11,445 INFO  L225             Difference]: With dead ends: 552
[2020-10-21 22:02:11,445 INFO  L226             Difference]: Without dead ends: 452
[2020-10-21 22:02:11,447 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,476 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2020-10-21 22:02:11,559 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452.
[2020-10-21 22:02:11,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 452 states.
[2020-10-21 22:02:11,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions.
[2020-10-21 22:02:11,572 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3
[2020-10-21 22:02:11,573 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:11,573 INFO  L481      AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions.
[2020-10-21 22:02:11,573 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:02:11,573 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions.
[2020-10-21 22:02:11,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-21 22:02:11,575 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:11,575 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:11,575 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-21 22:02:11,576 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:11,576 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:11,576 INFO  L82        PathProgramCache]: Analyzing trace with hash 153095369, now seen corresponding path program 1 times
[2020-10-21 22:02:11,576 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:11,577 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87138750]
[2020-10-21 22:02:11,577 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:11,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:11,752 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-21 22:02:11,753 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87138750]
[2020-10-21 22:02:11,753 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:11,753 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:02:11,754 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503360789]
[2020-10-21 22:02:11,755 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:02:11,755 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:11,756 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:02:11,756 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,756 INFO  L87              Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states.
[2020-10-21 22:02:11,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:11,767 INFO  L93              Difference]: Finished difference Result 432 states and 1291 transitions.
[2020-10-21 22:02:11,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:11,768 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-21 22:02:11,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:11,772 INFO  L225             Difference]: With dead ends: 432
[2020-10-21 22:02:11,772 INFO  L226             Difference]: Without dead ends: 432
[2020-10-21 22:02:11,773 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 432 states.
[2020-10-21 22:02:11,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432.
[2020-10-21 22:02:11,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 432 states.
[2020-10-21 22:02:11,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1291 transitions.
[2020-10-21 22:02:11,786 INFO  L78                 Accepts]: Start accepts. Automaton has 432 states and 1291 transitions. Word has length 9
[2020-10-21 22:02:11,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:11,787 INFO  L481      AbstractCegarLoop]: Abstraction has 432 states and 1291 transitions.
[2020-10-21 22:02:11,787 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:02:11,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 432 states and 1291 transitions.
[2020-10-21 22:02:11,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-21 22:02:11,789 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:11,790 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:11,790 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-21 22:02:11,790 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:11,790 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:11,790 INFO  L82        PathProgramCache]: Analyzing trace with hash 450921755, now seen corresponding path program 1 times
[2020-10-21 22:02:11,791 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:11,791 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790108214]
[2020-10-21 22:02:11,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:11,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:11,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:02:11,857 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790108214]
[2020-10-21 22:02:11,857 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:11,858 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:02:11,858 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102725274]
[2020-10-21 22:02:11,858 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:02:11,858 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:11,859 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:02:11,859 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,859 INFO  L87              Difference]: Start difference. First operand 432 states and 1291 transitions. Second operand 3 states.
[2020-10-21 22:02:11,895 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:11,896 INFO  L93              Difference]: Finished difference Result 428 states and 1276 transitions.
[2020-10-21 22:02:11,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:11,905 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-21 22:02:11,905 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:11,908 INFO  L225             Difference]: With dead ends: 428
[2020-10-21 22:02:11,908 INFO  L226             Difference]: Without dead ends: 428
[2020-10-21 22:02:11,909 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:11,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 428 states.
[2020-10-21 22:02:11,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428.
[2020-10-21 22:02:11,921 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 428 states.
[2020-10-21 22:02:11,923 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1276 transitions.
[2020-10-21 22:02:11,923 INFO  L78                 Accepts]: Start accepts. Automaton has 428 states and 1276 transitions. Word has length 10
[2020-10-21 22:02:11,924 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:11,924 INFO  L481      AbstractCegarLoop]: Abstraction has 428 states and 1276 transitions.
[2020-10-21 22:02:11,924 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:02:11,924 INFO  L276                IsEmpty]: Start isEmpty. Operand 428 states and 1276 transitions.
[2020-10-21 22:02:11,926 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:02:11,926 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:11,926 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:11,926 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-21 22:02:11,926 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:11,927 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:11,927 INFO  L82        PathProgramCache]: Analyzing trace with hash -795853152, now seen corresponding path program 1 times
[2020-10-21 22:02:11,927 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:11,928 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540443069]
[2020-10-21 22:02:11,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:11,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:12,020 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-21 22:02:12,020 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540443069]
[2020-10-21 22:02:12,021 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:12,021 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:02:12,021 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674149305]
[2020-10-21 22:02:12,023 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:02:12,023 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:12,023 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:02:12,024 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:02:12,024 INFO  L87              Difference]: Start difference. First operand 428 states and 1276 transitions. Second operand 4 states.
[2020-10-21 22:02:12,106 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:12,107 INFO  L93              Difference]: Finished difference Result 424 states and 1261 transitions.
[2020-10-21 22:02:12,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:12,112 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-21 22:02:12,112 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:12,119 INFO  L225             Difference]: With dead ends: 424
[2020-10-21 22:02:12,119 INFO  L226             Difference]: Without dead ends: 424
[2020-10-21 22:02:12,120 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:12,122 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 424 states.
[2020-10-21 22:02:12,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424.
[2020-10-21 22:02:12,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 424 states.
[2020-10-21 22:02:12,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions.
[2020-10-21 22:02:12,133 INFO  L78                 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 11
[2020-10-21 22:02:12,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:12,134 INFO  L481      AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions.
[2020-10-21 22:02:12,134 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:02:12,134 INFO  L276                IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions.
[2020-10-21 22:02:12,139 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:02:12,139 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:12,139 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:12,140 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-21 22:02:12,140 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:12,140 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:12,140 INFO  L82        PathProgramCache]: Analyzing trace with hash 308607583, now seen corresponding path program 1 times
[2020-10-21 22:02:12,140 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:12,141 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765622117]
[2020-10-21 22:02:12,141 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:12,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:12,266 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-21 22:02:12,267 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765622117]
[2020-10-21 22:02:12,267 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:12,267 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:02:12,268 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082381016]
[2020-10-21 22:02:12,268 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:02:12,268 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:12,268 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:02:12,269 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:12,269 INFO  L87              Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 3 states.
[2020-10-21 22:02:12,301 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:12,302 INFO  L93              Difference]: Finished difference Result 421 states and 1250 transitions.
[2020-10-21 22:02:12,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:12,303 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-21 22:02:12,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:12,306 INFO  L225             Difference]: With dead ends: 421
[2020-10-21 22:02:12,306 INFO  L226             Difference]: Without dead ends: 421
[2020-10-21 22:02:12,307 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:12,309 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2020-10-21 22:02:12,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421.
[2020-10-21 22:02:12,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 421 states.
[2020-10-21 22:02:12,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions.
[2020-10-21 22:02:12,320 INFO  L78                 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11
[2020-10-21 22:02:12,320 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:12,320 INFO  L481      AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions.
[2020-10-21 22:02:12,320 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:02:12,321 INFO  L276                IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions.
[2020-10-21 22:02:12,321 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:02:12,322 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:12,322 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:12,322 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-21 22:02:12,322 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:12,322 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:12,323 INFO  L82        PathProgramCache]: Analyzing trace with hash 313291130, now seen corresponding path program 1 times
[2020-10-21 22:02:12,323 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:12,323 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920653912]
[2020-10-21 22:02:12,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:12,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:12,425 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-21 22:02:12,425 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920653912]
[2020-10-21 22:02:12,426 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:12,426 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:02:12,426 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709987080]
[2020-10-21 22:02:12,426 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:02:12,427 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:12,427 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:02:12,427 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:12,427 INFO  L87              Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 5 states.
[2020-10-21 22:02:12,536 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:12,536 INFO  L93              Difference]: Finished difference Result 450 states and 1334 transitions.
[2020-10-21 22:02:12,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:12,537 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:02:12,537 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:12,541 INFO  L225             Difference]: With dead ends: 450
[2020-10-21 22:02:12,541 INFO  L226             Difference]: Without dead ends: 450
[2020-10-21 22:02:12,541 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:12,543 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-21 22:02:12,552 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-21 22:02:12,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-21 22:02:12,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1334 transitions.
[2020-10-21 22:02:12,555 INFO  L78                 Accepts]: Start accepts. Automaton has 450 states and 1334 transitions. Word has length 12
[2020-10-21 22:02:12,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:12,556 INFO  L481      AbstractCegarLoop]: Abstraction has 450 states and 1334 transitions.
[2020-10-21 22:02:12,556 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:02:12,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 450 states and 1334 transitions.
[2020-10-21 22:02:12,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:02:12,557 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:12,557 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:12,557 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-21 22:02:12,558 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:12,558 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:12,558 INFO  L82        PathProgramCache]: Analyzing trace with hash 976819639, now seen corresponding path program 1 times
[2020-10-21 22:02:12,558 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:12,558 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820380246]
[2020-10-21 22:02:12,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:12,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:12,715 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-21 22:02:12,715 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820380246]
[2020-10-21 22:02:12,716 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:12,716 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:02:12,716 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874068683]
[2020-10-21 22:02:12,716 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:02:12,717 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:12,717 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:02:12,717 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:12,717 INFO  L87              Difference]: Start difference. First operand 450 states and 1334 transitions. Second operand 5 states.
[2020-10-21 22:02:12,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:12,826 INFO  L93              Difference]: Finished difference Result 449 states and 1329 transitions.
[2020-10-21 22:02:12,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:12,827 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:02:12,827 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:12,831 INFO  L225             Difference]: With dead ends: 449
[2020-10-21 22:02:12,831 INFO  L226             Difference]: Without dead ends: 449
[2020-10-21 22:02:12,832 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:12,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 449 states.
[2020-10-21 22:02:12,842 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 441.
[2020-10-21 22:02:12,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 441 states.
[2020-10-21 22:02:12,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1304 transitions.
[2020-10-21 22:02:12,846 INFO  L78                 Accepts]: Start accepts. Automaton has 441 states and 1304 transitions. Word has length 12
[2020-10-21 22:02:12,847 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:12,847 INFO  L481      AbstractCegarLoop]: Abstraction has 441 states and 1304 transitions.
[2020-10-21 22:02:12,847 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:02:12,847 INFO  L276                IsEmpty]: Start isEmpty. Operand 441 states and 1304 transitions.
[2020-10-21 22:02:12,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:02:12,848 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:12,848 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:12,849 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-21 22:02:12,849 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:12,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:12,849 INFO  L82        PathProgramCache]: Analyzing trace with hash -1088485586, now seen corresponding path program 1 times
[2020-10-21 22:02:12,849 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:12,850 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449197232]
[2020-10-21 22:02:12,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:12,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:12,979 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-21 22:02:12,980 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449197232]
[2020-10-21 22:02:12,980 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:12,980 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:02:12,980 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958254062]
[2020-10-21 22:02:12,980 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:02:12,981 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:12,981 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:02:12,981 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:12,982 INFO  L87              Difference]: Start difference. First operand 441 states and 1304 transitions. Second operand 5 states.
[2020-10-21 22:02:13,061 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:13,062 INFO  L93              Difference]: Finished difference Result 437 states and 1290 transitions.
[2020-10-21 22:02:13,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:13,065 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-21 22:02:13,065 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:13,071 INFO  L225             Difference]: With dead ends: 437
[2020-10-21 22:02:13,071 INFO  L226             Difference]: Without dead ends: 437
[2020-10-21 22:02:13,071 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:13,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2020-10-21 22:02:13,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 405.
[2020-10-21 22:02:13,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 405 states.
[2020-10-21 22:02:13,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 1194 transitions.
[2020-10-21 22:02:13,090 INFO  L78                 Accepts]: Start accepts. Automaton has 405 states and 1194 transitions. Word has length 13
[2020-10-21 22:02:13,090 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:13,090 INFO  L481      AbstractCegarLoop]: Abstraction has 405 states and 1194 transitions.
[2020-10-21 22:02:13,090 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:02:13,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 405 states and 1194 transitions.
[2020-10-21 22:02:13,091 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:02:13,091 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:13,091 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:13,092 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-21 22:02:13,092 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:13,092 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:13,092 INFO  L82        PathProgramCache]: Analyzing trace with hash 1122009596, now seen corresponding path program 1 times
[2020-10-21 22:02:13,092 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:13,093 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146422474]
[2020-10-21 22:02:13,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:13,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:13,193 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-21 22:02:13,193 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146422474]
[2020-10-21 22:02:13,194 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:13,194 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:02:13,194 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548820417]
[2020-10-21 22:02:13,194 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:02:13,195 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:13,195 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:02:13,195 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:13,195 INFO  L87              Difference]: Start difference. First operand 405 states and 1194 transitions. Second operand 6 states.
[2020-10-21 22:02:13,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:13,374 INFO  L93              Difference]: Finished difference Result 452 states and 1327 transitions.
[2020-10-21 22:02:13,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:02:13,375 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2020-10-21 22:02:13,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:13,379 INFO  L225             Difference]: With dead ends: 452
[2020-10-21 22:02:13,379 INFO  L226             Difference]: Without dead ends: 452
[2020-10-21 22:02:13,380 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:02:13,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2020-10-21 22:02:13,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 444.
[2020-10-21 22:02:13,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 444 states.
[2020-10-21 22:02:13,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1309 transitions.
[2020-10-21 22:02:13,394 INFO  L78                 Accepts]: Start accepts. Automaton has 444 states and 1309 transitions. Word has length 13
[2020-10-21 22:02:13,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:13,394 INFO  L481      AbstractCegarLoop]: Abstraction has 444 states and 1309 transitions.
[2020-10-21 22:02:13,394 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:02:13,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 444 states and 1309 transitions.
[2020-10-21 22:02:13,396 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:02:13,396 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:13,396 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:13,396 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-21 22:02:13,396 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:13,396 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:13,397 INFO  L82        PathProgramCache]: Analyzing trace with hash -313686143, now seen corresponding path program 1 times
[2020-10-21 22:02:13,397 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:13,397 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698447039]
[2020-10-21 22:02:13,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:13,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:13,430 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-21 22:02:13,431 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698447039]
[2020-10-21 22:02:13,431 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:13,431 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:02:13,431 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372100466]
[2020-10-21 22:02:13,432 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:02:13,432 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:13,432 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:02:13,432 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:13,432 INFO  L87              Difference]: Start difference. First operand 444 states and 1309 transitions. Second operand 3 states.
[2020-10-21 22:02:13,450 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:13,451 INFO  L93              Difference]: Finished difference Result 635 states and 1812 transitions.
[2020-10-21 22:02:13,452 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:02:13,452 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-21 22:02:13,452 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:13,456 INFO  L225             Difference]: With dead ends: 635
[2020-10-21 22:02:13,456 INFO  L226             Difference]: Without dead ends: 458
[2020-10-21 22:02:13,456 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:02:13,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 458 states.
[2020-10-21 22:02:13,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 434.
[2020-10-21 22:02:13,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 434 states.
[2020-10-21 22:02:13,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1219 transitions.
[2020-10-21 22:02:13,470 INFO  L78                 Accepts]: Start accepts. Automaton has 434 states and 1219 transitions. Word has length 13
[2020-10-21 22:02:13,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:13,470 INFO  L481      AbstractCegarLoop]: Abstraction has 434 states and 1219 transitions.
[2020-10-21 22:02:13,470 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:02:13,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 434 states and 1219 transitions.
[2020-10-21 22:02:13,471 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:02:13,472 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:13,472 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:13,472 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-21 22:02:13,472 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:13,472 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:13,472 INFO  L82        PathProgramCache]: Analyzing trace with hash 422472500, now seen corresponding path program 1 times
[2020-10-21 22:02:13,473 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:13,473 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944470331]
[2020-10-21 22:02:13,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:13,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:13,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:02:13,593 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944470331]
[2020-10-21 22:02:13,593 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:13,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:02:13,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910121592]
[2020-10-21 22:02:13,594 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:02:13,594 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:13,594 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:02:13,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:13,595 INFO  L87              Difference]: Start difference. First operand 434 states and 1219 transitions. Second operand 6 states.
[2020-10-21 22:02:13,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:13,694 INFO  L93              Difference]: Finished difference Result 448 states and 1250 transitions.
[2020-10-21 22:02:13,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:13,696 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:02:13,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:13,699 INFO  L225             Difference]: With dead ends: 448
[2020-10-21 22:02:13,699 INFO  L226             Difference]: Without dead ends: 448
[2020-10-21 22:02:13,699 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:13,701 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 448 states.
[2020-10-21 22:02:13,709 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 412.
[2020-10-21 22:02:13,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 412 states.
[2020-10-21 22:02:13,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1154 transitions.
[2020-10-21 22:02:13,711 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 1154 transitions. Word has length 14
[2020-10-21 22:02:13,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:13,712 INFO  L481      AbstractCegarLoop]: Abstraction has 412 states and 1154 transitions.
[2020-10-21 22:02:13,712 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:02:13,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 1154 transitions.
[2020-10-21 22:02:13,713 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:02:13,713 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:13,713 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:13,713 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-21 22:02:13,713 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:13,713 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:13,714 INFO  L82        PathProgramCache]: Analyzing trace with hash 422479227, now seen corresponding path program 1 times
[2020-10-21 22:02:13,714 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:13,714 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796402760]
[2020-10-21 22:02:13,714 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:13,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:13,937 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-21 22:02:13,937 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796402760]
[2020-10-21 22:02:13,937 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:13,938 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:02:13,938 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791783864]
[2020-10-21 22:02:13,938 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:02:13,938 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:13,938 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:02:13,939 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:13,939 INFO  L87              Difference]: Start difference. First operand 412 states and 1154 transitions. Second operand 6 states.
[2020-10-21 22:02:14,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:14,045 INFO  L93              Difference]: Finished difference Result 540 states and 1456 transitions.
[2020-10-21 22:02:14,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:14,046 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:02:14,047 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:14,050 INFO  L225             Difference]: With dead ends: 540
[2020-10-21 22:02:14,050 INFO  L226             Difference]: Without dead ends: 436
[2020-10-21 22:02:14,050 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:14,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 436 states.
[2020-10-21 22:02:14,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418.
[2020-10-21 22:02:14,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 418 states.
[2020-10-21 22:02:14,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1147 transitions.
[2020-10-21 22:02:14,062 INFO  L78                 Accepts]: Start accepts. Automaton has 418 states and 1147 transitions. Word has length 14
[2020-10-21 22:02:14,063 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:14,063 INFO  L481      AbstractCegarLoop]: Abstraction has 418 states and 1147 transitions.
[2020-10-21 22:02:14,063 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:02:14,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 418 states and 1147 transitions.
[2020-10-21 22:02:14,064 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:02:14,064 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:14,064 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:14,064 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-21 22:02:14,064 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:14,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:14,065 INFO  L82        PathProgramCache]: Analyzing trace with hash -1132759919, now seen corresponding path program 1 times
[2020-10-21 22:02:14,065 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:14,065 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239397286]
[2020-10-21 22:02:14,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:14,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:14,101 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-21 22:02:14,102 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239397286]
[2020-10-21 22:02:14,102 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:14,102 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:02:14,103 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249191502]
[2020-10-21 22:02:14,103 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:02:14,103 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:14,103 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:02:14,103 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:02:14,104 INFO  L87              Difference]: Start difference. First operand 418 states and 1147 transitions. Second operand 4 states.
[2020-10-21 22:02:14,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:14,133 INFO  L93              Difference]: Finished difference Result 688 states and 1876 transitions.
[2020-10-21 22:02:14,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-21 22:02:14,134 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-21 22:02:14,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:14,137 INFO  L225             Difference]: With dead ends: 688
[2020-10-21 22:02:14,137 INFO  L226             Difference]: Without dead ends: 394
[2020-10-21 22:02:14,138 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:14,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 394 states.
[2020-10-21 22:02:14,147 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394.
[2020-10-21 22:02:14,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 394 states.
[2020-10-21 22:02:14,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1059 transitions.
[2020-10-21 22:02:14,149 INFO  L78                 Accepts]: Start accepts. Automaton has 394 states and 1059 transitions. Word has length 14
[2020-10-21 22:02:14,149 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:14,149 INFO  L481      AbstractCegarLoop]: Abstraction has 394 states and 1059 transitions.
[2020-10-21 22:02:14,149 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:02:14,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 394 states and 1059 transitions.
[2020-10-21 22:02:14,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:02:14,150 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:14,151 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:14,151 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-21 22:02:14,151 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:14,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:14,151 INFO  L82        PathProgramCache]: Analyzing trace with hash -1854000029, now seen corresponding path program 2 times
[2020-10-21 22:02:14,151 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:14,152 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938943056]
[2020-10-21 22:02:14,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:14,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:14,220 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-21 22:02:14,221 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938943056]
[2020-10-21 22:02:14,221 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:14,221 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:02:14,221 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728056859]
[2020-10-21 22:02:14,221 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:02:14,221 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:14,222 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:02:14,222 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:02:14,222 INFO  L87              Difference]: Start difference. First operand 394 states and 1059 transitions. Second operand 4 states.
[2020-10-21 22:02:14,257 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:14,257 INFO  L93              Difference]: Finished difference Result 402 states and 957 transitions.
[2020-10-21 22:02:14,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:02:14,258 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-21 22:02:14,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:14,260 INFO  L225             Difference]: With dead ends: 402
[2020-10-21 22:02:14,260 INFO  L226             Difference]: Without dead ends: 296
[2020-10-21 22:02:14,260 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:14,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2020-10-21 22:02:14,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296.
[2020-10-21 22:02:14,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 296 states.
[2020-10-21 22:02:14,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 693 transitions.
[2020-10-21 22:02:14,268 INFO  L78                 Accepts]: Start accepts. Automaton has 296 states and 693 transitions. Word has length 14
[2020-10-21 22:02:14,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:14,268 INFO  L481      AbstractCegarLoop]: Abstraction has 296 states and 693 transitions.
[2020-10-21 22:02:14,268 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:02:14,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 296 states and 693 transitions.
[2020-10-21 22:02:14,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:02:14,269 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:14,269 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:14,269 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-21 22:02:14,269 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:14,270 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:14,270 INFO  L82        PathProgramCache]: Analyzing trace with hash 1637663200, now seen corresponding path program 1 times
[2020-10-21 22:02:14,270 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:14,270 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745635541]
[2020-10-21 22:02:14,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:14,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:14,345 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-21 22:02:14,346 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745635541]
[2020-10-21 22:02:14,346 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:14,347 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:02:14,347 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439969720]
[2020-10-21 22:02:14,347 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:02:14,347 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:14,348 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:02:14,348 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:02:14,348 INFO  L87              Difference]: Start difference. First operand 296 states and 693 transitions. Second operand 5 states.
[2020-10-21 22:02:14,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:14,395 INFO  L93              Difference]: Finished difference Result 252 states and 532 transitions.
[2020-10-21 22:02:14,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:02:14,396 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-21 22:02:14,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:14,397 INFO  L225             Difference]: With dead ends: 252
[2020-10-21 22:02:14,397 INFO  L226             Difference]: Without dead ends: 191
[2020-10-21 22:02:14,398 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:14,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2020-10-21 22:02:14,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191.
[2020-10-21 22:02:14,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 191 states.
[2020-10-21 22:02:14,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 390 transitions.
[2020-10-21 22:02:14,408 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 390 transitions. Word has length 15
[2020-10-21 22:02:14,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:14,408 INFO  L481      AbstractCegarLoop]: Abstraction has 191 states and 390 transitions.
[2020-10-21 22:02:14,408 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:02:14,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 390 transitions.
[2020-10-21 22:02:14,409 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-21 22:02:14,409 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:14,409 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:14,409 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-21 22:02:14,409 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:14,410 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:14,410 INFO  L82        PathProgramCache]: Analyzing trace with hash 70390188, now seen corresponding path program 1 times
[2020-10-21 22:02:14,410 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:14,410 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466021490]
[2020-10-21 22:02:14,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:14,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:14,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:02:14,878 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466021490]
[2020-10-21 22:02:14,879 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:14,879 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-21 22:02:14,879 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120263677]
[2020-10-21 22:02:14,879 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-21 22:02:14,880 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:14,880 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-21 22:02:14,880 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:02:14,880 INFO  L87              Difference]: Start difference. First operand 191 states and 390 transitions. Second operand 8 states.
[2020-10-21 22:02:15,119 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:15,120 INFO  L93              Difference]: Finished difference Result 208 states and 414 transitions.
[2020-10-21 22:02:15,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:02:15,121 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 17
[2020-10-21 22:02:15,121 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:15,122 INFO  L225             Difference]: With dead ends: 208
[2020-10-21 22:02:15,122 INFO  L226             Difference]: Without dead ends: 140
[2020-10-21 22:02:15,122 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110
[2020-10-21 22:02:15,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2020-10-21 22:02:15,126 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129.
[2020-10-21 22:02:15,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2020-10-21 22:02:15,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 262 transitions.
[2020-10-21 22:02:15,127 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 262 transitions. Word has length 17
[2020-10-21 22:02:15,127 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:15,127 INFO  L481      AbstractCegarLoop]: Abstraction has 129 states and 262 transitions.
[2020-10-21 22:02:15,127 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-21 22:02:15,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 262 transitions.
[2020-10-21 22:02:15,128 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-21 22:02:15,128 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:15,128 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:15,128 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-21 22:02:15,128 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:15,128 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:15,128 INFO  L82        PathProgramCache]: Analyzing trace with hash 630847422, now seen corresponding path program 1 times
[2020-10-21 22:02:15,129 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:15,129 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669347882]
[2020-10-21 22:02:15,129 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:15,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:02:15,213 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-21 22:02:15,213 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669347882]
[2020-10-21 22:02:15,213 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:02:15,213 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:02:15,214 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831072244]
[2020-10-21 22:02:15,214 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:02:15,214 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:02:15,214 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:02:15,215 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:02:15,215 INFO  L87              Difference]: Start difference. First operand 129 states and 262 transitions. Second operand 6 states.
[2020-10-21 22:02:15,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:02:15,269 INFO  L93              Difference]: Finished difference Result 115 states and 233 transitions.
[2020-10-21 22:02:15,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:02:15,270 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-21 22:02:15,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:02:15,271 INFO  L225             Difference]: With dead ends: 115
[2020-10-21 22:02:15,271 INFO  L226             Difference]: Without dead ends: 69
[2020-10-21 22:02:15,271 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:02:15,272 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 69 states.
[2020-10-21 22:02:15,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69.
[2020-10-21 22:02:15,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 69 states.
[2020-10-21 22:02:15,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 128 transitions.
[2020-10-21 22:02:15,274 INFO  L78                 Accepts]: Start accepts. Automaton has 69 states and 128 transitions. Word has length 17
[2020-10-21 22:02:15,274 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:02:15,274 INFO  L481      AbstractCegarLoop]: Abstraction has 69 states and 128 transitions.
[2020-10-21 22:02:15,274 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:02:15,274 INFO  L276                IsEmpty]: Start isEmpty. Operand 69 states and 128 transitions.
[2020-10-21 22:02:15,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-21 22:02:15,275 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:02:15,275 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:02:15,275 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-21 22:02:15,275 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:02:15,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:02:15,276 INFO  L82        PathProgramCache]: Analyzing trace with hash -1828977790, now seen corresponding path program 1 times
[2020-10-21 22:02:15,276 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:02:15,276 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114417060]
[2020-10-21 22:02:15,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:02:15,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:02:15,318 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:02:15,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:02:15,354 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:02:15,392 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-21 22:02:15,392 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-21 22:02:15,392 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-21 22:02:15,393 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-21 22:02:15,405 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1053] [1053] L2-->L829: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In-524790654 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In-524790654 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-524790654 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-524790654 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-524790654 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-524790654|) (or (and .cse0 (= ~y$w_buff0_used~0_Out-524790654 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_In-524790654 ~y$w_buff0_used~0_Out-524790654))) (= ~y$r_buff1_thd0~0_Out-524790654 ~y$r_buff1_thd0~0_In-524790654) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-524790654 0)) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out-524790654 0)) (and (= ~y$w_buff1_used~0_Out-524790654 ~y$w_buff1_used~0_In-524790654) .cse5)) (= ~y$r_buff0_thd0~0_Out-524790654 ~y$r_buff0_thd0~0_In-524790654) (or (and .cse0 .cse1 (= ~y$w_buff0~0_In-524790654 ~y~0_Out-524790654)) (and .cse2 (or (and .cse3 .cse4 (= ~y~0_Out-524790654 ~y$w_buff1~0_In-524790654)) (and (= ~y~0_In-524790654 ~y~0_Out-524790654) .cse5)))))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-524790654|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-524790654, ~y$w_buff1~0=~y$w_buff1~0_In-524790654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-524790654, ~y$w_buff0~0=~y$w_buff0~0_In-524790654, ~y~0=~y~0_In-524790654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-524790654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-524790654}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-524790654, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-524790654|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-524790654|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-524790654|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-524790654|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-524790654|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-524790654|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-524790654|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-524790654, ~y$w_buff1~0=~y$w_buff1~0_In-524790654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-524790654, ~y$w_buff0~0=~y$w_buff0~0_In-524790654, ~y~0=~y~0_Out-524790654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-524790654, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-524790654}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-21 22:02:15,410 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-21 22:02:15,410 WARN  L224     RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738]
[2020-10-21 22:02:15,413 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-21 22:02:15,413 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,413 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-21 22:02:15,413 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,413 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-21 22:02:15,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,414 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-21 22:02:15,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,414 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-21 22:02:15,414 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,415 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-21 22:02:15,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,415 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-21 22:02:15,415 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,416 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-21 22:02:15,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,416 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-21 22:02:15,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,416 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-21 22:02:15,416 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,417 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-21 22:02:15,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,417 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-21 22:02:15,417 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,418 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-21 22:02:15,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,418 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-21 22:02:15,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,418 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-21 22:02:15,418 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,419 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-21 22:02:15,419 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,420 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-21 22:02:15,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,420 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-21 22:02:15,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,420 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-21 22:02:15,420 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,421 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-21 22:02:15,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,421 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-21 22:02:15,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,421 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-21 22:02:15,421 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,422 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-21 22:02:15,422 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,422 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-21 22:02:15,422 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,422 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-21 22:02:15,422 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,422 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-21 22:02:15,423 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,423 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-21 22:02:15,423 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,423 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-21 22:02:15,423 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:02:15,492 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:02:15 BasicIcfg
[2020-10-21 22:02:15,492 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-21 22:02:15,494 INFO  L168              Benchmark]: Toolchain (without parser) took 18618.34 ms. Allocated memory was 145.8 MB in the beginning and 459.3 MB in the end (delta: 313.5 MB). Free memory was 100.7 MB in the beginning and 299.9 MB in the end (delta: -199.2 MB). Peak memory consumption was 114.3 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,495 INFO  L168              Benchmark]: CDTParser took 4.06 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,495 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 940.44 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.6 MB in the beginning and 153.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,496 INFO  L168              Benchmark]: Boogie Procedure Inliner took 79.00 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,496 INFO  L168              Benchmark]: Boogie Preprocessor took 43.56 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,497 INFO  L168              Benchmark]: RCFGBuilder took 2441.84 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 148.0 MB in the beginning and 169.3 MB in the end (delta: -21.3 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,498 INFO  L168              Benchmark]: TraceAbstraction took 15103.03 ms. Allocated memory was 249.6 MB in the beginning and 459.3 MB in the end (delta: 209.7 MB). Free memory was 169.3 MB in the beginning and 299.9 MB in the end (delta: -130.6 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB.
[2020-10-21 22:02:15,501 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 4.06 ms. Allocated memory is still 145.8 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 940.44 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 99.6 MB in the beginning and 153.6 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 79.00 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 43.56 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2441.84 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 148.0 MB in the beginning and 169.3 MB in the end (delta: -21.3 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 15103.03 ms. Allocated memory was 249.6 MB in the beginning and 459.3 MB in the end (delta: 209.7 MB). Free memory was 169.3 MB in the beginning and 299.9 MB in the end (delta: -130.6 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1170 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 103 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.1s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 26 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 4794 MoverChecksTotal
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L712]               0  _Bool main$tmp_guard0;
[L713]               0  _Bool main$tmp_guard1;
[L715]               0  int x = 0;
[L717]               0  int y = 0;
[L718]               0  _Bool y$flush_delayed;
[L719]               0  int y$mem_tmp;
[L720]               0  _Bool y$r_buff0_thd0;
[L721]               0  _Bool y$r_buff0_thd1;
[L722]               0  _Bool y$r_buff0_thd2;
[L723]               0  _Bool y$r_buff0_thd3;
[L724]               0  _Bool y$r_buff1_thd0;
[L725]               0  _Bool y$r_buff1_thd1;
[L726]               0  _Bool y$r_buff1_thd2;
[L727]               0  _Bool y$r_buff1_thd3;
[L728]               0  _Bool y$read_delayed;
[L729]               0  int *y$read_delayed_var;
[L730]               0  int y$w_buff0;
[L731]               0  _Bool y$w_buff0_used;
[L732]               0  int y$w_buff1;
[L733]               0  _Bool y$w_buff1_used;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L813]               0  pthread_t t2177;
[L814]  FCALL, FORK  0  pthread_create(&t2177, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L739]               1  y$w_buff1 = y$w_buff0
[L740]               1  y$w_buff0 = 2
[L741]               1  y$w_buff1_used = y$w_buff0_used
[L742]               1  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L744]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L745]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L746]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L747]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L748]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L815]               0  pthread_t t2178;
[L816]  FCALL, FORK  0  pthread_create(&t2178, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L817]               0  pthread_t t2179;
[L818]  FCALL, FORK  0  pthread_create(&t2179, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L751]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L768]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L771]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L771]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L772]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L772]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L773]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L773]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L774]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L774]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L775]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L775]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L785]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L788]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L791]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L793]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L795]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L795]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L798]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L800]               3  return 0;
[L754]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L754]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L755]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L755]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L756]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L756]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L757]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L757]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L758]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L758]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L761]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L763]               1  return 0;
[L778]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L780]               2  return 0;
[L820]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L831]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L832]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L833]               0  y$flush_delayed = weak$$choice2
[L834]               0  y$mem_tmp = y
[L835]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L835]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L836]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L836]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L836]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0
[L836]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L836]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L836]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L837]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L837]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L838]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L838]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L839]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L840]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L840]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L840]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L840]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L840]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L841]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L841]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L842]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2)
[L843]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L843]               0  y = y$flush_delayed ? y$mem_tmp : y
[L844]               0  y$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L17]   COND FALSE   0  !(0)
[L17]                0  __assert_fail ("0", "safe017_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, HoareTripleCheckerStatistics: 329 SDtfs, 348 SDslu, 493 SDs, 0 SdLazy, 369 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 137 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 27263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...