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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:09:09,392 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:09:09,396 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:09:09,442 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:09:09,443 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:09:09,454 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:09:09,456 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:09:09,460 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:09:09,461 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:09:09,463 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:09:09,464 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:09:09,466 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:09:09,466 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:09:09,468 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:09:09,471 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:09:09,473 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:09:09,474 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:09:09,476 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:09:09,478 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:09:09,485 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:09:09,488 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:09:09,490 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:09:09,491 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:09:09,492 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:09:09,497 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:09:09,498 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:09:09,498 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:09:09,501 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:09:09,501 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:09:09,503 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:09:09,503 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:09:09,504 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:09:09,505 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:09:09,506 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:09:09,507 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:09:09,507 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:09:09,508 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:09:09,508 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:09:09,508 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:09:09,509 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:09:09,510 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:09:09,511 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:09:09,553 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:09:09,553 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:09:09,555 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:09:09,555 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:09:09,555 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:09:09,556 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:09:09,556 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:09:09,556 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:09:09,556 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:09:09,556 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:09:09,557 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:09:09,558 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:09:09,558 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:09:09,558 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:09:09,559 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:09:09,559 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:09:09,559 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:09:09,559 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:09:09,559 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:09:09,560 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:09:09,560 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:09:09,560 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:09:09,560 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:09:09,560 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:09:09,561 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:09:09,561 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:09:09,561 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:09:09,561 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:09:09,561 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:09:09,562 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:09:09,890 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:09:09,908 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:09:09,912 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:09:09,913 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:09:09,914 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:09:09,915 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 11:09:09,977 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f37b371b4/acb4ec70317c4010bfe1716528d287c0/FLAG1b5937b5b
[2020-10-16 11:09:10,580 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:09:10,581 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-16 11:09:10,599 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f37b371b4/acb4ec70317c4010bfe1716528d287c0/FLAG1b5937b5b
[2020-10-16 11:09:10,838 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f37b371b4/acb4ec70317c4010bfe1716528d287c0
[2020-10-16 11:09:10,848 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:09:10,851 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:09:10,852 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:09:10,852 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:09:10,858 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:09:10,859 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:09:10" (1/1) ...
[2020-10-16 11:09:10,863 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0a647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:10, skipping insertion in model container
[2020-10-16 11:09:10,863 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:09:10" (1/1) ...
[2020-10-16 11:09:10,871 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:09:10,945 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:09:11,417 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:09:11,431 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:09:11,544 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:09:11,629 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:09:11,630 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11 WrapperNode
[2020-10-16 11:09:11,630 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:09:11,631 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:09:11,631 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:09:11,631 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:09:11,640 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,661 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,703 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:09:11,704 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:09:11,704 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:09:11,704 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:09:11,714 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,715 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,720 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,721 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,746 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,751 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,756 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
[2020-10-16 11:09:11,764 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:09:11,767 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:09:11,767 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:09:11,767 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:09:11,768 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:09:11,830 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:09:11,830 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:09:11,831 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:09:11,831 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:09:11,831 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:09:11,831 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:09:11,831 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:09:11,831 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:09:11,832 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 11:09:11,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 11:09:11,832 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-16 11:09:11,832 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-16 11:09:11,833 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:09:11,833 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:09:11,833 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:09:11,840 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:09:14,022 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:09:14,023 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:09:14,025 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:09:14 BoogieIcfgContainer
[2020-10-16 11:09:14,025 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:09:14,027 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:09:14,027 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:09:14,031 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:09:14,031 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:09:10" (1/3) ...
[2020-10-16 11:09:14,032 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d918423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:09:14, skipping insertion in model container
[2020-10-16 11:09:14,032 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:09:11" (2/3) ...
[2020-10-16 11:09:14,033 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d918423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:09:14, skipping insertion in model container
[2020-10-16 11:09:14,033 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:09:14" (3/3) ...
[2020-10-16 11:09:14,035 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i
[2020-10-16 11:09:14,047 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:09:14,048 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:09:14,056 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:09:14,058 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:09:14,090 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,090 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,091 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,091 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,091 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,091 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,092 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,092 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,092 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,093 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,094 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,094 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,095 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,095 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,095 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,096 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,096 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,096 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,097 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,098 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,099 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,099 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,099 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,099 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,100 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,100 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,100 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,100 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,101 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,101 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,101 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,101 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,102 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,106 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,106 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,106 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,106 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,107 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,107 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,107 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,107 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,107 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,108 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,112 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,112 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,112 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,115 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,116 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,116 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,117 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,119 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,119 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,119 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,120 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,120 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,120 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,120 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,120 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,121 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:09:14,123 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:09:14,138 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-16 11:09:14,160 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:09:14,161 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:09:14,161 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:09:14,161 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:09:14,161 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:09:14,161 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:09:14,162 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:09:14,162 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:09:14,177 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:09:14,180 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 11:09:14,183 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-16 11:09:14,185 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-16 11:09:14,239 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-16 11:09:14,239 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:09:14,245 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-16 11:09:14,252 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2572
[2020-10-16 11:09:14,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,415 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,418 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:14,419 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,459 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,460 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,462 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:14,462 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,565 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:14,578 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,581 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,581 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,590 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,600 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,600 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,602 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,603 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,653 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:14,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:14,659 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:09:14,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,780 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,782 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:14,783 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:14,786 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:09:14,789 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,831 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:14,831 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:14,843 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,843 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,844 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,845 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,848 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,848 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,853 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,856 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,856 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:14,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:14,937 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:09:14,940 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,940 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:14,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:14,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,988 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,990 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,991 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,992 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:14,993 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:14,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:14,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:14,998 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:14,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,135 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,163 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,166 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,247 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,248 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,249 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,292 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,293 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,371 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:15,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:15,396 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:15,937 WARN  L193               SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:09:16,068 WARN  L193               SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:09:16,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,087 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,104 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,106 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,141 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:16,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 11:09:16,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:16,173 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,174 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,174 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,257 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,257 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,259 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,283 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,284 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:16,351 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:16,360 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:16,361 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,362 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:16,362 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:16,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:16,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:16,367 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:16,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:16,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:16,372 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:16,372 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,375 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,376 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,421 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,421 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:16,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:09:16,426 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:16,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,463 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,464 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,465 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,465 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,488 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:16,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:16,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:16,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:18,187 WARN  L193               SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2020-10-16 11:09:18,196 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term
[2020-10-16 11:09:18,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:18,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:18,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,519 WARN  L193               SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 148 DAG size of output: 128
[2020-10-16 11:09:19,539 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:19,540 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:19,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,556 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:19,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:19,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-16 11:09:19,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:19,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:19,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:19,605 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:19,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:19,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:19,613 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:19,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:19,616 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:19,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:19,617 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:19,619 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:19,619 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,621 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:19,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,623 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:19,624 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-16 11:09:19,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,688 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-16 11:09:19,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:19,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:19,691 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:09:19,693 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-16 11:09:19,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,086 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,086 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:20,087 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,092 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,094 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,096 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,096 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,097 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,098 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,119 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:20,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,236 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,237 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:20,238 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,239 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,259 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,260 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:20,261 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,262 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,263 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,264 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,267 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,269 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,269 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,274 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,280 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,280 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,477 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,478 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:20,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,480 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:20,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,499 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,502 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,504 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,505 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,583 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,583 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,584 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:20,584 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,585 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,585 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,589 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,592 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,593 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:20,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,620 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:20,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:20,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,768 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,769 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,772 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,772 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,773 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,774 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,775 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:20,775 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:20,795 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,796 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:20,797 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:20,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,286 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:21,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:09:21,288 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:21,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:21,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:21,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-16 11:09:21,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:21,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:21,320 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:21,322 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,324 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-16 11:09:21,327 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,328 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,328 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:21,330 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:21,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:22,320 WARN  L193               SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112
[2020-10-16 11:09:22,640 WARN  L193               SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 109
[2020-10-16 11:09:23,027 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 11:09:23,131 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 11:09:24,353 WARN  L193               SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 147 DAG size of output: 137
[2020-10-16 11:09:24,926 WARN  L193               SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-16 11:09:24,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:09:24,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:24,971 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:09:24,972 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:25,073 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,074 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:25,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,089 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,090 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:09:25,092 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:09:25,151 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:09:25,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,180 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,180 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,183 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:09:25,187 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:09:25,198 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,200 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,201 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:09:25,202 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:25,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:09:25,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:09:25,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:09:25,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:09:25,525 WARN  L193               SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-16 11:09:25,660 WARN  L193               SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-16 11:09:25,716 INFO  L132        LiptonReduction]: Checked pairs total: 7948
[2020-10-16 11:09:25,716 INFO  L134        LiptonReduction]: Total number of compositions: 91
[2020-10-16 11:09:25,723 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-16 11:09:25,976 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-16 11:09:25,979 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-16 11:09:25,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:09:25,989 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:25,990 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:25,991 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:25,998 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:25,998 INFO  L82        PathProgramCache]: Analyzing trace with hash 51217073, now seen corresponding path program 1 times
[2020-10-16 11:09:26,011 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:26,012 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285027632]
[2020-10-16 11:09:26,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:26,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:26,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:26,324 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285027632]
[2020-10-16 11:09:26,326 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:26,326 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:09:26,327 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782374077]
[2020-10-16 11:09:26,333 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:09:26,333 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:26,350 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:09:26,351 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:09:26,353 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-16 11:09:26,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:26,512 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-16 11:09:26,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:26,514 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:09:26,515 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:26,560 INFO  L225             Difference]: With dead ends: 3250
[2020-10-16 11:09:26,560 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-16 11:09:26,562 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-16 11:09:26,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-16 11:09:26,760 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-16 11:09:26,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-16 11:09:26,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-16 11:09:26,782 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-16 11:09:26,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:26,783 INFO  L481      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-16 11:09:26,783 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:09:26,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-16 11:09:26,786 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 11:09:26,786 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:26,786 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:26,787 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:09:26,787 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:26,787 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:26,788 INFO  L82        PathProgramCache]: Analyzing trace with hash -386244636, now seen corresponding path program 1 times
[2020-10-16 11:09:26,788 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:26,788 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366479612]
[2020-10-16 11:09:26,788 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:26,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:26,899 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:26,899 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366479612]
[2020-10-16 11:09:26,900 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:26,900 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:09:26,900 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162458275]
[2020-10-16 11:09:26,902 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:09:26,902 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:26,902 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:09:26,902 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:09:26,903 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-16 11:09:26,983 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:26,984 INFO  L93              Difference]: Finished difference Result 2638 states and 10170 transitions.
[2020-10-16 11:09:26,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:26,985 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-16 11:09:26,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:27,012 INFO  L225             Difference]: With dead ends: 2638
[2020-10-16 11:09:27,012 INFO  L226             Difference]: Without dead ends: 2638
[2020-10-16 11:09:27,013 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-16 11:09:27,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2638 states.
[2020-10-16 11:09:27,192 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638.
[2020-10-16 11:09:27,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2638 states.
[2020-10-16 11:09:27,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 10170 transitions.
[2020-10-16 11:09:27,209 INFO  L78                 Accepts]: Start accepts. Automaton has 2638 states and 10170 transitions. Word has length 11
[2020-10-16 11:09:27,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:27,210 INFO  L481      AbstractCegarLoop]: Abstraction has 2638 states and 10170 transitions.
[2020-10-16 11:09:27,210 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:09:27,210 INFO  L276                IsEmpty]: Start isEmpty. Operand 2638 states and 10170 transitions.
[2020-10-16 11:09:27,213 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:09:27,213 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:27,213 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:27,213 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:09:27,214 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:27,214 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:27,215 INFO  L82        PathProgramCache]: Analyzing trace with hash -1325904802, now seen corresponding path program 1 times
[2020-10-16 11:09:27,215 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:27,215 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16805302]
[2020-10-16 11:09:27,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:27,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:27,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:27,296 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16805302]
[2020-10-16 11:09:27,297 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:27,297 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:09:27,297 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801824380]
[2020-10-16 11:09:27,297 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:09:27,298 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:27,298 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:09:27,298 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:09:27,298 INFO  L87              Difference]: Start difference. First operand 2638 states and 10170 transitions. Second operand 3 states.
[2020-10-16 11:09:27,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:27,335 INFO  L93              Difference]: Finished difference Result 2442 states and 9320 transitions.
[2020-10-16 11:09:27,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:27,336 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:09:27,336 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:27,359 INFO  L225             Difference]: With dead ends: 2442
[2020-10-16 11:09:27,360 INFO  L226             Difference]: Without dead ends: 2442
[2020-10-16 11:09:27,360 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-16 11:09:27,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2442 states.
[2020-10-16 11:09:27,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442.
[2020-10-16 11:09:27,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2442 states.
[2020-10-16 11:09:27,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions.
[2020-10-16 11:09:27,469 INFO  L78                 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 12
[2020-10-16 11:09:27,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:27,470 INFO  L481      AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions.
[2020-10-16 11:09:27,470 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:09:27,470 INFO  L276                IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions.
[2020-10-16 11:09:27,474 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:09:27,474 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:27,474 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:27,475 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:09:27,475 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:27,475 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:27,475 INFO  L82        PathProgramCache]: Analyzing trace with hash 1389686444, now seen corresponding path program 1 times
[2020-10-16 11:09:27,476 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:27,476 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547315562]
[2020-10-16 11:09:27,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:27,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:27,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:27,578 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547315562]
[2020-10-16 11:09:27,578 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:27,578 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:09:27,579 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822604817]
[2020-10-16 11:09:27,579 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:27,579 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:27,580 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:27,580 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:27,580 INFO  L87              Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states.
[2020-10-16 11:09:27,656 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:27,656 INFO  L93              Difference]: Finished difference Result 2418 states and 9214 transitions.
[2020-10-16 11:09:27,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:27,658 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:09:27,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:27,679 INFO  L225             Difference]: With dead ends: 2418
[2020-10-16 11:09:27,679 INFO  L226             Difference]: Without dead ends: 2418
[2020-10-16 11:09:27,680 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:27,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2418 states.
[2020-10-16 11:09:27,758 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418.
[2020-10-16 11:09:27,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2418 states.
[2020-10-16 11:09:27,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions.
[2020-10-16 11:09:27,773 INFO  L78                 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14
[2020-10-16 11:09:27,773 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:27,774 INFO  L481      AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions.
[2020-10-16 11:09:27,774 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:27,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions.
[2020-10-16 11:09:27,776 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:09:27,777 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:27,777 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:27,777 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:09:27,777 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:27,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:27,777 INFO  L82        PathProgramCache]: Analyzing trace with hash -843304651, now seen corresponding path program 1 times
[2020-10-16 11:09:27,778 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:27,778 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17889570]
[2020-10-16 11:09:27,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:27,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:27,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:27,872 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17889570]
[2020-10-16 11:09:27,872 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:27,872 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:09:27,872 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918863694]
[2020-10-16 11:09:27,873 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:27,873 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:27,873 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:27,873 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:27,874 INFO  L87              Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 4 states.
[2020-10-16 11:09:27,949 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:27,949 INFO  L93              Difference]: Finished difference Result 2410 states and 9174 transitions.
[2020-10-16 11:09:27,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:27,951 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 11:09:27,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:27,972 INFO  L225             Difference]: With dead ends: 2410
[2020-10-16 11:09:27,972 INFO  L226             Difference]: Without dead ends: 2410
[2020-10-16 11:09:27,972 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:27,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2410 states.
[2020-10-16 11:09:28,049 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410.
[2020-10-16 11:09:28,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2410 states.
[2020-10-16 11:09:28,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9174 transitions.
[2020-10-16 11:09:28,062 INFO  L78                 Accepts]: Start accepts. Automaton has 2410 states and 9174 transitions. Word has length 14
[2020-10-16 11:09:28,062 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:28,062 INFO  L481      AbstractCegarLoop]: Abstraction has 2410 states and 9174 transitions.
[2020-10-16 11:09:28,063 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:28,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 2410 states and 9174 transitions.
[2020-10-16 11:09:28,066 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:09:28,066 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:28,066 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:28,067 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:09:28,067 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:28,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:28,067 INFO  L82        PathProgramCache]: Analyzing trace with hash 1476424878, now seen corresponding path program 1 times
[2020-10-16 11:09:28,067 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:28,068 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273173713]
[2020-10-16 11:09:28,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:28,091 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:28,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:28,157 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273173713]
[2020-10-16 11:09:28,157 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:28,157 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:28,157 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838647768]
[2020-10-16 11:09:28,158 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:09:28,158 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:28,158 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:09:28,159 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:28,159 INFO  L87              Difference]: Start difference. First operand 2410 states and 9174 transitions. Second operand 5 states.
[2020-10-16 11:09:28,243 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:28,243 INFO  L93              Difference]: Finished difference Result 2362 states and 8974 transitions.
[2020-10-16 11:09:28,244 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:09:28,244 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:09:28,245 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:28,257 INFO  L225             Difference]: With dead ends: 2362
[2020-10-16 11:09:28,258 INFO  L226             Difference]: Without dead ends: 2362
[2020-10-16 11:09:28,258 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-16 11:09:28,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2362 states.
[2020-10-16 11:09:28,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362.
[2020-10-16 11:09:28,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2362 states.
[2020-10-16 11:09:28,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8974 transitions.
[2020-10-16 11:09:28,423 INFO  L78                 Accepts]: Start accepts. Automaton has 2362 states and 8974 transitions. Word has length 15
[2020-10-16 11:09:28,423 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:28,423 INFO  L481      AbstractCegarLoop]: Abstraction has 2362 states and 8974 transitions.
[2020-10-16 11:09:28,423 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:09:28,423 INFO  L276                IsEmpty]: Start isEmpty. Operand 2362 states and 8974 transitions.
[2020-10-16 11:09:28,426 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 11:09:28,427 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:28,427 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:28,427 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:09:28,427 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:28,428 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:28,428 INFO  L82        PathProgramCache]: Analyzing trace with hash 337525371, now seen corresponding path program 1 times
[2020-10-16 11:09:28,428 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:28,428 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92489523]
[2020-10-16 11:09:28,428 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:28,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:28,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:28,558 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92489523]
[2020-10-16 11:09:28,558 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:28,558 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:28,558 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465869481]
[2020-10-16 11:09:28,559 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:09:28,559 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:28,559 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:09:28,559 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:28,559 INFO  L87              Difference]: Start difference. First operand 2362 states and 8974 transitions. Second operand 5 states.
[2020-10-16 11:09:28,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:28,692 INFO  L93              Difference]: Finished difference Result 2434 states and 9238 transitions.
[2020-10-16 11:09:28,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:09:28,693 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 11:09:28,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:28,705 INFO  L225             Difference]: With dead ends: 2434
[2020-10-16 11:09:28,705 INFO  L226             Difference]: Without dead ends: 2434
[2020-10-16 11:09:28,706 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-16 11:09:28,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2434 states.
[2020-10-16 11:09:28,779 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434.
[2020-10-16 11:09:28,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2434 states.
[2020-10-16 11:09:28,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions.
[2020-10-16 11:09:28,792 INFO  L78                 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 15
[2020-10-16 11:09:28,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:28,793 INFO  L481      AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions.
[2020-10-16 11:09:28,793 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:09:28,793 INFO  L276                IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions.
[2020-10-16 11:09:28,798 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:09:28,798 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:28,798 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:28,798 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:09:28,798 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:28,799 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:28,799 INFO  L82        PathProgramCache]: Analyzing trace with hash -1268550471, now seen corresponding path program 1 times
[2020-10-16 11:09:28,799 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:28,799 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064958024]
[2020-10-16 11:09:28,799 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:28,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:28,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:28,889 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064958024]
[2020-10-16 11:09:28,890 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:28,890 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:28,890 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497201834]
[2020-10-16 11:09:28,890 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:28,891 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:28,891 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:28,891 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:28,891 INFO  L87              Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 6 states.
[2020-10-16 11:09:28,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:28,992 INFO  L93              Difference]: Finished difference Result 2922 states and 11176 transitions.
[2020-10-16 11:09:28,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:28,993 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:09:28,993 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:29,006 INFO  L225             Difference]: With dead ends: 2922
[2020-10-16 11:09:29,006 INFO  L226             Difference]: Without dead ends: 2922
[2020-10-16 11:09:29,007 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:29,022 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2922 states.
[2020-10-16 11:09:29,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2634.
[2020-10-16 11:09:29,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2634 states.
[2020-10-16 11:09:29,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 10064 transitions.
[2020-10-16 11:09:29,102 INFO  L78                 Accepts]: Start accepts. Automaton has 2634 states and 10064 transitions. Word has length 16
[2020-10-16 11:09:29,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:29,103 INFO  L481      AbstractCegarLoop]: Abstraction has 2634 states and 10064 transitions.
[2020-10-16 11:09:29,103 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:29,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 2634 states and 10064 transitions.
[2020-10-16 11:09:29,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:09:29,108 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:29,108 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:29,108 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:09:29,109 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:29,109 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:29,109 INFO  L82        PathProgramCache]: Analyzing trace with hash -1475469297, now seen corresponding path program 2 times
[2020-10-16 11:09:29,109 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:29,110 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988601914]
[2020-10-16 11:09:29,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:29,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:29,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:29,219 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988601914]
[2020-10-16 11:09:29,220 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:29,220 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:29,220 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227952284]
[2020-10-16 11:09:29,220 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:29,220 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:29,220 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:29,221 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:29,221 INFO  L87              Difference]: Start difference. First operand 2634 states and 10064 transitions. Second operand 6 states.
[2020-10-16 11:09:29,388 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:29,388 INFO  L93              Difference]: Finished difference Result 2994 states and 11386 transitions.
[2020-10-16 11:09:29,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:29,389 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 11:09:29,390 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:29,404 INFO  L225             Difference]: With dead ends: 2994
[2020-10-16 11:09:29,404 INFO  L226             Difference]: Without dead ends: 2994
[2020-10-16 11:09:29,405 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:29,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2994 states.
[2020-10-16 11:09:29,487 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2786.
[2020-10-16 11:09:29,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2786 states.
[2020-10-16 11:09:29,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 10534 transitions.
[2020-10-16 11:09:29,501 INFO  L78                 Accepts]: Start accepts. Automaton has 2786 states and 10534 transitions. Word has length 16
[2020-10-16 11:09:29,502 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:29,502 INFO  L481      AbstractCegarLoop]: Abstraction has 2786 states and 10534 transitions.
[2020-10-16 11:09:29,502 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:29,502 INFO  L276                IsEmpty]: Start isEmpty. Operand 2786 states and 10534 transitions.
[2020-10-16 11:09:29,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 11:09:29,507 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:29,507 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:29,507 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:09:29,507 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:29,508 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:29,508 INFO  L82        PathProgramCache]: Analyzing trace with hash 1272309844, now seen corresponding path program 1 times
[2020-10-16 11:09:29,508 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:29,508 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502082959]
[2020-10-16 11:09:29,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:29,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:29,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:29,552 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502082959]
[2020-10-16 11:09:29,552 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:29,552 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:09:29,553 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064063458]
[2020-10-16 11:09:29,553 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:09:29,553 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:29,553 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:09:29,554 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:09:29,554 INFO  L87              Difference]: Start difference. First operand 2786 states and 10534 transitions. Second operand 3 states.
[2020-10-16 11:09:29,577 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:29,578 INFO  L93              Difference]: Finished difference Result 2762 states and 10430 transitions.
[2020-10-16 11:09:29,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:29,579 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2020-10-16 11:09:29,579 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:29,593 INFO  L225             Difference]: With dead ends: 2762
[2020-10-16 11:09:29,593 INFO  L226             Difference]: Without dead ends: 2762
[2020-10-16 11:09:29,594 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-16 11:09:29,607 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2762 states.
[2020-10-16 11:09:29,667 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762.
[2020-10-16 11:09:29,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2762 states.
[2020-10-16 11:09:29,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions.
[2020-10-16 11:09:29,679 INFO  L78                 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16
[2020-10-16 11:09:29,680 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:29,680 INFO  L481      AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions.
[2020-10-16 11:09:29,680 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:09:29,680 INFO  L276                IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions.
[2020-10-16 11:09:29,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:29,686 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:29,686 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:29,686 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:09:29,686 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:29,687 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:29,687 INFO  L82        PathProgramCache]: Analyzing trace with hash 1090858828, now seen corresponding path program 1 times
[2020-10-16 11:09:29,687 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:29,687 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909858155]
[2020-10-16 11:09:29,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:29,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:29,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:29,889 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909858155]
[2020-10-16 11:09:29,889 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:29,889 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:29,889 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885823618]
[2020-10-16 11:09:29,890 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:29,890 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:29,890 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:29,890 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:29,891 INFO  L87              Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states.
[2020-10-16 11:09:30,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:30,114 INFO  L93              Difference]: Finished difference Result 3282 states and 12440 transitions.
[2020-10-16 11:09:30,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:30,115 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 11:09:30,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:30,130 INFO  L225             Difference]: With dead ends: 3282
[2020-10-16 11:09:30,130 INFO  L226             Difference]: Without dead ends: 3282
[2020-10-16 11:09:30,130 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:30,145 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3282 states.
[2020-10-16 11:09:30,216 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 2962.
[2020-10-16 11:09:30,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2962 states.
[2020-10-16 11:09:30,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 11256 transitions.
[2020-10-16 11:09:30,231 INFO  L78                 Accepts]: Start accepts. Automaton has 2962 states and 11256 transitions. Word has length 17
[2020-10-16 11:09:30,232 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:30,232 INFO  L481      AbstractCegarLoop]: Abstraction has 2962 states and 11256 transitions.
[2020-10-16 11:09:30,232 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:30,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 2962 states and 11256 transitions.
[2020-10-16 11:09:30,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:30,239 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:30,239 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:30,239 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:09:30,239 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:30,240 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:30,240 INFO  L82        PathProgramCache]: Analyzing trace with hash 1505089744, now seen corresponding path program 2 times
[2020-10-16 11:09:30,240 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:30,240 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787071285]
[2020-10-16 11:09:30,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:30,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:30,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:30,374 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787071285]
[2020-10-16 11:09:30,374 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:30,374 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:30,375 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489596756]
[2020-10-16 11:09:30,375 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:30,375 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:30,375 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:30,376 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:30,376 INFO  L87              Difference]: Start difference. First operand 2962 states and 11256 transitions. Second operand 7 states.
[2020-10-16 11:09:30,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:30,585 INFO  L93              Difference]: Finished difference Result 3082 states and 11638 transitions.
[2020-10-16 11:09:30,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:30,586 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 11:09:30,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:30,597 INFO  L225             Difference]: With dead ends: 3082
[2020-10-16 11:09:30,598 INFO  L226             Difference]: Without dead ends: 3082
[2020-10-16 11:09:30,598 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:09:30,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3082 states.
[2020-10-16 11:09:30,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 2506.
[2020-10-16 11:09:30,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2506 states.
[2020-10-16 11:09:30,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9438 transitions.
[2020-10-16 11:09:30,687 INFO  L78                 Accepts]: Start accepts. Automaton has 2506 states and 9438 transitions. Word has length 17
[2020-10-16 11:09:30,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:30,688 INFO  L481      AbstractCegarLoop]: Abstraction has 2506 states and 9438 transitions.
[2020-10-16 11:09:30,688 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:30,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 2506 states and 9438 transitions.
[2020-10-16 11:09:30,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:30,695 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:30,695 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:30,695 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 11:09:30,696 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:30,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:30,696 INFO  L82        PathProgramCache]: Analyzing trace with hash -2116372454, now seen corresponding path program 1 times
[2020-10-16 11:09:30,696 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:30,697 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178845163]
[2020-10-16 11:09:30,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:30,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:30,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:30,876 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178845163]
[2020-10-16 11:09:30,876 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:30,876 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:30,876 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250227144]
[2020-10-16 11:09:30,876 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:30,877 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:30,877 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:30,877 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:30,877 INFO  L87              Difference]: Start difference. First operand 2506 states and 9438 transitions. Second operand 6 states.
[2020-10-16 11:09:30,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:30,973 INFO  L93              Difference]: Finished difference Result 2482 states and 9338 transitions.
[2020-10-16 11:09:30,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:09:30,975 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:09:30,975 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:30,993 INFO  L225             Difference]: With dead ends: 2482
[2020-10-16 11:09:30,994 INFO  L226             Difference]: Without dead ends: 2482
[2020-10-16 11:09:30,995 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:31,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2482 states.
[2020-10-16 11:09:31,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2482.
[2020-10-16 11:09:31,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2482 states.
[2020-10-16 11:09:31,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9338 transitions.
[2020-10-16 11:09:31,089 INFO  L78                 Accepts]: Start accepts. Automaton has 2482 states and 9338 transitions. Word has length 17
[2020-10-16 11:09:31,089 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:31,089 INFO  L481      AbstractCegarLoop]: Abstraction has 2482 states and 9338 transitions.
[2020-10-16 11:09:31,089 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:31,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 2482 states and 9338 transitions.
[2020-10-16 11:09:31,096 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:31,097 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:31,097 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:31,097 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 11:09:31,097 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:31,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:31,098 INFO  L82        PathProgramCache]: Analyzing trace with hash -2055699750, now seen corresponding path program 1 times
[2020-10-16 11:09:31,098 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:31,098 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768771099]
[2020-10-16 11:09:31,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:31,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:31,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:31,219 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768771099]
[2020-10-16 11:09:31,219 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:31,219 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:31,220 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61094903]
[2020-10-16 11:09:31,220 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:31,220 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:31,220 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:31,221 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:31,221 INFO  L87              Difference]: Start difference. First operand 2482 states and 9338 transitions. Second operand 6 states.
[2020-10-16 11:09:31,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:31,299 INFO  L93              Difference]: Finished difference Result 3454 states and 12839 transitions.
[2020-10-16 11:09:31,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:31,300 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2020-10-16 11:09:31,300 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:31,317 INFO  L225             Difference]: With dead ends: 3454
[2020-10-16 11:09:31,317 INFO  L226             Difference]: Without dead ends: 2194
[2020-10-16 11:09:31,318 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:31,329 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2194 states.
[2020-10-16 11:09:31,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2122.
[2020-10-16 11:09:31,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2122 states.
[2020-10-16 11:09:31,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 7640 transitions.
[2020-10-16 11:09:31,380 INFO  L78                 Accepts]: Start accepts. Automaton has 2122 states and 7640 transitions. Word has length 17
[2020-10-16 11:09:31,380 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:31,380 INFO  L481      AbstractCegarLoop]: Abstraction has 2122 states and 7640 transitions.
[2020-10-16 11:09:31,380 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:31,380 INFO  L276                IsEmpty]: Start isEmpty. Operand 2122 states and 7640 transitions.
[2020-10-16 11:09:31,384 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:09:31,384 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:31,385 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:31,385 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 11:09:31,385 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:31,385 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:31,385 INFO  L82        PathProgramCache]: Analyzing trace with hash 965208446, now seen corresponding path program 2 times
[2020-10-16 11:09:31,386 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:31,386 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448655535]
[2020-10-16 11:09:31,386 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:31,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:31,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:31,491 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448655535]
[2020-10-16 11:09:31,491 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:31,492 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:31,492 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266814176]
[2020-10-16 11:09:31,492 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:31,492 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:31,492 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:31,493 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:31,493 INFO  L87              Difference]: Start difference. First operand 2122 states and 7640 transitions. Second operand 4 states.
[2020-10-16 11:09:31,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:31,543 INFO  L93              Difference]: Finished difference Result 2184 states and 7166 transitions.
[2020-10-16 11:09:31,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:31,544 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-16 11:09:31,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:31,549 INFO  L225             Difference]: With dead ends: 2184
[2020-10-16 11:09:31,549 INFO  L226             Difference]: Without dead ends: 1624
[2020-10-16 11:09:31,550 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-16 11:09:31,558 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1624 states.
[2020-10-16 11:09:31,684 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624.
[2020-10-16 11:09:31,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1624 states.
[2020-10-16 11:09:31,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 5270 transitions.
[2020-10-16 11:09:31,691 INFO  L78                 Accepts]: Start accepts. Automaton has 1624 states and 5270 transitions. Word has length 17
[2020-10-16 11:09:31,691 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:31,691 INFO  L481      AbstractCegarLoop]: Abstraction has 1624 states and 5270 transitions.
[2020-10-16 11:09:31,691 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:31,691 INFO  L276                IsEmpty]: Start isEmpty. Operand 1624 states and 5270 transitions.
[2020-10-16 11:09:31,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 11:09:31,694 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:31,695 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:31,695 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-16 11:09:31,695 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:31,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:31,695 INFO  L82        PathProgramCache]: Analyzing trace with hash -1280116134, now seen corresponding path program 1 times
[2020-10-16 11:09:31,696 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:31,696 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438584923]
[2020-10-16 11:09:31,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:31,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:31,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:31,775 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438584923]
[2020-10-16 11:09:31,776 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:31,776 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:09:31,778 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573532664]
[2020-10-16 11:09:31,778 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:09:31,779 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:31,779 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:09:31,779 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:09:31,779 INFO  L87              Difference]: Start difference. First operand 1624 states and 5270 transitions. Second operand 5 states.
[2020-10-16 11:09:31,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:31,845 INFO  L93              Difference]: Finished difference Result 1415 states and 4245 transitions.
[2020-10-16 11:09:31,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:09:31,845 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-16 11:09:31,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:31,848 INFO  L225             Difference]: With dead ends: 1415
[2020-10-16 11:09:31,848 INFO  L226             Difference]: Without dead ends: 1083
[2020-10-16 11:09:31,848 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-16 11:09:31,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1083 states.
[2020-10-16 11:09:31,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083.
[2020-10-16 11:09:31,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1083 states.
[2020-10-16 11:09:31,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3200 transitions.
[2020-10-16 11:09:31,871 INFO  L78                 Accepts]: Start accepts. Automaton has 1083 states and 3200 transitions. Word has length 18
[2020-10-16 11:09:31,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:31,872 INFO  L481      AbstractCegarLoop]: Abstraction has 1083 states and 3200 transitions.
[2020-10-16 11:09:31,872 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:09:31,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 1083 states and 3200 transitions.
[2020-10-16 11:09:31,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 11:09:31,874 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:31,875 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-16 11:09:31,875 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-16 11:09:31,875 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:31,875 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:31,875 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602746911, now seen corresponding path program 1 times
[2020-10-16 11:09:31,876 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:31,876 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779575256]
[2020-10-16 11:09:31,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:31,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:31,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:31,916 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779575256]
[2020-10-16 11:09:31,916 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:31,916 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:09:31,916 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151884583]
[2020-10-16 11:09:31,916 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:09:31,917 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:31,917 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:09:31,917 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:09:31,917 INFO  L87              Difference]: Start difference. First operand 1083 states and 3200 transitions. Second operand 3 states.
[2020-10-16 11:09:31,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:31,933 INFO  L93              Difference]: Finished difference Result 1551 states and 4445 transitions.
[2020-10-16 11:09:31,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:09:31,934 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-16 11:09:31,934 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:31,937 INFO  L225             Difference]: With dead ends: 1551
[2020-10-16 11:09:31,937 INFO  L226             Difference]: Without dead ends: 1097
[2020-10-16 11:09:31,938 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-16 11:09:31,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1097 states.
[2020-10-16 11:09:31,957 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1077.
[2020-10-16 11:09:31,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1077 states.
[2020-10-16 11:09:31,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 2999 transitions.
[2020-10-16 11:09:31,960 INFO  L78                 Accepts]: Start accepts. Automaton has 1077 states and 2999 transitions. Word has length 20
[2020-10-16 11:09:31,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:31,960 INFO  L481      AbstractCegarLoop]: Abstraction has 1077 states and 2999 transitions.
[2020-10-16 11:09:31,960 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:09:31,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 1077 states and 2999 transitions.
[2020-10-16 11:09:31,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-16 11:09:31,963 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:31,963 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, 1]
[2020-10-16 11:09:31,963 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-16 11:09:31,964 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:31,964 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:31,964 INFO  L82        PathProgramCache]: Analyzing trace with hash 664753657, now seen corresponding path program 1 times
[2020-10-16 11:09:31,964 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:31,964 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629514149]
[2020-10-16 11:09:31,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:31,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:32,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:32,026 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629514149]
[2020-10-16 11:09:32,027 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:32,027 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:32,027 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50463273]
[2020-10-16 11:09:32,027 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 11:09:32,028 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:32,028 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 11:09:32,028 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:09:32,028 INFO  L87              Difference]: Start difference. First operand 1077 states and 2999 transitions. Second operand 6 states.
[2020-10-16 11:09:32,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:32,095 INFO  L93              Difference]: Finished difference Result 958 states and 2630 transitions.
[2020-10-16 11:09:32,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 11:09:32,097 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-16 11:09:32,097 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:32,099 INFO  L225             Difference]: With dead ends: 958
[2020-10-16 11:09:32,099 INFO  L226             Difference]: Without dead ends: 791
[2020-10-16 11:09:32,099 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-16 11:09:32,102 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 791 states.
[2020-10-16 11:09:32,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791.
[2020-10-16 11:09:32,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 791 states.
[2020-10-16 11:09:32,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2195 transitions.
[2020-10-16 11:09:32,115 INFO  L78                 Accepts]: Start accepts. Automaton has 791 states and 2195 transitions. Word has length 21
[2020-10-16 11:09:32,115 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:32,116 INFO  L481      AbstractCegarLoop]: Abstraction has 791 states and 2195 transitions.
[2020-10-16 11:09:32,116 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 11:09:32,116 INFO  L276                IsEmpty]: Start isEmpty. Operand 791 states and 2195 transitions.
[2020-10-16 11:09:32,118 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:09:32,118 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:32,119 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, 1, 1, 1, 1]
[2020-10-16 11:09:32,119 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-16 11:09:32,119 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:32,119 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:32,119 INFO  L82        PathProgramCache]: Analyzing trace with hash -722983254, now seen corresponding path program 1 times
[2020-10-16 11:09:32,119 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:32,120 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323096590]
[2020-10-16 11:09:32,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:32,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:32,173 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:32,173 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323096590]
[2020-10-16 11:09:32,174 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:32,174 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:09:32,174 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089147202]
[2020-10-16 11:09:32,174 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:09:32,175 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:32,175 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:09:32,175 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:09:32,175 INFO  L87              Difference]: Start difference. First operand 791 states and 2195 transitions. Second operand 4 states.
[2020-10-16 11:09:32,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:32,205 INFO  L93              Difference]: Finished difference Result 997 states and 2670 transitions.
[2020-10-16 11:09:32,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:09:32,206 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 24
[2020-10-16 11:09:32,207 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:32,208 INFO  L225             Difference]: With dead ends: 997
[2020-10-16 11:09:32,208 INFO  L226             Difference]: Without dead ends: 658
[2020-10-16 11:09:32,209 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-16 11:09:32,211 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 658 states.
[2020-10-16 11:09:32,219 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655.
[2020-10-16 11:09:32,219 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 655 states.
[2020-10-16 11:09:32,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1680 transitions.
[2020-10-16 11:09:32,221 INFO  L78                 Accepts]: Start accepts. Automaton has 655 states and 1680 transitions. Word has length 24
[2020-10-16 11:09:32,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:32,222 INFO  L481      AbstractCegarLoop]: Abstraction has 655 states and 1680 transitions.
[2020-10-16 11:09:32,222 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:09:32,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 655 states and 1680 transitions.
[2020-10-16 11:09:32,226 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-16 11:09:32,226 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:32,226 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, 1, 1, 1, 1]
[2020-10-16 11:09:32,226 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-16 11:09:32,227 INFO  L429      AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:32,227 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:32,227 INFO  L82        PathProgramCache]: Analyzing trace with hash -235696114, now seen corresponding path program 1 times
[2020-10-16 11:09:32,227 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:32,228 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910636257]
[2020-10-16 11:09:32,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:32,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:32,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:32,332 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910636257]
[2020-10-16 11:09:32,333 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:32,333 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 11:09:32,333 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392440417]
[2020-10-16 11:09:32,333 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:32,333 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:32,334 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:32,334 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:32,334 INFO  L87              Difference]: Start difference. First operand 655 states and 1680 transitions. Second operand 7 states.
[2020-10-16 11:09:32,414 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:32,414 INFO  L93              Difference]: Finished difference Result 629 states and 1629 transitions.
[2020-10-16 11:09:32,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-16 11:09:32,415 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-16 11:09:32,415 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:32,416 INFO  L225             Difference]: With dead ends: 629
[2020-10-16 11:09:32,416 INFO  L226             Difference]: Without dead ends: 138
[2020-10-16 11:09:32,417 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:09:32,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-16 11:09:32,420 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2020-10-16 11:09:32,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 138 states.
[2020-10-16 11:09:32,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 323 transitions.
[2020-10-16 11:09:32,421 INFO  L78                 Accepts]: Start accepts. Automaton has 138 states and 323 transitions. Word has length 24
[2020-10-16 11:09:32,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:32,421 INFO  L481      AbstractCegarLoop]: Abstraction has 138 states and 323 transitions.
[2020-10-16 11:09:32,421 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:32,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 138 states and 323 transitions.
[2020-10-16 11:09:32,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 11:09:32,422 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:32,422 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, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:32,422 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-16 11:09:32,423 INFO  L429      AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:32,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:32,423 INFO  L82        PathProgramCache]: Analyzing trace with hash 1076556023, now seen corresponding path program 1 times
[2020-10-16 11:09:32,423 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:32,423 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390053061]
[2020-10-16 11:09:32,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:32,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:09:32,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:09:32,557 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390053061]
[2020-10-16 11:09:32,558 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:09:32,558 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:09:32,558 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342876548]
[2020-10-16 11:09:32,558 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:09:32,558 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:09:32,559 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:09:32,559 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:09:32,559 INFO  L87              Difference]: Start difference. First operand 138 states and 323 transitions. Second operand 7 states.
[2020-10-16 11:09:32,650 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:09:32,651 INFO  L93              Difference]: Finished difference Result 188 states and 441 transitions.
[2020-10-16 11:09:32,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:09:32,652 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 27
[2020-10-16 11:09:32,652 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:09:32,653 INFO  L225             Difference]: With dead ends: 188
[2020-10-16 11:09:32,653 INFO  L226             Difference]: Without dead ends: 138
[2020-10-16 11:09:32,653 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-16 11:09:32,654 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2020-10-16 11:09:32,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114.
[2020-10-16 11:09:32,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2020-10-16 11:09:32,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 243 transitions.
[2020-10-16 11:09:32,657 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 243 transitions. Word has length 27
[2020-10-16 11:09:32,657 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:09:32,657 INFO  L481      AbstractCegarLoop]: Abstraction has 114 states and 243 transitions.
[2020-10-16 11:09:32,657 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:09:32,657 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 243 transitions.
[2020-10-16 11:09:32,658 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-16 11:09:32,658 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:09:32,658 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, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:09:32,658 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-16 11:09:32,659 INFO  L429      AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:09:32,659 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:09:32,659 INFO  L82        PathProgramCache]: Analyzing trace with hash 1976359869, now seen corresponding path program 2 times
[2020-10-16 11:09:32,659 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:09:32,659 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346067145]
[2020-10-16 11:09:32,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:09:32,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:09:32,705 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:09:32,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:09:32,747 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:09:32,788 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:09:32,789 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:09:32,789 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-16 11:09:32,790 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:09:32,808 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-165349774 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-165349774 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-165349774 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-165349774 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_Out-165349774 ~y$r_buff1_thd0~0_In-165349774) (= ~y$r_buff0_thd0~0_In-165349774 ~y$r_buff0_thd0~0_Out-165349774) (or (and .cse0 (= ~y$w_buff1_used~0_Out-165349774 ~y$w_buff1_used~0_In-165349774)) (and .cse1 (= ~y$w_buff1_used~0_Out-165349774 0) .cse2)) (or (and (or (and .cse1 (= ~y~0_Out-165349774 ~y$w_buff1~0_In-165349774) .cse2) (and .cse0 (= ~y~0_Out-165349774 ~y~0_In-165349774))) .cse3) (and (= ~y~0_Out-165349774 ~y$w_buff0~0_In-165349774) .cse4 .cse5)) (or (and (= ~y$w_buff0_used~0_Out-165349774 ~y$w_buff0_used~0_In-165349774) .cse3) (and (= ~y$w_buff0_used~0_Out-165349774 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-165349774 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-165349774 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-165349774|))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-165349774|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-165349774, ~y$w_buff1~0=~y$w_buff1~0_In-165349774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-165349774, ~y$w_buff0~0=~y$w_buff0~0_In-165349774, ~y~0=~y~0_In-165349774, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-165349774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-165349774}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-165349774, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-165349774|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-165349774|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-165349774|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-165349774|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-165349774|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-165349774|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-165349774|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-165349774, ~y$w_buff1~0=~y$w_buff1~0_In-165349774, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-165349774, ~y$w_buff0~0=~y$w_buff0~0_In-165349774, ~y~0=~y~0_Out-165349774, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-165349774, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-165349774}  AuxVars[]  AssignedVars[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~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge
[2020-10-16 11:09:32,815 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,815 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,817 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,817 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,817 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,818 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,818 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,818 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,818 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,818 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,818 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,819 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,823 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,823 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,824 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,825 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,825 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,825 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,825 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,826 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,826 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,826 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,826 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,826 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,826 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,827 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,827 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,827 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,827 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,828 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:09:32,828 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:09:32,907 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:09:32 BasicIcfg
[2020-10-16 11:09:32,907 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:09:32,911 INFO  L168              Benchmark]: Toolchain (without parser) took 22061.51 ms. Allocated memory was 141.6 MB in the beginning and 525.3 MB in the end (delta: 383.8 MB). Free memory was 101.3 MB in the beginning and 154.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 330.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,912 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 121.8 MB in the beginning and 121.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,913 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 778.75 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,913 INFO  L168              Benchmark]: Boogie Procedure Inliner took 72.46 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,914 INFO  L168              Benchmark]: Boogie Preprocessor took 60.39 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 151.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,916 INFO  L168              Benchmark]: RCFGBuilder took 2259.14 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 151.2 MB in the beginning and 154.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,917 INFO  L168              Benchmark]: TraceAbstraction took 18882.75 ms. Allocated memory was 245.4 MB in the beginning and 525.3 MB in the end (delta: 280.0 MB). Free memory was 152.3 MB in the beginning and 154.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 278.1 MB. Max. memory is 7.1 GB.
[2020-10-16 11:09:32,924 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 121.8 MB in the beginning and 121.4 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 778.75 ms. Allocated memory was 141.6 MB in the beginning and 203.9 MB in the end (delta: 62.4 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.5 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 72.46 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 60.39 ms. Allocated memory is still 203.9 MB. Free memory was 153.0 MB in the beginning and 151.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2259.14 ms. Allocated memory was 203.9 MB in the beginning and 245.4 MB in the end (delta: 41.4 MB). Free memory was 151.2 MB in the beginning and 154.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 18882.75 ms. Allocated memory was 245.4 MB in the beginning and 525.3 MB in the end (delta: 280.0 MB). Free memory was 152.3 MB in the beginning and 154.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 278.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1771 VarBasedMoverChecksPositive, 103 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 222 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.5s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 7948 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p2_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L714]               0  _Bool y$flush_delayed;
[L715]               0  int y$mem_tmp;
[L716]               0  _Bool y$r_buff0_thd0;
[L717]               0  _Bool y$r_buff0_thd1;
[L718]               0  _Bool y$r_buff0_thd2;
[L719]               0  _Bool y$r_buff0_thd3;
[L720]               0  _Bool y$r_buff0_thd4;
[L721]               0  _Bool y$r_buff1_thd0;
[L722]               0  _Bool y$r_buff1_thd1;
[L723]               0  _Bool y$r_buff1_thd2;
[L724]               0  _Bool y$r_buff1_thd3;
[L725]               0  _Bool y$r_buff1_thd4;
[L726]               0  _Bool y$read_delayed;
[L727]               0  int *y$read_delayed_var;
[L728]               0  int y$w_buff0;
[L729]               0  _Bool y$w_buff0_used;
[L730]               0  int y$w_buff1;
[L731]               0  _Bool y$w_buff1_used;
[L733]               0  int z = 0;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t577;
[L836]  FCALL, FORK  0  pthread_create(&t577, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L837]               0  pthread_t t578;
[L838]  FCALL, FORK  0  pthread_create(&t578, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L839]               0  pthread_t t579;
[L840]  FCALL, FORK  0  pthread_create(&t579, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               0  pthread_t t580;
[L774]               3  y$w_buff1 = y$w_buff0
[L775]               3  y$w_buff0 = 2
[L776]               3  y$w_buff1_used = y$w_buff0_used
[L777]               3  y$w_buff0_used = (_Bool)1
[L7]    COND TRUE    3  !expression
[L7]                 3  __VERIFIER_error()
[L779]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L780]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L781]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L782]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L783]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L784]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]  FCALL, FORK  0  pthread_create(&t580, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L787]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L804]               4  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L807]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L810]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L739]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L813]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L813]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L814]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L814]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L815]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L815]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L816]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L816]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L817]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L817]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L742]               1  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L754]               2  x = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L760]  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)
[L760]               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)
[L761]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L761]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L762]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L762]               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
[L763]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L763]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L764]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L764]               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
[L767]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L769]               2  return 0;
[L790]  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)
[L790]               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)
[L791]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L791]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L792]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L792]               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
[L793]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L793]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L794]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L794]               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
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  y$flush_delayed = weak$$choice2
[L858]               0  y$mem_tmp = y
[L859]  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)
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1
[L859]  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)
[L859]               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)
[L860]  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))
[L860]               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))
[L861]  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))
[L861]               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))
[L862]  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))
[L862]               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))
[L863]  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))
[L863]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L863]  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))
[L863]               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))
[L864]  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))
[L864]               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))
[L865]  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))
[L865]  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)
[L865]  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))
[L865]               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))
[L866]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L867]               0  y = y$flush_delayed ? y$mem_tmp : y
[L868]               0  y$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.8s, HoareTripleCheckerStatistics: 695 SDtfs, 767 SDslu, 1116 SDs, 0 SdLazy, 503 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 46028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...