/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-c7e336b
[2020-10-05 22:39:39,426 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-05 22:39:39,428 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-05 22:39:39,454 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-05 22:39:39,455 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-05 22:39:39,456 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-05 22:39:39,457 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-05 22:39:39,459 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-05 22:39:39,461 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-05 22:39:39,462 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-05 22:39:39,462 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-05 22:39:39,464 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-05 22:39:39,464 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-05 22:39:39,465 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-05 22:39:39,466 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-05 22:39:39,467 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-05 22:39:39,468 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-05 22:39:39,469 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-05 22:39:39,470 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-05 22:39:39,472 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-05 22:39:39,474 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-05 22:39:39,475 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-05 22:39:39,476 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-05 22:39:39,477 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-05 22:39:39,480 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-05 22:39:39,480 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-05 22:39:39,480 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-05 22:39:39,481 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-05 22:39:39,482 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-05 22:39:39,483 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-05 22:39:39,483 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-05 22:39:39,484 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-05 22:39:39,484 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-05 22:39:39,485 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-05 22:39:39,486 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-05 22:39:39,486 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-05 22:39:39,487 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-05 22:39:39,487 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-05 22:39:39,487 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-05 22:39:39,488 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-05 22:39:39,489 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-05 22:39:39,490 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-05 22:39:39,531 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-05 22:39:39,531 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-05 22:39:39,532 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-05 22:39:39,532 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-05 22:39:39,533 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-05 22:39:39,533 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-05 22:39:39,536 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-05 22:39:39,536 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-05 22:39:39,537 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-05 22:39:39,537 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-05 22:39:39,537 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-05 22:39:39,537 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-05 22:39:39,537 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-05 22:39:39,538 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-05 22:39:39,538 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-05 22:39:39,540 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-05 22:39:39,540 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-05 22:39:39,541 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-05 22:39:39,541 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-05 22:39:39,541 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-05 22:39:39,541 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-05 22:39:39,541 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-05 22:39:39,542 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-05 22:39:39,542 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-05 22:39:39,542 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-05 22:39:39,542 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-05 22:39:39,542 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-05 22:39:39,543 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-05 22:39:39,543 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-05 22:39:39,545 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-05 22:39:39,888 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-05 22:39:39,900 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-05 22:39:39,904 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-05 22:39:39,906 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-05 22:39:39,906 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-05 22:39:39,907 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-05 22:39:39,972 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe38889f/0d5ca5229ea84855bdc0426893733574/FLAG8b9bd303a
[2020-10-05 22:39:40,564 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-05 22:39:40,565 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i
[2020-10-05 22:39:40,589 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe38889f/0d5ca5229ea84855bdc0426893733574/FLAG8b9bd303a
[2020-10-05 22:39:40,796 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fe38889f/0d5ca5229ea84855bdc0426893733574
[2020-10-05 22:39:40,806 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-05 22:39:40,808 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-05 22:39:40,809 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-05 22:39:40,809 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-05 22:39:40,813 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-05 22:39:40,814 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:39:40" (1/1) ...
[2020-10-05 22:39:40,817 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600eb3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:40, skipping insertion in model container
[2020-10-05 22:39:40,818 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:39:40" (1/1) ...
[2020-10-05 22:39:40,826 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-05 22:39:40,874 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-05 22:39:41,473 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-05 22:39:41,486 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-05 22:39:41,549 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-05 22:39:41,628 INFO  L208         MainTranslator]: Completed translation
[2020-10-05 22:39:41,628 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41 WrapperNode
[2020-10-05 22:39:41,628 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-05 22:39:41,629 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-05 22:39:41,629 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-05 22:39:41,630 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-05 22:39:41,639 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,661 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,707 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-05 22:39:41,708 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-05 22:39:41,708 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-05 22:39:41,708 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-05 22:39:41,719 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,719 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,726 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,726 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,738 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,742 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,746 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
[2020-10-05 22:39:41,752 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-05 22:39:41,752 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-05 22:39:41,753 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-05 22:39:41,753 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-05 22:39:41,754 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-05 22:39:41,818 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-05 22:39:41,818 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-05 22:39:41,818 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-05 22:39:41,819 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-05 22:39:41,819 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-05 22:39:41,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-05 22:39:41,819 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-05 22:39:41,819 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-05 22:39:41,819 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-05 22:39:41,820 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-05 22:39:41,820 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-05 22:39:41,820 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-05 22:39:41,820 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-05 22:39:41,820 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-05 22:39:41,821 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-05 22:39:41,823 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-05 22:39:43,934 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-05 22:39:43,935 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-05 22:39:43,938 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:39:43 BoogieIcfgContainer
[2020-10-05 22:39:43,938 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-05 22:39:43,940 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-05 22:39:43,940 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-05 22:39:43,944 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-05 22:39:43,945 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:39:40" (1/3) ...
[2020-10-05 22:39:43,946 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c9e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:39:43, skipping insertion in model container
[2020-10-05 22:39:43,946 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:39:41" (2/3) ...
[2020-10-05 22:39:43,946 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c9e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:39:43, skipping insertion in model container
[2020-10-05 22:39:43,946 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:39:43" (3/3) ...
[2020-10-05 22:39:43,948 INFO  L109   eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i
[2020-10-05 22:39:43,961 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-05 22:39:43,962 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-05 22:39:43,971 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-05 22:39:43,973 INFO  L340   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-05 22:39:44,009 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,009 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,010 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,010 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,010 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,011 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,011 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,012 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,012 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,012 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,012 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,012 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,013 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,013 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,013 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,013 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,013 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,014 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,014 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,015 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,015 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,015 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,015 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,016 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,016 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,016 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,016 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,017 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,017 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,017 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,017 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,017 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,018 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,018 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,019 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,019 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,019 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,019 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,020 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,020 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,020 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,020 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,021 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,021 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,021 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,021 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,021 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,022 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,022 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,027 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,027 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,027 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,028 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,028 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,028 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,028 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,029 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,029 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,029 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,033 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,034 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,034 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,034 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,036 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,036 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,037 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,037 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,037 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,037 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,037 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,038 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,038 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,038 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,040 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,040 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,041 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,041 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,041 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,041 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,042 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,042 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,042 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,042 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,043 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,043 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-05 22:39:44,060 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-05 22:39:44,086 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-10-05 22:39:44,087 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-10-05 22:39:44,087 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-05 22:39:44,087 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-05 22:39:44,087 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-05 22:39:44,087 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-10-05 22:39:44,087 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-05 22:39:44,088 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-05 22:39:44,107 INFO  L152   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-05 22:39:44,109 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-05 22:39:44,166 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-05 22:39:44,166 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-05 22:39:44,173 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-05 22:39:44,177 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-05 22:39:44,204 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-05 22:39:44,205 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-05 22:39:44,205 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-05 22:39:44,209 INFO  L158   etLargeBlockEncoding]: Number of co-enabled transitions 2572
[2020-10-05 22:39:44,210 INFO  L170   etLargeBlockEncoding]: Semantic Check.
[2020-10-05 22:39:44,376 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:44,377 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,380 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:44,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:44,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:44,408 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,488 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:44,489 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:44,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,508 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,510 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,511 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,523 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,523 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,527 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:44,527 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,531 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-05 22:39:44,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,534 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-05 22:39:44,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,641 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:44,642 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,643 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:44,643 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:44,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:39:44,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:44,653 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,799 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:44,800 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,801 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:44,801 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,805 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:44,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:39:44,808 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:44,809 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:44,849 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:44,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,868 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,876 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,876 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:44,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:44,880 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:44,881 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,883 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-05 22:39:44,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,886 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-05 22:39:44,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,962 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:44,963 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,964 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:44,964 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:44,967 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:44,967 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:39:44,971 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:44,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,019 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:45,019 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:45,022 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:45,022 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,023 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:45,023 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:45,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:45,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:45,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:45,031 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:45,032 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:45,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:45,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,037 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-05 22:39:45,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,039 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-05 22:39:45,039 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,142 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,198 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,237 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,238 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,239 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,239 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,257 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,257 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,258 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,289 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,289 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,311 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,312 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,336 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,337 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,337 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,338 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,365 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,366 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,788 WARN  L193               SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-05 22:39:45,905 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,905 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,906 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,920 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,920 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,921 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,949 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:45,950 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-05 22:39:45,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:45,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:45,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:45,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:45,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,051 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:46,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,053 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:46,053 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:46,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,072 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:46,072 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,106 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:46,107 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:46,129 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:46,130 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:46,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:46,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:46,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:46,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:46,141 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:46,142 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:46,146 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:46,146 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,150 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-05 22:39:46,151 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,153 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-05 22:39:46,153 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,215 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:46,215 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,217 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:46,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,220 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:46,220 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:39:46,224 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:46,225 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,301 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:46,302 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,303 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:46,303 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,329 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:46,330 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:46,331 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:46,331 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:47,520 WARN  L193               SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 230 DAG size of output: 190
[2020-10-05 22:39:47,539 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term
[2020-10-05 22:39:47,539 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:47,540 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:47,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,838 WARN  L193               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 148 DAG size of output: 128
[2020-10-05 22:39:48,859 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:48,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:48,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:48,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:48,885 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-05 22:39:48,885 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:48,909 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:48,910 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:48,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:48,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:48,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:48,937 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:48,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:48,940 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:48,941 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:48,941 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:48,943 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:48,943 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,945 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-05 22:39:48,945 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,947 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-05 22:39:48,948 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-05 22:39:48,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,993 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-05 22:39:48,993 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:48,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:48,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-05 22:39:48,998 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-05 22:39:48,999 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,395 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,396 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:49,396 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,401 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,404 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,406 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,407 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,410 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,413 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-05 22:39:49,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,416 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-05 22:39:49,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,446 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,446 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:49,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,609 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,610 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:49,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,672 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,673 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:49,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,676 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:49,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,685 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:49,686 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,696 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,697 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,699 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-05 22:39:49,700 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,702 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-05 22:39:49,702 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:49,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:49,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:49,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,004 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,005 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,006 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:50,007 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,008 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,008 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,010 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,010 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,013 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,014 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,016 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,017 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,019 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,019 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,021 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-05 22:39:50,022 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,023 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-05 22:39:50,024 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,145 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,146 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,148 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:50,148 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,149 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,150 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,152 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,152 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,158 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,163 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-05 22:39:50,163 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,165 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-05 22:39:50,165 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,200 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:50,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,203 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,391 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,392 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:50,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,395 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,395 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,396 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,398 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,400 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,402 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-05 22:39:50,403 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,404 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-05 22:39:50,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:50,427 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,590 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-05 22:39:50,907 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,908 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-05 22:39:50,909 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,910 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,932 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-05 22:39:50,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,935 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,935 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:50,937 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,937 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:50,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,940 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-05 22:39:50,941 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,942 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-05 22:39:50,942 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:50,943 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-05 22:39:50,944 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:51,963 WARN  L193               SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112
[2020-10-05 22:39:52,292 WARN  L193               SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 109
[2020-10-05 22:39:52,645 WARN  L193               SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-05 22:39:52,756 WARN  L193               SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-05 22:39:54,043 WARN  L193               SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 147 DAG size of output: 137
[2020-10-05 22:39:54,614 WARN  L193               SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-05 22:39:54,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-05 22:39:54,629 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-05 22:39:54,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,774 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,775 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,775 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,776 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:54,780 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:54,793 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,793 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,795 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,796 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:39:54,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,798 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:39:54,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-05 22:39:54,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,865 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:39:54,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-05 22:39:54,882 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,883 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,883 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,884 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:54,886 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-05 22:39:54,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:54,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-05 22:39:54,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-05 22:39:54,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-05 22:39:54,914 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-05 22:39:55,222 WARN  L193               SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-05 22:39:55,359 WARN  L193               SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-05 22:39:55,411 INFO  L206   etLargeBlockEncoding]: Checked pairs total: 7560
[2020-10-05 22:39:55,412 INFO  L214   etLargeBlockEncoding]: Total number of compositions: 90
[2020-10-05 22:39:55,415 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-05 22:39:55,660 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states.
[2020-10-05 22:39:55,662 INFO  L276                IsEmpty]: Start isEmpty. Operand 3890 states.
[2020-10-05 22:39:55,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-05 22:39:55,672 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:55,673 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:55,674 INFO  L427      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-05 22:39:55,680 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:55,680 INFO  L82        PathProgramCache]: Analyzing trace with hash 51217073, now seen corresponding path program 1 times
[2020-10-05 22:39:55,692 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:55,693 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273824379]
[2020-10-05 22:39:55,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:55,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:56,029 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-05 22:39:56,030 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273824379]
[2020-10-05 22:39:56,031 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:56,031 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:39:56,032 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6758637]
[2020-10-05 22:39:56,037 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:39:56,037 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:56,052 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:39:56,053 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:39:56,055 INFO  L87              Difference]: Start difference. First operand 3890 states. Second operand 3 states.
[2020-10-05 22:39:56,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:56,216 INFO  L93              Difference]: Finished difference Result 3250 states and 12738 transitions.
[2020-10-05 22:39:56,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:39:56,218 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-05 22:39:56,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:56,267 INFO  L225             Difference]: With dead ends: 3250
[2020-10-05 22:39:56,267 INFO  L226             Difference]: Without dead ends: 2650
[2020-10-05 22:39:56,268 INFO  L675         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-05 22:39:56,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2650 states.
[2020-10-05 22:39:56,453 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650.
[2020-10-05 22:39:56,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2650 states.
[2020-10-05 22:39:56,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions.
[2020-10-05 22:39:56,477 INFO  L78                 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7
[2020-10-05 22:39:56,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:56,478 INFO  L479      AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions.
[2020-10-05 22:39:56,478 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:39:56,478 INFO  L276                IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions.
[2020-10-05 22:39:56,484 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-05 22:39:56,484 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:56,485 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:56,485 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-05 22:39:56,486 INFO  L427      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-05 22:39:56,486 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:56,487 INFO  L82        PathProgramCache]: Analyzing trace with hash -386244636, now seen corresponding path program 1 times
[2020-10-05 22:39:56,488 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:56,489 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160735883]
[2020-10-05 22:39:56,490 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:56,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:56,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-05 22:39:56,594 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160735883]
[2020-10-05 22:39:56,594 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:56,594 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:39:56,595 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526485125]
[2020-10-05 22:39:56,596 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:39:56,597 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:56,597 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:39:56,597 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:39:56,597 INFO  L87              Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states.
[2020-10-05 22:39:56,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:56,666 INFO  L93              Difference]: Finished difference Result 2638 states and 10170 transitions.
[2020-10-05 22:39:56,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:39:56,667 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-05 22:39:56,668 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:56,692 INFO  L225             Difference]: With dead ends: 2638
[2020-10-05 22:39:56,693 INFO  L226             Difference]: Without dead ends: 2638
[2020-10-05 22:39:56,694 INFO  L675         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-05 22:39:56,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2638 states.
[2020-10-05 22:39:56,795 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638.
[2020-10-05 22:39:56,796 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2638 states.
[2020-10-05 22:39:56,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 10170 transitions.
[2020-10-05 22:39:56,812 INFO  L78                 Accepts]: Start accepts. Automaton has 2638 states and 10170 transitions. Word has length 11
[2020-10-05 22:39:56,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:56,813 INFO  L479      AbstractCegarLoop]: Abstraction has 2638 states and 10170 transitions.
[2020-10-05 22:39:56,813 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:39:56,813 INFO  L276                IsEmpty]: Start isEmpty. Operand 2638 states and 10170 transitions.
[2020-10-05 22:39:56,816 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-05 22:39:56,816 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:56,816 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:56,817 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-05 22:39:56,817 INFO  L427      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-05 22:39:56,817 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:56,817 INFO  L82        PathProgramCache]: Analyzing trace with hash -1325904802, now seen corresponding path program 1 times
[2020-10-05 22:39:56,818 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:56,818 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729756451]
[2020-10-05 22:39:56,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:56,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:56,887 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-05 22:39:56,888 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729756451]
[2020-10-05 22:39:56,888 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:56,888 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:39:56,888 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612787559]
[2020-10-05 22:39:56,889 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:39:56,889 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:56,889 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:39:56,889 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:39:56,890 INFO  L87              Difference]: Start difference. First operand 2638 states and 10170 transitions. Second operand 3 states.
[2020-10-05 22:39:56,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:56,931 INFO  L93              Difference]: Finished difference Result 2442 states and 9320 transitions.
[2020-10-05 22:39:56,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:39:56,932 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-05 22:39:56,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:56,955 INFO  L225             Difference]: With dead ends: 2442
[2020-10-05 22:39:56,955 INFO  L226             Difference]: Without dead ends: 2442
[2020-10-05 22:39:56,956 INFO  L675         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-05 22:39:56,969 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2442 states.
[2020-10-05 22:39:57,034 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442.
[2020-10-05 22:39:57,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2442 states.
[2020-10-05 22:39:57,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions.
[2020-10-05 22:39:57,049 INFO  L78                 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 12
[2020-10-05 22:39:57,049 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:57,049 INFO  L479      AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions.
[2020-10-05 22:39:57,049 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:39:57,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions.
[2020-10-05 22:39:57,053 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-05 22:39:57,053 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:57,053 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:57,053 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-05 22:39:57,054 INFO  L427      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-05 22:39:57,054 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:57,054 INFO  L82        PathProgramCache]: Analyzing trace with hash 1389686444, now seen corresponding path program 1 times
[2020-10-05 22:39:57,054 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:57,055 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097806694]
[2020-10-05 22:39:57,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:57,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:57,182 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-05 22:39:57,183 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097806694]
[2020-10-05 22:39:57,183 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:57,183 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-05 22:39:57,184 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884831044]
[2020-10-05 22:39:57,184 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-05 22:39:57,184 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:57,185 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-05 22:39:57,185 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-05 22:39:57,185 INFO  L87              Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states.
[2020-10-05 22:39:57,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:57,262 INFO  L93              Difference]: Finished difference Result 2430 states and 9264 transitions.
[2020-10-05 22:39:57,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:39:57,264 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-05 22:39:57,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:57,288 INFO  L225             Difference]: With dead ends: 2430
[2020-10-05 22:39:57,289 INFO  L226             Difference]: Without dead ends: 2430
[2020-10-05 22:39:57,289 INFO  L675         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-05 22:39:57,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2430 states.
[2020-10-05 22:39:57,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430.
[2020-10-05 22:39:57,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2430 states.
[2020-10-05 22:39:57,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 9264 transitions.
[2020-10-05 22:39:57,384 INFO  L78                 Accepts]: Start accepts. Automaton has 2430 states and 9264 transitions. Word has length 14
[2020-10-05 22:39:57,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:57,384 INFO  L479      AbstractCegarLoop]: Abstraction has 2430 states and 9264 transitions.
[2020-10-05 22:39:57,384 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-05 22:39:57,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 2430 states and 9264 transitions.
[2020-10-05 22:39:57,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-05 22:39:57,388 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:57,388 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:57,388 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-05 22:39:57,389 INFO  L427      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-05 22:39:57,389 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:57,389 INFO  L82        PathProgramCache]: Analyzing trace with hash -843304651, now seen corresponding path program 1 times
[2020-10-05 22:39:57,389 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:57,390 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67999890]
[2020-10-05 22:39:57,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:57,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:57,462 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-05 22:39:57,463 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67999890]
[2020-10-05 22:39:57,463 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:57,463 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-05 22:39:57,464 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825900348]
[2020-10-05 22:39:57,464 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:39:57,464 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:57,465 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:39:57,465 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:39:57,465 INFO  L87              Difference]: Start difference. First operand 2430 states and 9264 transitions. Second operand 3 states.
[2020-10-05 22:39:57,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:57,519 INFO  L93              Difference]: Finished difference Result 2398 states and 9120 transitions.
[2020-10-05 22:39:57,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:39:57,521 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-10-05 22:39:57,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:57,566 INFO  L225             Difference]: With dead ends: 2398
[2020-10-05 22:39:57,566 INFO  L226             Difference]: Without dead ends: 2398
[2020-10-05 22:39:57,567 INFO  L675         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-05 22:39:57,586 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2398 states.
[2020-10-05 22:39:57,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2398.
[2020-10-05 22:39:57,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2398 states.
[2020-10-05 22:39:57,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 9120 transitions.
[2020-10-05 22:39:57,681 INFO  L78                 Accepts]: Start accepts. Automaton has 2398 states and 9120 transitions. Word has length 14
[2020-10-05 22:39:57,682 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:57,682 INFO  L479      AbstractCegarLoop]: Abstraction has 2398 states and 9120 transitions.
[2020-10-05 22:39:57,682 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:39:57,682 INFO  L276                IsEmpty]: Start isEmpty. Operand 2398 states and 9120 transitions.
[2020-10-05 22:39:57,686 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:39:57,686 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:57,686 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:57,687 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-05 22:39:57,687 INFO  L427      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-05 22:39:57,687 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:57,688 INFO  L82        PathProgramCache]: Analyzing trace with hash 1476424878, now seen corresponding path program 1 times
[2020-10-05 22:39:57,688 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:57,688 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750590611]
[2020-10-05 22:39:57,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:57,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:57,797 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-05 22:39:57,798 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750590611]
[2020-10-05 22:39:57,798 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:57,869 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:39:57,869 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923779608]
[2020-10-05 22:39:57,870 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:39:57,870 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:57,870 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:39:57,870 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:39:57,871 INFO  L87              Difference]: Start difference. First operand 2398 states and 9120 transitions. Second operand 5 states.
[2020-10-05 22:39:57,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:57,968 INFO  L93              Difference]: Finished difference Result 2422 states and 9202 transitions.
[2020-10-05 22:39:57,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:39:57,970 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-05 22:39:57,970 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:57,981 INFO  L225             Difference]: With dead ends: 2422
[2020-10-05 22:39:57,981 INFO  L226             Difference]: Without dead ends: 2422
[2020-10-05 22:39:57,981 INFO  L675         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-05 22:39:57,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2422 states.
[2020-10-05 22:39:58,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2414.
[2020-10-05 22:39:58,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2414 states.
[2020-10-05 22:39:58,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 9176 transitions.
[2020-10-05 22:39:58,065 INFO  L78                 Accepts]: Start accepts. Automaton has 2414 states and 9176 transitions. Word has length 15
[2020-10-05 22:39:58,065 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:58,065 INFO  L479      AbstractCegarLoop]: Abstraction has 2414 states and 9176 transitions.
[2020-10-05 22:39:58,065 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:39:58,066 INFO  L276                IsEmpty]: Start isEmpty. Operand 2414 states and 9176 transitions.
[2020-10-05 22:39:58,068 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-05 22:39:58,069 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:58,069 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:58,069 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-05 22:39:58,069 INFO  L427      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-05 22:39:58,070 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:58,070 INFO  L82        PathProgramCache]: Analyzing trace with hash 337525371, now seen corresponding path program 1 times
[2020-10-05 22:39:58,070 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:58,070 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326458178]
[2020-10-05 22:39:58,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:58,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:58,182 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-05 22:39:58,183 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326458178]
[2020-10-05 22:39:58,183 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:58,183 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:39:58,183 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800756247]
[2020-10-05 22:39:58,184 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:39:58,184 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:58,184 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:39:58,184 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:39:58,185 INFO  L87              Difference]: Start difference. First operand 2414 states and 9176 transitions. Second operand 5 states.
[2020-10-05 22:39:58,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:58,302 INFO  L93              Difference]: Finished difference Result 2474 states and 9390 transitions.
[2020-10-05 22:39:58,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:39:58,303 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-05 22:39:58,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:58,314 INFO  L225             Difference]: With dead ends: 2474
[2020-10-05 22:39:58,314 INFO  L226             Difference]: Without dead ends: 2474
[2020-10-05 22:39:58,315 INFO  L675         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-05 22:39:58,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2474 states.
[2020-10-05 22:39:58,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474.
[2020-10-05 22:39:58,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2474 states.
[2020-10-05 22:39:58,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9390 transitions.
[2020-10-05 22:39:58,410 INFO  L78                 Accepts]: Start accepts. Automaton has 2474 states and 9390 transitions. Word has length 15
[2020-10-05 22:39:58,411 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:58,411 INFO  L479      AbstractCegarLoop]: Abstraction has 2474 states and 9390 transitions.
[2020-10-05 22:39:58,411 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:39:58,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 2474 states and 9390 transitions.
[2020-10-05 22:39:58,418 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-05 22:39:58,418 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:58,418 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:58,418 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-05 22:39:58,419 INFO  L427      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-05 22:39:58,419 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:58,419 INFO  L82        PathProgramCache]: Analyzing trace with hash -326164469, now seen corresponding path program 1 times
[2020-10-05 22:39:58,419 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:58,420 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087542840]
[2020-10-05 22:39:58,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:58,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:58,599 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-05 22:39:58,600 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087542840]
[2020-10-05 22:39:58,600 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:58,600 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:39:58,601 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633068291]
[2020-10-05 22:39:58,601 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:39:58,601 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:58,601 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:39:58,602 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:39:58,602 INFO  L87              Difference]: Start difference. First operand 2474 states and 9390 transitions. Second operand 5 states.
[2020-10-05 22:39:58,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:58,676 INFO  L93              Difference]: Finished difference Result 2458 states and 9314 transitions.
[2020-10-05 22:39:58,677 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:39:58,677 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-05 22:39:58,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:58,697 INFO  L225             Difference]: With dead ends: 2458
[2020-10-05 22:39:58,697 INFO  L226             Difference]: Without dead ends: 2458
[2020-10-05 22:39:58,697 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:39:58,710 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2458 states.
[2020-10-05 22:39:58,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2410.
[2020-10-05 22:39:58,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2410 states.
[2020-10-05 22:39:58,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions.
[2020-10-05 22:39:58,794 INFO  L78                 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 16
[2020-10-05 22:39:58,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:58,794 INFO  L479      AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions.
[2020-10-05 22:39:58,794 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:39:58,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions.
[2020-10-05 22:39:58,798 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-05 22:39:58,799 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:58,799 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:58,799 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-05 22:39:58,799 INFO  L427      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-05 22:39:58,800 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:58,800 INFO  L82        PathProgramCache]: Analyzing trace with hash -1268550471, now seen corresponding path program 1 times
[2020-10-05 22:39:58,802 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:58,803 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333598883]
[2020-10-05 22:39:58,803 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:58,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:58,960 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-05 22:39:58,961 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333598883]
[2020-10-05 22:39:58,961 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:58,961 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:39:58,961 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514692294]
[2020-10-05 22:39:58,962 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:39:58,962 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:58,962 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:39:58,962 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:39:58,962 INFO  L87              Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states.
[2020-10-05 22:39:59,059 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:59,059 INFO  L93              Difference]: Finished difference Result 2898 states and 11072 transitions.
[2020-10-05 22:39:59,060 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:39:59,061 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-05 22:39:59,061 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:59,074 INFO  L225             Difference]: With dead ends: 2898
[2020-10-05 22:39:59,074 INFO  L226             Difference]: Without dead ends: 2898
[2020-10-05 22:39:59,075 INFO  L675         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-05 22:39:59,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2898 states.
[2020-10-05 22:39:59,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2610.
[2020-10-05 22:39:59,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2610 states.
[2020-10-05 22:39:59,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions.
[2020-10-05 22:39:59,175 INFO  L78                 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16
[2020-10-05 22:39:59,175 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:59,175 INFO  L479      AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions.
[2020-10-05 22:39:59,175 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:39:59,175 INFO  L276                IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions.
[2020-10-05 22:39:59,181 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-05 22:39:59,181 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:59,182 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:59,182 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-05 22:39:59,182 INFO  L427      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-05 22:39:59,182 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:59,182 INFO  L82        PathProgramCache]: Analyzing trace with hash -1475469297, now seen corresponding path program 2 times
[2020-10-05 22:39:59,182 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:59,183 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550480787]
[2020-10-05 22:39:59,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:59,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:59,264 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-05 22:39:59,265 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550480787]
[2020-10-05 22:39:59,265 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:59,265 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:39:59,265 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717969013]
[2020-10-05 22:39:59,266 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:39:59,266 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:59,266 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:39:59,266 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:39:59,267 INFO  L87              Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states.
[2020-10-05 22:39:59,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:59,415 INFO  L93              Difference]: Finished difference Result 2666 states and 10158 transitions.
[2020-10-05 22:39:59,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:39:59,417 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-05 22:39:59,419 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:59,430 INFO  L225             Difference]: With dead ends: 2666
[2020-10-05 22:39:59,430 INFO  L226             Difference]: Without dead ends: 2666
[2020-10-05 22:39:59,431 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:39:59,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2666 states.
[2020-10-05 22:39:59,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2594.
[2020-10-05 22:39:59,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2594 states.
[2020-10-05 22:39:59,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 9900 transitions.
[2020-10-05 22:39:59,613 INFO  L78                 Accepts]: Start accepts. Automaton has 2594 states and 9900 transitions. Word has length 16
[2020-10-05 22:39:59,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:59,614 INFO  L479      AbstractCegarLoop]: Abstraction has 2594 states and 9900 transitions.
[2020-10-05 22:39:59,614 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:39:59,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 2594 states and 9900 transitions.
[2020-10-05 22:39:59,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-05 22:39:59,619 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:59,619 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:59,619 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-05 22:39:59,619 INFO  L427      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-05 22:39:59,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:59,620 INFO  L82        PathProgramCache]: Analyzing trace with hash -1547901303, now seen corresponding path program 3 times
[2020-10-05 22:39:59,620 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:59,620 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407372169]
[2020-10-05 22:39:59,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:39:59,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:39:59,746 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-05 22:39:59,747 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407372169]
[2020-10-05 22:39:59,747 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:39:59,747 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:39:59,748 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524733633]
[2020-10-05 22:39:59,748 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:39:59,748 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:39:59,748 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:39:59,748 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:39:59,749 INFO  L87              Difference]: Start difference. First operand 2594 states and 9900 transitions. Second operand 5 states.
[2020-10-05 22:39:59,871 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:39:59,872 INFO  L93              Difference]: Finished difference Result 3154 states and 11936 transitions.
[2020-10-05 22:39:59,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-05 22:39:59,873 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 16
[2020-10-05 22:39:59,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:39:59,885 INFO  L225             Difference]: With dead ends: 3154
[2020-10-05 22:39:59,885 INFO  L226             Difference]: Without dead ends: 3154
[2020-10-05 22:39:59,885 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:39:59,900 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3154 states.
[2020-10-05 22:39:59,975 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2922.
[2020-10-05 22:39:59,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2922 states.
[2020-10-05 22:39:59,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11022 transitions.
[2020-10-05 22:39:59,991 INFO  L78                 Accepts]: Start accepts. Automaton has 2922 states and 11022 transitions. Word has length 16
[2020-10-05 22:39:59,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:39:59,992 INFO  L479      AbstractCegarLoop]: Abstraction has 2922 states and 11022 transitions.
[2020-10-05 22:39:59,992 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:39:59,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 2922 states and 11022 transitions.
[2020-10-05 22:39:59,998 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-05 22:39:59,998 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:39:59,998 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:39:59,998 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-05 22:39:59,999 INFO  L427      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-05 22:39:59,999 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:39:59,999 INFO  L82        PathProgramCache]: Analyzing trace with hash 1090858828, now seen corresponding path program 1 times
[2020-10-05 22:39:59,999 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:39:59,999 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959326685]
[2020-10-05 22:40:00,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:00,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:00,130 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-05 22:40:00,131 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959326685]
[2020-10-05 22:40:00,131 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:00,131 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-05 22:40:00,131 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093938975]
[2020-10-05 22:40:00,132 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-05 22:40:00,132 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:00,132 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-05 22:40:00,132 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:40:00,132 INFO  L87              Difference]: Start difference. First operand 2922 states and 11022 transitions. Second operand 7 states.
[2020-10-05 22:40:00,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:00,345 INFO  L93              Difference]: Finished difference Result 3426 states and 12972 transitions.
[2020-10-05 22:40:00,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-05 22:40:00,346 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-05 22:40:00,347 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:00,357 INFO  L225             Difference]: With dead ends: 3426
[2020-10-05 22:40:00,357 INFO  L226             Difference]: Without dead ends: 3426
[2020-10-05 22:40:00,358 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2020-10-05 22:40:00,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3426 states.
[2020-10-05 22:40:00,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3106.
[2020-10-05 22:40:00,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3106 states.
[2020-10-05 22:40:00,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 11788 transitions.
[2020-10-05 22:40:00,458 INFO  L78                 Accepts]: Start accepts. Automaton has 3106 states and 11788 transitions. Word has length 17
[2020-10-05 22:40:00,458 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:00,458 INFO  L479      AbstractCegarLoop]: Abstraction has 3106 states and 11788 transitions.
[2020-10-05 22:40:00,458 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-05 22:40:00,458 INFO  L276                IsEmpty]: Start isEmpty. Operand 3106 states and 11788 transitions.
[2020-10-05 22:40:00,464 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-05 22:40:00,464 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:00,465 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:40:00,465 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-05 22:40:00,465 INFO  L427      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-05 22:40:00,465 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:00,465 INFO  L82        PathProgramCache]: Analyzing trace with hash 1020917628, now seen corresponding path program 2 times
[2020-10-05 22:40:00,465 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:00,466 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954694296]
[2020-10-05 22:40:00,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:00,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:00,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-05 22:40:00,603 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954694296]
[2020-10-05 22:40:00,604 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:00,604 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-05 22:40:00,604 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704785925]
[2020-10-05 22:40:00,604 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-05 22:40:00,604 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:00,605 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-05 22:40:00,605 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:40:00,605 INFO  L87              Difference]: Start difference. First operand 3106 states and 11788 transitions. Second operand 7 states.
[2020-10-05 22:40:00,779 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:00,779 INFO  L93              Difference]: Finished difference Result 3906 states and 14444 transitions.
[2020-10-05 22:40:00,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-05 22:40:00,780 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-05 22:40:00,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:00,794 INFO  L225             Difference]: With dead ends: 3906
[2020-10-05 22:40:00,794 INFO  L226             Difference]: Without dead ends: 3762
[2020-10-05 22:40:00,795 INFO  L675         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-05 22:40:00,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3762 states.
[2020-10-05 22:40:00,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3762 to 2914.
[2020-10-05 22:40:00,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2914 states.
[2020-10-05 22:40:00,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 10844 transitions.
[2020-10-05 22:40:00,891 INFO  L78                 Accepts]: Start accepts. Automaton has 2914 states and 10844 transitions. Word has length 17
[2020-10-05 22:40:00,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:00,892 INFO  L479      AbstractCegarLoop]: Abstraction has 2914 states and 10844 transitions.
[2020-10-05 22:40:00,892 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-05 22:40:00,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 2914 states and 10844 transitions.
[2020-10-05 22:40:00,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-05 22:40:00,898 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:00,898 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:40:00,898 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-05 22:40:00,898 INFO  L427      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-05 22:40:00,898 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:00,899 INFO  L82        PathProgramCache]: Analyzing trace with hash -2116372454, now seen corresponding path program 1 times
[2020-10-05 22:40:00,899 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:00,899 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13740133]
[2020-10-05 22:40:00,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:00,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:01,000 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-05 22:40:01,001 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13740133]
[2020-10-05 22:40:01,001 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:01,001 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:40:01,001 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297521354]
[2020-10-05 22:40:01,002 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:40:01,002 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:01,002 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:40:01,002 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:40:01,002 INFO  L87              Difference]: Start difference. First operand 2914 states and 10844 transitions. Second operand 5 states.
[2020-10-05 22:40:01,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:01,079 INFO  L93              Difference]: Finished difference Result 3010 states and 11188 transitions.
[2020-10-05 22:40:01,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:40:01,080 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-05 22:40:01,080 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:01,095 INFO  L225             Difference]: With dead ends: 3010
[2020-10-05 22:40:01,095 INFO  L226             Difference]: Without dead ends: 3010
[2020-10-05 22:40:01,096 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:40:01,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3010 states.
[2020-10-05 22:40:01,180 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2914.
[2020-10-05 22:40:01,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2914 states.
[2020-10-05 22:40:01,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 10812 transitions.
[2020-10-05 22:40:01,195 INFO  L78                 Accepts]: Start accepts. Automaton has 2914 states and 10812 transitions. Word has length 17
[2020-10-05 22:40:01,195 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:01,195 INFO  L479      AbstractCegarLoop]: Abstraction has 2914 states and 10812 transitions.
[2020-10-05 22:40:01,195 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:40:01,196 INFO  L276                IsEmpty]: Start isEmpty. Operand 2914 states and 10812 transitions.
[2020-10-05 22:40:01,202 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-05 22:40:01,202 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:01,203 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:40:01,203 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-05 22:40:01,203 INFO  L427      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-05 22:40:01,204 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:01,204 INFO  L82        PathProgramCache]: Analyzing trace with hash -2055699750, now seen corresponding path program 1 times
[2020-10-05 22:40:01,204 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:01,204 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752019801]
[2020-10-05 22:40:01,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:01,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:01,253 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-05 22:40:01,255 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752019801]
[2020-10-05 22:40:01,255 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:01,256 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:40:01,256 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111775280]
[2020-10-05 22:40:01,256 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-05 22:40:01,257 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:01,257 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-05 22:40:01,257 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-05 22:40:01,258 INFO  L87              Difference]: Start difference. First operand 2914 states and 10812 transitions. Second operand 4 states.
[2020-10-05 22:40:01,311 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:01,312 INFO  L93              Difference]: Finished difference Result 4250 states and 15541 transitions.
[2020-10-05 22:40:01,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-05 22:40:01,313 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-05 22:40:01,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:01,325 INFO  L225             Difference]: With dead ends: 4250
[2020-10-05 22:40:01,325 INFO  L226             Difference]: Without dead ends: 2806
[2020-10-05 22:40:01,328 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 22:40:01,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2806 states.
[2020-10-05 22:40:01,553 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2698.
[2020-10-05 22:40:01,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2698 states.
[2020-10-05 22:40:01,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 9546 transitions.
[2020-10-05 22:40:01,565 INFO  L78                 Accepts]: Start accepts. Automaton has 2698 states and 9546 transitions. Word has length 17
[2020-10-05 22:40:01,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:01,565 INFO  L479      AbstractCegarLoop]: Abstraction has 2698 states and 9546 transitions.
[2020-10-05 22:40:01,565 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-05 22:40:01,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 2698 states and 9546 transitions.
[2020-10-05 22:40:01,570 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-05 22:40:01,570 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:01,571 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-05 22:40:01,571 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-05 22:40:01,571 INFO  L427      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-05 22:40:01,571 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:01,571 INFO  L82        PathProgramCache]: Analyzing trace with hash 965208446, now seen corresponding path program 2 times
[2020-10-05 22:40:01,572 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:01,572 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268623099]
[2020-10-05 22:40:01,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:01,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:01,652 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-05 22:40:01,653 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268623099]
[2020-10-05 22:40:01,653 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:01,653 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-05 22:40:01,653 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966550789]
[2020-10-05 22:40:01,654 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-05 22:40:01,654 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:01,654 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-05 22:40:01,654 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-05 22:40:01,654 INFO  L87              Difference]: Start difference. First operand 2698 states and 9546 transitions. Second operand 4 states.
[2020-10-05 22:40:01,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:01,705 INFO  L93              Difference]: Finished difference Result 2747 states and 8853 transitions.
[2020-10-05 22:40:01,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-05 22:40:01,706 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2020-10-05 22:40:01,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:01,712 INFO  L225             Difference]: With dead ends: 2747
[2020-10-05 22:40:01,712 INFO  L226             Difference]: Without dead ends: 2043
[2020-10-05 22:40:01,713 INFO  L675         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-05 22:40:01,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2043 states.
[2020-10-05 22:40:01,755 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2043.
[2020-10-05 22:40:01,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2043 states.
[2020-10-05 22:40:01,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 6534 transitions.
[2020-10-05 22:40:01,762 INFO  L78                 Accepts]: Start accepts. Automaton has 2043 states and 6534 transitions. Word has length 17
[2020-10-05 22:40:01,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:01,762 INFO  L479      AbstractCegarLoop]: Abstraction has 2043 states and 6534 transitions.
[2020-10-05 22:40:01,763 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-05 22:40:01,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 2043 states and 6534 transitions.
[2020-10-05 22:40:01,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-05 22:40:01,766 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:01,766 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-05 22:40:01,766 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-05 22:40:01,767 INFO  L427      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-05 22:40:01,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:01,767 INFO  L82        PathProgramCache]: Analyzing trace with hash -1280116134, now seen corresponding path program 1 times
[2020-10-05 22:40:01,767 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:01,767 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367503874]
[2020-10-05 22:40:01,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:01,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:01,825 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-05 22:40:01,825 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367503874]
[2020-10-05 22:40:01,825 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:01,826 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-05 22:40:01,826 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361031552]
[2020-10-05 22:40:01,826 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-05 22:40:01,826 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:01,827 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-05 22:40:01,827 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-05 22:40:01,827 INFO  L87              Difference]: Start difference. First operand 2043 states and 6534 transitions. Second operand 5 states.
[2020-10-05 22:40:01,884 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:01,884 INFO  L93              Difference]: Finished difference Result 1785 states and 5270 transitions.
[2020-10-05 22:40:01,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-05 22:40:01,885 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-05 22:40:01,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:01,888 INFO  L225             Difference]: With dead ends: 1785
[2020-10-05 22:40:01,888 INFO  L226             Difference]: Without dead ends: 1348
[2020-10-05 22:40:01,889 INFO  L675         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-05 22:40:01,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1348 states.
[2020-10-05 22:40:01,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348.
[2020-10-05 22:40:01,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1348 states.
[2020-10-05 22:40:01,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 3918 transitions.
[2020-10-05 22:40:01,917 INFO  L78                 Accepts]: Start accepts. Automaton has 1348 states and 3918 transitions. Word has length 18
[2020-10-05 22:40:01,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:01,918 INFO  L479      AbstractCegarLoop]: Abstraction has 1348 states and 3918 transitions.
[2020-10-05 22:40:01,918 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-05 22:40:01,918 INFO  L276                IsEmpty]: Start isEmpty. Operand 1348 states and 3918 transitions.
[2020-10-05 22:40:01,920 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-05 22:40:01,920 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:01,921 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-05 22:40:01,921 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-05 22:40:01,921 INFO  L427      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-05 22:40:01,921 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:01,921 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602746911, now seen corresponding path program 1 times
[2020-10-05 22:40:01,921 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:01,922 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099541164]
[2020-10-05 22:40:01,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:01,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:01,960 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-05 22:40:01,960 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099541164]
[2020-10-05 22:40:01,960 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:01,960 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-05 22:40:01,961 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000240118]
[2020-10-05 22:40:01,961 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-05 22:40:01,961 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:01,961 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-05 22:40:01,962 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-05 22:40:01,962 INFO  L87              Difference]: Start difference. First operand 1348 states and 3918 transitions. Second operand 3 states.
[2020-10-05 22:40:01,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:01,982 INFO  L93              Difference]: Finished difference Result 1966 states and 5541 transitions.
[2020-10-05 22:40:01,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-05 22:40:01,983 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 20
[2020-10-05 22:40:01,983 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:01,987 INFO  L225             Difference]: With dead ends: 1966
[2020-10-05 22:40:01,987 INFO  L226             Difference]: Without dead ends: 1354
[2020-10-05 22:40:01,988 INFO  L675         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-05 22:40:01,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1354 states.
[2020-10-05 22:40:02,016 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1330.
[2020-10-05 22:40:02,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1330 states.
[2020-10-05 22:40:02,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 3633 transitions.
[2020-10-05 22:40:02,020 INFO  L78                 Accepts]: Start accepts. Automaton has 1330 states and 3633 transitions. Word has length 20
[2020-10-05 22:40:02,021 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:02,021 INFO  L479      AbstractCegarLoop]: Abstraction has 1330 states and 3633 transitions.
[2020-10-05 22:40:02,021 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-05 22:40:02,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 1330 states and 3633 transitions.
[2020-10-05 22:40:02,024 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-05 22:40:02,024 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:02,024 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-05 22:40:02,024 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-05 22:40:02,025 INFO  L427      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-05 22:40:02,025 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:02,025 INFO  L82        PathProgramCache]: Analyzing trace with hash 664753657, now seen corresponding path program 1 times
[2020-10-05 22:40:02,025 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:02,025 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129915412]
[2020-10-05 22:40:02,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:02,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:02,088 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-05 22:40:02,088 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129915412]
[2020-10-05 22:40:02,089 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:02,089 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-05 22:40:02,089 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299714631]
[2020-10-05 22:40:02,089 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-05 22:40:02,089 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:02,090 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-05 22:40:02,090 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-05 22:40:02,090 INFO  L87              Difference]: Start difference. First operand 1330 states and 3633 transitions. Second operand 6 states.
[2020-10-05 22:40:02,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:02,161 INFO  L93              Difference]: Finished difference Result 1186 states and 3187 transitions.
[2020-10-05 22:40:02,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-05 22:40:02,162 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-05 22:40:02,162 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:02,165 INFO  L225             Difference]: With dead ends: 1186
[2020-10-05 22:40:02,165 INFO  L226             Difference]: Without dead ends: 957
[2020-10-05 22:40:02,165 INFO  L675         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-05 22:40:02,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 957 states.
[2020-10-05 22:40:02,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 869.
[2020-10-05 22:40:02,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 869 states.
[2020-10-05 22:40:02,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2375 transitions.
[2020-10-05 22:40:02,186 INFO  L78                 Accepts]: Start accepts. Automaton has 869 states and 2375 transitions. Word has length 21
[2020-10-05 22:40:02,186 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:02,186 INFO  L479      AbstractCegarLoop]: Abstraction has 869 states and 2375 transitions.
[2020-10-05 22:40:02,187 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-05 22:40:02,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 869 states and 2375 transitions.
[2020-10-05 22:40:02,189 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-05 22:40:02,189 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:02,189 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-05 22:40:02,190 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-05 22:40:02,190 INFO  L427      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-05 22:40:02,190 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:02,190 INFO  L82        PathProgramCache]: Analyzing trace with hash -722983254, now seen corresponding path program 1 times
[2020-10-05 22:40:02,190 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:02,191 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99190195]
[2020-10-05 22:40:02,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:02,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:02,287 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-05 22:40:02,287 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99190195]
[2020-10-05 22:40:02,287 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:02,287 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-05 22:40:02,288 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758622066]
[2020-10-05 22:40:02,288 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-05 22:40:02,288 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:02,289 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-05 22:40:02,289 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-05 22:40:02,289 INFO  L87              Difference]: Start difference. First operand 869 states and 2375 transitions. Second operand 9 states.
[2020-10-05 22:40:02,429 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:02,429 INFO  L93              Difference]: Finished difference Result 1182 states and 3099 transitions.
[2020-10-05 22:40:02,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-05 22:40:02,430 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 24
[2020-10-05 22:40:02,430 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:02,433 INFO  L225             Difference]: With dead ends: 1182
[2020-10-05 22:40:02,433 INFO  L226             Difference]: Without dead ends: 961
[2020-10-05 22:40:02,434 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-10-05 22:40:02,437 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 961 states.
[2020-10-05 22:40:02,451 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 927.
[2020-10-05 22:40:02,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 927 states.
[2020-10-05 22:40:02,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2449 transitions.
[2020-10-05 22:40:02,454 INFO  L78                 Accepts]: Start accepts. Automaton has 927 states and 2449 transitions. Word has length 24
[2020-10-05 22:40:02,454 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:02,454 INFO  L479      AbstractCegarLoop]: Abstraction has 927 states and 2449 transitions.
[2020-10-05 22:40:02,454 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-05 22:40:02,454 INFO  L276                IsEmpty]: Start isEmpty. Operand 927 states and 2449 transitions.
[2020-10-05 22:40:02,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-05 22:40:02,457 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:02,457 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-05 22:40:02,457 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-10-05 22:40:02,457 INFO  L427      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-05 22:40:02,458 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:02,458 INFO  L82        PathProgramCache]: Analyzing trace with hash 1640647600, now seen corresponding path program 2 times
[2020-10-05 22:40:02,458 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:02,458 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382119666]
[2020-10-05 22:40:02,458 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:02,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:02,562 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-05 22:40:02,563 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382119666]
[2020-10-05 22:40:02,563 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:02,563 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-05 22:40:02,563 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347160612]
[2020-10-05 22:40:02,563 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-05 22:40:02,564 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:02,564 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-05 22:40:02,564 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-05 22:40:02,564 INFO  L87              Difference]: Start difference. First operand 927 states and 2449 transitions. Second operand 9 states.
[2020-10-05 22:40:02,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:02,669 INFO  L93              Difference]: Finished difference Result 1084 states and 2731 transitions.
[2020-10-05 22:40:02,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-05 22:40:02,670 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 24
[2020-10-05 22:40:02,670 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:02,672 INFO  L225             Difference]: With dead ends: 1084
[2020-10-05 22:40:02,672 INFO  L226             Difference]: Without dead ends: 886
[2020-10-05 22:40:02,672 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-10-05 22:40:02,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 886 states.
[2020-10-05 22:40:02,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 821.
[2020-10-05 22:40:02,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 821 states.
[2020-10-05 22:40:02,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2082 transitions.
[2020-10-05 22:40:02,688 INFO  L78                 Accepts]: Start accepts. Automaton has 821 states and 2082 transitions. Word has length 24
[2020-10-05 22:40:02,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:02,688 INFO  L479      AbstractCegarLoop]: Abstraction has 821 states and 2082 transitions.
[2020-10-05 22:40:02,689 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-05 22:40:02,689 INFO  L276                IsEmpty]: Start isEmpty. Operand 821 states and 2082 transitions.
[2020-10-05 22:40:02,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-05 22:40:02,691 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:02,691 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-05 22:40:02,691 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-10-05 22:40:02,691 INFO  L427      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-05 22:40:02,691 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:02,692 INFO  L82        PathProgramCache]: Analyzing trace with hash -235696114, now seen corresponding path program 1 times
[2020-10-05 22:40:02,692 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:02,692 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056683181]
[2020-10-05 22:40:02,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:02,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:02,770 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-05 22:40:02,770 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056683181]
[2020-10-05 22:40:02,771 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:02,771 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-05 22:40:02,771 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264586856]
[2020-10-05 22:40:02,771 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-05 22:40:02,771 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:02,772 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-05 22:40:02,772 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-05 22:40:02,772 INFO  L87              Difference]: Start difference. First operand 821 states and 2082 transitions. Second operand 7 states.
[2020-10-05 22:40:02,842 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:02,842 INFO  L93              Difference]: Finished difference Result 790 states and 2021 transitions.
[2020-10-05 22:40:02,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-05 22:40:02,843 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-05 22:40:02,843 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:02,844 INFO  L225             Difference]: With dead ends: 790
[2020-10-05 22:40:02,845 INFO  L226             Difference]: Without dead ends: 507
[2020-10-05 22:40:02,845 INFO  L675         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-05 22:40:02,848 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 507 states.
[2020-10-05 22:40:02,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 423.
[2020-10-05 22:40:02,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 423 states.
[2020-10-05 22:40:02,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1095 transitions.
[2020-10-05 22:40:02,855 INFO  L78                 Accepts]: Start accepts. Automaton has 423 states and 1095 transitions. Word has length 24
[2020-10-05 22:40:02,855 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:02,855 INFO  L479      AbstractCegarLoop]: Abstraction has 423 states and 1095 transitions.
[2020-10-05 22:40:02,855 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-05 22:40:02,856 INFO  L276                IsEmpty]: Start isEmpty. Operand 423 states and 1095 transitions.
[2020-10-05 22:40:02,857 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-05 22:40:02,857 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:02,857 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-05 22:40:02,857 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2020-10-05 22:40:02,857 INFO  L427      AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:40:02,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:02,858 INFO  L82        PathProgramCache]: Analyzing trace with hash -1291397423, now seen corresponding path program 1 times
[2020-10-05 22:40:02,858 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:02,858 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090389797]
[2020-10-05 22:40:02,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:02,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-05 22:40:03,044 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-05 22:40:03,044 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090389797]
[2020-10-05 22:40:03,045 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-05 22:40:03,045 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-10-05 22:40:03,045 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416566125]
[2020-10-05 22:40:03,045 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-10-05 22:40:03,046 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-05 22:40:03,046 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-10-05 22:40:03,046 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2020-10-05 22:40:03,046 INFO  L87              Difference]: Start difference. First operand 423 states and 1095 transitions. Second operand 10 states.
[2020-10-05 22:40:03,252 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-05 22:40:03,252 INFO  L93              Difference]: Finished difference Result 472 states and 1177 transitions.
[2020-10-05 22:40:03,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-05 22:40:03,253 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 27
[2020-10-05 22:40:03,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-05 22:40:03,253 INFO  L225             Difference]: With dead ends: 472
[2020-10-05 22:40:03,253 INFO  L226             Difference]: Without dead ends: 208
[2020-10-05 22:40:03,253 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2020-10-05 22:40:03,254 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2020-10-05 22:40:03,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 169.
[2020-10-05 22:40:03,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 169 states.
[2020-10-05 22:40:03,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 373 transitions.
[2020-10-05 22:40:03,256 INFO  L78                 Accepts]: Start accepts. Automaton has 169 states and 373 transitions. Word has length 27
[2020-10-05 22:40:03,257 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-05 22:40:03,257 INFO  L479      AbstractCegarLoop]: Abstraction has 169 states and 373 transitions.
[2020-10-05 22:40:03,257 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-10-05 22:40:03,257 INFO  L276                IsEmpty]: Start isEmpty. Operand 169 states and 373 transitions.
[2020-10-05 22:40:03,257 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-05 22:40:03,257 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-05 22:40:03,257 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-05 22:40:03,258 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2020-10-05 22:40:03,258 INFO  L427      AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-05 22:40:03,258 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-05 22:40:03,258 INFO  L82        PathProgramCache]: Analyzing trace with hash 1976359869, now seen corresponding path program 2 times
[2020-10-05 22:40:03,258 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-05 22:40:03,258 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944692343]
[2020-10-05 22:40:03,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-05 22:40:03,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-05 22:40:03,296 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-05 22:40:03,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-05 22:40:03,406 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-05 22:40:03,444 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-05 22:40:03,444 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-10-05 22:40:03,445 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2020-10-05 22:40:03,446 WARN  L633   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-05 22:40:03,460 WARN  L123   codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] L2-->L853: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In1864073383 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In1864073383 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In1864073383 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In1864073383 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~y$r_buff1_thd0~0_In1864073383 ~y$r_buff1_thd0~0_Out1864073383) (or (and (= ~y$w_buff0_used~0_Out1864073383 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff0_used~0_In1864073383 ~y$w_buff0_used~0_Out1864073383))) (= ~y$r_buff0_thd0~0_Out1864073383 ~y$r_buff0_thd0~0_In1864073383) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1864073383 0)) (or (and .cse2 (or (and (= ~y~0_In1864073383 ~y~0_Out1864073383) .cse3) (and .cse4 .cse5 (= ~y$w_buff1~0_In1864073383 ~y~0_Out1864073383)))) (and (= ~y$w_buff0~0_In1864073383 ~y~0_Out1864073383) .cse0 .cse1)) (or (and .cse4 .cse5 (= ~y$w_buff1_used~0_Out1864073383 0)) (and (= ~y$w_buff1_used~0_Out1864073383 ~y$w_buff1_used~0_In1864073383) .cse3)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1864073383 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1864073383|))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1864073383|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1864073383, ~y$w_buff1~0=~y$w_buff1~0_In1864073383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1864073383, ~y$w_buff0~0=~y$w_buff0~0_In1864073383, ~y~0=~y~0_In1864073383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1864073383, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1864073383}  OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1864073383, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1864073383|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1864073383|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1864073383|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1864073383|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1864073383|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1864073383|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1864073383|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1864073383, ~y$w_buff1~0=~y$w_buff1~0_In1864073383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1864073383, ~y$w_buff0~0=~y$w_buff0~0_In1864073383, ~y~0=~y~0_Out1864073383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1864073383, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1864073383}  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-05 22:40:03,467 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-05 22:40:03,467 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,469 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-05 22:40:03,469 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,469 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-05 22:40:03,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,470 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-05 22:40:03,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,470 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-05 22:40:03,470 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,470 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-05 22:40:03,471 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,471 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-05 22:40:03,471 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,472 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-05 22:40:03,472 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,472 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-05 22:40:03,472 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,473 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-05 22:40:03,473 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,473 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-05 22:40:03,473 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,473 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-05 22:40:03,473 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,474 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-05 22:40:03,474 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,474 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-05 22:40:03,474 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,475 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-05 22:40:03,475 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,475 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-05 22:40:03,475 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,475 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-05 22:40:03,475 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,476 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-05 22:40:03,476 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,477 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-05 22:40:03,477 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,477 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-05 22:40:03,477 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,477 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-05 22:40:03,477 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,478 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-05 22:40:03,478 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,478 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-05 22:40:03,478 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,478 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-05 22:40:03,478 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,479 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-05 22:40:03,479 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,479 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-05 22:40:03,479 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,479 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-05 22:40:03,479 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,479 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-05 22:40:03,480 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-05 22:40:03,582 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:40:03 BasicIcfg
[2020-10-05 22:40:03,583 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-05 22:40:03,584 INFO  L168              Benchmark]: Toolchain (without parser) took 22777.14 ms. Allocated memory was 140.0 MB in the beginning and 625.0 MB in the end (delta: 485.0 MB). Free memory was 101.6 MB in the beginning and 484.7 MB in the end (delta: -383.2 MB). Peak memory consumption was 466.0 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,585 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,585 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 820.04 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.6 MB in the beginning and 156.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,586 INFO  L168              Benchmark]: Boogie Procedure Inliner took 78.21 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,586 INFO  L168              Benchmark]: Boogie Preprocessor took 44.23 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,586 INFO  L168              Benchmark]: RCFGBuilder took 2186.38 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 150.5 MB in the beginning and 169.3 MB in the end (delta: -18.8 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,587 INFO  L168              Benchmark]: TraceAbstraction took 19642.39 ms. Allocated memory was 249.0 MB in the beginning and 625.0 MB in the end (delta: 375.9 MB). Free memory was 169.3 MB in the beginning and 484.7 MB in the end (delta: -315.4 MB). Peak memory consumption was 424.7 MB. Max. memory is 7.1 GB.
[2020-10-05 22:40:03,590 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.24 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 820.04 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 101.6 MB in the beginning and 156.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 78.21 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 44.23 ms. Allocated memory is still 202.4 MB. Free memory was 153.4 MB in the beginning and 150.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2186.38 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 150.5 MB in the beginning and 169.3 MB in the end (delta: -18.8 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 19642.39 ms. Allocated memory was 249.0 MB in the beginning and 625.0 MB in the end (delta: 375.9 MB). Free memory was 169.3 MB in the beginning and 484.7 MB in the end (delta: -315.4 MB). Peak memory consumption was 424.7 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    LbeTime: 11.3s, 122 ProgramPointsBefore, 46 ProgramPointsAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 1337 VarBasedMoverChecksPositive, 77 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 0 MoverChecksTotal, 7560 CheckedPairsTotal, 90 TotalNumberOfCompositions
  - 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: 19.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 847 SDtfs, 1044 SDslu, 1760 SDs, 0 SdLazy, 884 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s 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.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 2354 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 50865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...