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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-15 22:00:00,518 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-15 22:00:00,521 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-15 22:00:00,545 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-15 22:00:00,545 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-15 22:00:00,547 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-15 22:00:00,548 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-15 22:00:00,549 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-15 22:00:00,551 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-15 22:00:00,552 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-15 22:00:00,553 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-15 22:00:00,554 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-15 22:00:00,554 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-15 22:00:00,555 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-15 22:00:00,557 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-15 22:00:00,558 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-15 22:00:00,559 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-15 22:00:00,560 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-15 22:00:00,562 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-15 22:00:00,563 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-15 22:00:00,565 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-15 22:00:00,566 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-15 22:00:00,567 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-15 22:00:00,568 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-15 22:00:00,570 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-15 22:00:00,571 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-15 22:00:00,571 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-15 22:00:00,572 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-15 22:00:00,572 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-15 22:00:00,573 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-15 22:00:00,573 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-15 22:00:00,574 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-15 22:00:00,574 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-15 22:00:00,575 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-15 22:00:00,576 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-15 22:00:00,576 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-15 22:00:00,577 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-15 22:00:00,577 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-15 22:00:00,577 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-15 22:00:00,579 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-15 22:00:00,580 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-15 22:00:00,580 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf
[2020-10-15 22:00:00,603 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-15 22:00:00,604 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-15 22:00:00,605 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-15 22:00:00,605 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-15 22:00:00,605 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-15 22:00:00,606 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-15 22:00:00,606 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-15 22:00:00,606 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-15 22:00:00,606 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-15 22:00:00,606 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-15 22:00:00,607 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-15 22:00:00,608 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-15 22:00:00,608 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-15 22:00:00,608 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-15 22:00:00,608 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-15 22:00:00,608 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-15 22:00:00,609 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 22:00:00,609 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-15 22:00:00,609 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-15 22:00:00,609 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-15 22:00:00,609 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-15 22:00:00,610 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-15 22:00:00,610 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-15 22:00:00,610 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-15 22:00:00,896 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-15 22:00:00,908 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-15 22:00:00,911 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-15 22:00:00,912 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-15 22:00:00,913 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-15 22:00:00,913 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i
[2020-10-15 22:00:00,988 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668e3419/e872809f61134b859e0886b52cd31672/FLAG1a5ee066b
[2020-10-15 22:00:01,524 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-15 22:00:01,525 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i
[2020-10-15 22:00:01,546 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668e3419/e872809f61134b859e0886b52cd31672/FLAG1a5ee066b
[2020-10-15 22:00:01,806 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e668e3419/e872809f61134b859e0886b52cd31672
[2020-10-15 22:00:01,818 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-15 22:00:01,821 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-15 22:00:01,823 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-15 22:00:01,823 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-15 22:00:01,827 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-15 22:00:01,828 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:00:01" (1/1) ...
[2020-10-15 22:00:01,831 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647a3d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:01, skipping insertion in model container
[2020-10-15 22:00:01,832 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:00:01" (1/1) ...
[2020-10-15 22:00:01,840 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-15 22:00:01,911 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-15 22:00:02,431 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 22:00:02,442 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-15 22:00:02,503 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 22:00:02,591 INFO  L208         MainTranslator]: Completed translation
[2020-10-15 22:00:02,592 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02 WrapperNode
[2020-10-15 22:00:02,593 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-15 22:00:02,593 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-15 22:00:02,594 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-15 22:00:02,594 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-15 22:00:02,602 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,649 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,684 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-15 22:00:02,685 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-15 22:00:02,685 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-15 22:00:02,685 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-15 22:00:02,697 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,697 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,702 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,702 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,720 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,726 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,729 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (1/1) ...
[2020-10-15 22:00:02,734 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-15 22:00:02,734 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-15 22:00:02,734 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-15 22:00:02,735 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-15 22:00:02,735 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (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-15 22:00:02,796 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-15 22:00:02,796 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-15 22:00:02,796 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-15 22:00:02,796 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-15 22:00:02,796 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-15 22:00:02,797 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-15 22:00:02,798 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-15 22:00:02,798 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-15 22:00:02,799 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-15 22:00:02,799 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-15 22:00:02,801 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-15 22:00:02,801 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-15 22:00:02,801 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-15 22:00:02,801 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-15 22:00:02,802 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-15 22:00:02,804 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-15 22:00:04,626 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-15 22:00:04,627 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-15 22:00:04,629 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:00:04 BoogieIcfgContainer
[2020-10-15 22:00:04,629 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-15 22:00:04,630 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-15 22:00:04,630 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-15 22:00:04,634 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-15 22:00:04,634 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:00:01" (1/3) ...
[2020-10-15 22:00:04,635 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e74ad3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:00:04, skipping insertion in model container
[2020-10-15 22:00:04,635 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:00:02" (2/3) ...
[2020-10-15 22:00:04,635 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e74ad3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:00:04, skipping insertion in model container
[2020-10-15 22:00:04,636 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:00:04" (3/3) ...
[2020-10-15 22:00:04,637 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i
[2020-10-15 22:00:04,648 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-15 22:00:04,648 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-15 22:00:04,655 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-15 22:00:04,656 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-15 22:00:04,684 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,685 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,685 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,685 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,686 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,686 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,687 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,687 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,687 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,687 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,688 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,688 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,688 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,689 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,689 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,689 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,689 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,690 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,690 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,690 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,690 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,691 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,691 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,692 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,692 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,692 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,693 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,693 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,693 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,693 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,693 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,694 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,694 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,694 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,694 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,694 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,695 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,695 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,695 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,695 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,696 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,696 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,700 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,700 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,700 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,700 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,702 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,702 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,703 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,703 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,703 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,703 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,703 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,704 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,704 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,704 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,705 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,705 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,706 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,706 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,706 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,706 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,706 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,707 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,707 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,707 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,707 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,707 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,709 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,709 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,709 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,709 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 22:00:04,724 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-15 22:00:04,745 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-15 22:00:04,745 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-15 22:00:04,745 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-15 22:00:04,745 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-15 22:00:04,745 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-15 22:00:04,745 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-15 22:00:04,746 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-15 22:00:04,746 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-15 22:00:04,759 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-15 22:00:04,762 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-15 22:00:04,765 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow
[2020-10-15 22:00:04,767 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow
[2020-10-15 22:00:04,821 INFO  L129       PetriNetUnfolder]: 2/107 cut-off events.
[2020-10-15 22:00:04,822 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-15 22:00:04,827 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 80 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-15 22:00:04,831 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2540
[2020-10-15 22:00:04,914 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:04,915 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:04,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:04,918 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:04,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:04,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:04,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-15 22:00:04,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,050 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,063 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,065 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,066 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,073 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,074 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,078 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,079 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,083 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:05,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,140 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-15 22:00:05,140 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,142 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-15 22:00:05,143 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,193 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,194 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,194 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 22:00:05,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 22:00:05,201 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:05,201 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,295 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,295 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,297 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,320 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,320 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,345 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,346 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,348 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,351 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,351 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,369 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,369 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,371 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,371 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,373 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,374 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,416 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,417 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,417 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,418 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,420 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,420 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,422 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,422 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,442 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,442 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,444 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 22:00:05,475 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,476 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,477 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,477 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,501 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,534 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,534 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,553 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,553 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,554 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,554 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,703 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,703 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,704 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,752 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,753 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,754 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,754 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,756 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 22:00:05,757 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 22:00:05,759 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:05,760 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,791 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:05,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,802 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,802 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,803 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,804 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,806 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,807 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,808 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,808 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:05,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:05,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:05,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,815 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-15 22:00:05,815 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,817 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-15 22:00:05,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,876 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,904 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,904 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,905 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-15 22:00:05,906 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:05,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:05,935 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:05,936 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:05,936 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:06,212 WARN  L193               SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-15 22:00:06,241 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:06,242 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:06,243 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:06,243 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:06,261 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:06,261 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:06,262 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:06,262 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:06,676 WARN  L193               SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-15 22:00:07,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 22:00:07,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:07,058 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-15 22:00:07,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,075 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,076 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,077 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,077 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:07,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-10-15 22:00:07,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-10-15 22:00:07,091 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,114 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,137 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,137 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,138 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,191 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 22:00:07,191 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:07,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,198 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,198 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,202 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,203 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,204 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,206 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:07,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,211 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-15 22:00:07,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,212 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-15 22:00:07,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,252 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,256 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 22:00:07,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 22:00:07,259 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:07,259 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,346 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 22:00:07,347 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:07,367 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,367 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,368 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,396 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,397 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,449 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,449 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,453 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-15 22:00:07,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 22:00:07,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:07,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:07,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,535 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,536 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,536 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,539 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,539 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,541 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,543 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-15 22:00:07,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 22:00:07,544 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-15 22:00:07,545 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,547 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-15 22:00:07,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,548 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-15 22:00:07,548 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,584 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,584 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,585 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,606 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,689 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,690 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,690 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,709 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,709 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,710 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,710 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-15 22:00:07,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:07,889 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-15 22:00:07,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 22:00:08,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 22:00:08,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 22:00:08,950 WARN  L193               SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95
[2020-10-15 22:00:09,070 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 93
[2020-10-15 22:00:09,080 INFO  L132        LiptonReduction]: Checked pairs total: 6958
[2020-10-15 22:00:09,081 INFO  L134        LiptonReduction]: Total number of compositions: 88
[2020-10-15 22:00:09,087 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2020-10-15 22:00:09,300 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states.
[2020-10-15 22:00:09,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 3562 states.
[2020-10-15 22:00:09,311 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-15 22:00:09,311 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:09,312 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:09,313 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:09,319 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:09,319 INFO  L82        PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times
[2020-10-15 22:00:09,329 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:09,329 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191101932]
[2020-10-15 22:00:09,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:09,480 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:09,608 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-15 22:00:09,609 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191101932]
[2020-10-15 22:00:09,610 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:09,611 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 22:00:09,611 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728829413]
[2020-10-15 22:00:09,615 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 22:00:09,616 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:09,630 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 22:00:09,630 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 22:00:09,633 INFO  L87              Difference]: Start difference. First operand 3562 states. Second operand 3 states.
[2020-10-15 22:00:09,793 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:09,794 INFO  L93              Difference]: Finished difference Result 3082 states and 12048 transitions.
[2020-10-15 22:00:09,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 22:00:09,796 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-15 22:00:09,797 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:09,840 INFO  L225             Difference]: With dead ends: 3082
[2020-10-15 22:00:09,840 INFO  L226             Difference]: Without dead ends: 2602
[2020-10-15 22:00:09,841 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 22:00:09,880 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2602 states.
[2020-10-15 22:00:10,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602.
[2020-10-15 22:00:10,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2602 states.
[2020-10-15 22:00:10,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions.
[2020-10-15 22:00:10,039 INFO  L78                 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9
[2020-10-15 22:00:10,040 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:10,040 INFO  L481      AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions.
[2020-10-15 22:00:10,040 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 22:00:10,041 INFO  L276                IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions.
[2020-10-15 22:00:10,045 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-15 22:00:10,045 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:10,045 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:10,045 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-15 22:00:10,046 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:10,046 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:10,046 INFO  L82        PathProgramCache]: Analyzing trace with hash 667621438, now seen corresponding path program 1 times
[2020-10-15 22:00:10,047 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:10,047 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266164948]
[2020-10-15 22:00:10,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:10,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:10,288 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-15 22:00:10,289 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266164948]
[2020-10-15 22:00:10,289 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:10,289 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 22:00:10,290 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468935553]
[2020-10-15 22:00:10,292 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:10,292 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:10,292 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:10,292 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:10,293 INFO  L87              Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states.
[2020-10-15 22:00:10,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:10,421 INFO  L93              Difference]: Finished difference Result 2986 states and 11176 transitions.
[2020-10-15 22:00:10,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:10,422 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-15 22:00:10,422 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:10,457 INFO  L225             Difference]: With dead ends: 2986
[2020-10-15 22:00:10,458 INFO  L226             Difference]: Without dead ends: 2506
[2020-10-15 22:00:10,459 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:10,480 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2506 states.
[2020-10-15 22:00:10,561 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506.
[2020-10-15 22:00:10,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2506 states.
[2020-10-15 22:00:10,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 9624 transitions.
[2020-10-15 22:00:10,581 INFO  L78                 Accepts]: Start accepts. Automaton has 2506 states and 9624 transitions. Word has length 12
[2020-10-15 22:00:10,581 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:10,581 INFO  L481      AbstractCegarLoop]: Abstraction has 2506 states and 9624 transitions.
[2020-10-15 22:00:10,581 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:10,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 2506 states and 9624 transitions.
[2020-10-15 22:00:10,589 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-15 22:00:10,590 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:10,590 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:10,590 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-15 22:00:10,590 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:10,590 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:10,591 INFO  L82        PathProgramCache]: Analyzing trace with hash -807545516, now seen corresponding path program 1 times
[2020-10-15 22:00:10,591 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:10,591 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352757938]
[2020-10-15 22:00:10,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:10,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:10,728 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-15 22:00:10,728 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352757938]
[2020-10-15 22:00:10,729 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:10,729 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 22:00:10,729 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609337019]
[2020-10-15 22:00:10,729 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:10,730 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:10,730 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:10,730 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:10,730 INFO  L87              Difference]: Start difference. First operand 2506 states and 9624 transitions. Second operand 4 states.
[2020-10-15 22:00:10,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:10,795 INFO  L93              Difference]: Finished difference Result 2650 states and 9876 transitions.
[2020-10-15 22:00:10,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:10,795 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-15 22:00:10,796 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:10,815 INFO  L225             Difference]: With dead ends: 2650
[2020-10-15 22:00:10,816 INFO  L226             Difference]: Without dead ends: 2218
[2020-10-15 22:00:10,816 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:10,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2218 states.
[2020-10-15 22:00:10,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218.
[2020-10-15 22:00:10,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2218 states.
[2020-10-15 22:00:10,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions.
[2020-10-15 22:00:10,923 INFO  L78                 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 13
[2020-10-15 22:00:10,923 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:10,923 INFO  L481      AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions.
[2020-10-15 22:00:10,923 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:10,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions.
[2020-10-15 22:00:10,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-15 22:00:10,927 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:10,928 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:10,928 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-15 22:00:10,928 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:10,928 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:10,929 INFO  L82        PathProgramCache]: Analyzing trace with hash -1163919253, now seen corresponding path program 1 times
[2020-10-15 22:00:10,929 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:10,929 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227935506]
[2020-10-15 22:00:10,929 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:10,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:11,018 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-15 22:00:11,019 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227935506]
[2020-10-15 22:00:11,019 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:11,019 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-15 22:00:11,019 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840687143]
[2020-10-15 22:00:11,020 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:11,020 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:11,020 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:11,021 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:11,021 INFO  L87              Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand 4 states.
[2020-10-15 22:00:11,095 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:11,095 INFO  L93              Difference]: Finished difference Result 2410 states and 8912 transitions.
[2020-10-15 22:00:11,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:11,096 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-15 22:00:11,096 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:11,116 INFO  L225             Difference]: With dead ends: 2410
[2020-10-15 22:00:11,116 INFO  L226             Difference]: Without dead ends: 2154
[2020-10-15 22:00:11,117 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:11,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2154 states.
[2020-10-15 22:00:11,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154.
[2020-10-15 22:00:11,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2154 states.
[2020-10-15 22:00:11,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions.
[2020-10-15 22:00:11,210 INFO  L78                 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15
[2020-10-15 22:00:11,210 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:11,210 INFO  L481      AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions.
[2020-10-15 22:00:11,211 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:11,211 INFO  L276                IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions.
[2020-10-15 22:00:11,215 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 22:00:11,215 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:11,215 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:11,216 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-15 22:00:11,216 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:11,216 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:11,216 INFO  L82        PathProgramCache]: Analyzing trace with hash 1542213664, now seen corresponding path program 1 times
[2020-10-15 22:00:11,217 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:11,217 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468776194]
[2020-10-15 22:00:11,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:11,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:11,292 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-15 22:00:11,292 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468776194]
[2020-10-15 22:00:11,292 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:11,293 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 22:00:11,293 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255576293]
[2020-10-15 22:00:11,293 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:11,293 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:11,294 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:11,294 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:11,294 INFO  L87              Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 4 states.
[2020-10-15 22:00:11,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:11,410 INFO  L93              Difference]: Finished difference Result 3274 states and 11856 transitions.
[2020-10-15 22:00:11,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:11,410 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-15 22:00:11,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:11,433 INFO  L225             Difference]: With dead ends: 3274
[2020-10-15 22:00:11,433 INFO  L226             Difference]: Without dead ends: 2346
[2020-10-15 22:00:11,433 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:11,448 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2346 states.
[2020-10-15 22:00:11,515 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2090.
[2020-10-15 22:00:11,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2090 states.
[2020-10-15 22:00:11,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7536 transitions.
[2020-10-15 22:00:11,531 INFO  L78                 Accepts]: Start accepts. Automaton has 2090 states and 7536 transitions. Word has length 16
[2020-10-15 22:00:11,531 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:11,531 INFO  L481      AbstractCegarLoop]: Abstraction has 2090 states and 7536 transitions.
[2020-10-15 22:00:11,531 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:11,531 INFO  L276                IsEmpty]: Start isEmpty. Operand 2090 states and 7536 transitions.
[2020-10-15 22:00:11,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-15 22:00:11,536 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:11,536 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:11,536 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-15 22:00:11,536 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:11,537 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:11,537 INFO  L82        PathProgramCache]: Analyzing trace with hash 698962532, now seen corresponding path program 1 times
[2020-10-15 22:00:11,537 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:11,537 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929692591]
[2020-10-15 22:00:11,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:11,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:11,680 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-15 22:00:11,681 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929692591]
[2020-10-15 22:00:11,681 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:11,681 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 22:00:11,681 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740306414]
[2020-10-15 22:00:11,682 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 22:00:11,682 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:11,682 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 22:00:11,682 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-15 22:00:11,683 INFO  L87              Difference]: Start difference. First operand 2090 states and 7536 transitions. Second operand 6 states.
[2020-10-15 22:00:11,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:11,811 INFO  L93              Difference]: Finished difference Result 2258 states and 7972 transitions.
[2020-10-15 22:00:11,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 22:00:11,812 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-15 22:00:11,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:11,828 INFO  L225             Difference]: With dead ends: 2258
[2020-10-15 22:00:11,828 INFO  L226             Difference]: Without dead ends: 2034
[2020-10-15 22:00:11,829 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-15 22:00:11,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2034 states.
[2020-10-15 22:00:11,887 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034.
[2020-10-15 22:00:11,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2034 states.
[2020-10-15 22:00:11,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 7288 transitions.
[2020-10-15 22:00:11,897 INFO  L78                 Accepts]: Start accepts. Automaton has 2034 states and 7288 transitions. Word has length 16
[2020-10-15 22:00:11,897 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:11,898 INFO  L481      AbstractCegarLoop]: Abstraction has 2034 states and 7288 transitions.
[2020-10-15 22:00:11,898 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 22:00:11,898 INFO  L276                IsEmpty]: Start isEmpty. Operand 2034 states and 7288 transitions.
[2020-10-15 22:00:11,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-15 22:00:11,902 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:11,902 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:11,902 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-15 22:00:11,903 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:11,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:11,903 INFO  L82        PathProgramCache]: Analyzing trace with hash 119699390, now seen corresponding path program 1 times
[2020-10-15 22:00:11,903 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:11,903 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345487250]
[2020-10-15 22:00:11,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:11,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:12,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 22:00:12,041 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345487250]
[2020-10-15 22:00:12,041 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:12,041 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 22:00:12,041 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483783309]
[2020-10-15 22:00:12,042 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-15 22:00:12,042 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:12,042 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-15 22:00:12,042 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-15 22:00:12,042 INFO  L87              Difference]: Start difference. First operand 2034 states and 7288 transitions. Second operand 7 states.
[2020-10-15 22:00:12,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:12,238 INFO  L93              Difference]: Finished difference Result 2326 states and 8176 transitions.
[2020-10-15 22:00:12,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-15 22:00:12,239 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-15 22:00:12,239 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:12,248 INFO  L225             Difference]: With dead ends: 2326
[2020-10-15 22:00:12,248 INFO  L226             Difference]: Without dead ends: 2130
[2020-10-15 22:00:12,249 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2020-10-15 22:00:12,259 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2130 states.
[2020-10-15 22:00:12,310 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2074.
[2020-10-15 22:00:12,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2074 states.
[2020-10-15 22:00:12,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 7368 transitions.
[2020-10-15 22:00:12,324 INFO  L78                 Accepts]: Start accepts. Automaton has 2074 states and 7368 transitions. Word has length 17
[2020-10-15 22:00:12,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:12,324 INFO  L481      AbstractCegarLoop]: Abstraction has 2074 states and 7368 transitions.
[2020-10-15 22:00:12,325 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-15 22:00:12,325 INFO  L276                IsEmpty]: Start isEmpty. Operand 2074 states and 7368 transitions.
[2020-10-15 22:00:12,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-15 22:00:12,331 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:12,332 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-15 22:00:12,332 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-15 22:00:12,332 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:12,332 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:12,332 INFO  L82        PathProgramCache]: Analyzing trace with hash 336259331, now seen corresponding path program 1 times
[2020-10-15 22:00:12,333 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:12,333 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96842136]
[2020-10-15 22:00:12,333 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:12,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:12,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-15 22:00:12,430 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96842136]
[2020-10-15 22:00:12,431 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:12,431 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 22:00:12,431 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815343227]
[2020-10-15 22:00:12,432 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:12,432 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:12,432 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:12,433 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:12,433 INFO  L87              Difference]: Start difference. First operand 2074 states and 7368 transitions. Second operand 4 states.
[2020-10-15 22:00:12,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:12,479 INFO  L93              Difference]: Finished difference Result 2138 states and 6909 transitions.
[2020-10-15 22:00:12,479 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:12,479 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 18
[2020-10-15 22:00:12,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:12,491 INFO  L225             Difference]: With dead ends: 2138
[2020-10-15 22:00:12,491 INFO  L226             Difference]: Without dead ends: 1626
[2020-10-15 22:00:12,491 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:12,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1626 states.
[2020-10-15 22:00:12,543 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1626.
[2020-10-15 22:00:12,543 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1626 states.
[2020-10-15 22:00:12,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5224 transitions.
[2020-10-15 22:00:12,551 INFO  L78                 Accepts]: Start accepts. Automaton has 1626 states and 5224 transitions. Word has length 18
[2020-10-15 22:00:12,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:12,551 INFO  L481      AbstractCegarLoop]: Abstraction has 1626 states and 5224 transitions.
[2020-10-15 22:00:12,551 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:12,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 1626 states and 5224 transitions.
[2020-10-15 22:00:12,555 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-15 22:00:12,555 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:12,555 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 22:00:12,555 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-15 22:00:12,556 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:12,556 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:12,556 INFO  L82        PathProgramCache]: Analyzing trace with hash -1602332560, now seen corresponding path program 1 times
[2020-10-15 22:00:12,556 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:12,560 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501696634]
[2020-10-15 22:00:12,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:12,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:12,675 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-15 22:00:12,676 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501696634]
[2020-10-15 22:00:12,676 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:12,676 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 22:00:12,677 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741213571]
[2020-10-15 22:00:12,677 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 22:00:12,677 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:12,677 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 22:00:12,678 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:12,678 INFO  L87              Difference]: Start difference. First operand 1626 states and 5224 transitions. Second operand 5 states.
[2020-10-15 22:00:12,726 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:12,726 INFO  L93              Difference]: Finished difference Result 1373 states and 4010 transitions.
[2020-10-15 22:00:12,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 22:00:12,727 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2020-10-15 22:00:12,727 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:12,731 INFO  L225             Difference]: With dead ends: 1373
[2020-10-15 22:00:12,731 INFO  L226             Difference]: Without dead ends: 1050
[2020-10-15 22:00:12,731 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 22:00:12,736 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1050 states.
[2020-10-15 22:00:12,755 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050.
[2020-10-15 22:00:12,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1050 states.
[2020-10-15 22:00:12,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3006 transitions.
[2020-10-15 22:00:12,759 INFO  L78                 Accepts]: Start accepts. Automaton has 1050 states and 3006 transitions. Word has length 19
[2020-10-15 22:00:12,759 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:12,759 INFO  L481      AbstractCegarLoop]: Abstraction has 1050 states and 3006 transitions.
[2020-10-15 22:00:12,759 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 22:00:12,759 INFO  L276                IsEmpty]: Start isEmpty. Operand 1050 states and 3006 transitions.
[2020-10-15 22:00:12,762 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-15 22:00:12,762 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:12,762 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-15 22:00:12,762 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-15 22:00:12,762 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:12,763 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:12,763 INFO  L82        PathProgramCache]: Analyzing trace with hash -1622927393, now seen corresponding path program 1 times
[2020-10-15 22:00:12,763 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:12,763 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148444536]
[2020-10-15 22:00:12,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:12,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:12,831 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-15 22:00:12,831 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148444536]
[2020-10-15 22:00:12,832 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:12,832 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 22:00:12,832 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611570149]
[2020-10-15 22:00:12,832 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 22:00:12,833 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:12,833 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 22:00:12,833 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:12,833 INFO  L87              Difference]: Start difference. First operand 1050 states and 3006 transitions. Second operand 5 states.
[2020-10-15 22:00:12,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:12,875 INFO  L93              Difference]: Finished difference Result 1467 states and 4093 transitions.
[2020-10-15 22:00:12,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:12,875 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2020-10-15 22:00:12,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:12,878 INFO  L225             Difference]: With dead ends: 1467
[2020-10-15 22:00:12,879 INFO  L226             Difference]: Without dead ends: 1092
[2020-10-15 22:00:12,879 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-15 22:00:12,884 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1092 states.
[2020-10-15 22:00:12,902 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1050.
[2020-10-15 22:00:12,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1050 states.
[2020-10-15 22:00:12,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 2926 transitions.
[2020-10-15 22:00:12,905 INFO  L78                 Accepts]: Start accepts. Automaton has 1050 states and 2926 transitions. Word has length 21
[2020-10-15 22:00:12,906 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:12,906 INFO  L481      AbstractCegarLoop]: Abstraction has 1050 states and 2926 transitions.
[2020-10-15 22:00:12,906 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 22:00:12,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 1050 states and 2926 transitions.
[2020-10-15 22:00:12,908 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-15 22:00:12,908 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:12,908 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-15 22:00:12,909 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-15 22:00:12,909 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:12,909 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:12,909 INFO  L82        PathProgramCache]: Analyzing trace with hash 1096349146, now seen corresponding path program 1 times
[2020-10-15 22:00:12,909 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:12,910 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408997074]
[2020-10-15 22:00:12,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:12,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:12,973 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-15 22:00:12,974 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408997074]
[2020-10-15 22:00:12,974 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:12,974 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 22:00:12,974 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787533514]
[2020-10-15 22:00:12,975 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 22:00:12,975 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:12,975 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 22:00:12,975 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 22:00:12,976 INFO  L87              Difference]: Start difference. First operand 1050 states and 2926 transitions. Second operand 4 states.
[2020-10-15 22:00:13,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:13,008 INFO  L93              Difference]: Finished difference Result 1535 states and 4078 transitions.
[2020-10-15 22:00:13,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 22:00:13,009 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2020-10-15 22:00:13,009 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:13,012 INFO  L225             Difference]: With dead ends: 1535
[2020-10-15 22:00:13,012 INFO  L226             Difference]: Without dead ends: 1050
[2020-10-15 22:00:13,012 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 22:00:13,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1050 states.
[2020-10-15 22:00:13,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1010.
[2020-10-15 22:00:13,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1010 states.
[2020-10-15 22:00:13,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 2638 transitions.
[2020-10-15 22:00:13,036 INFO  L78                 Accepts]: Start accepts. Automaton has 1010 states and 2638 transitions. Word has length 21
[2020-10-15 22:00:13,036 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:13,036 INFO  L481      AbstractCegarLoop]: Abstraction has 1010 states and 2638 transitions.
[2020-10-15 22:00:13,036 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 22:00:13,036 INFO  L276                IsEmpty]: Start isEmpty. Operand 1010 states and 2638 transitions.
[2020-10-15 22:00:13,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-10-15 22:00:13,039 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:13,039 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-15 22:00:13,039 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-15 22:00:13,039 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:13,040 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:13,040 INFO  L82        PathProgramCache]: Analyzing trace with hash 1643789257, now seen corresponding path program 1 times
[2020-10-15 22:00:13,040 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:13,040 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349068718]
[2020-10-15 22:00:13,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:13,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:13,151 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-15 22:00:13,152 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349068718]
[2020-10-15 22:00:13,152 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:13,152 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 22:00:13,152 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479457542]
[2020-10-15 22:00:13,152 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 22:00:13,153 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:13,153 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 22:00:13,153 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 22:00:13,153 INFO  L87              Difference]: Start difference. First operand 1010 states and 2638 transitions. Second operand 6 states.
[2020-10-15 22:00:13,258 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:13,259 INFO  L93              Difference]: Finished difference Result 855 states and 2168 transitions.
[2020-10-15 22:00:13,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 22:00:13,262 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 21
[2020-10-15 22:00:13,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:13,264 INFO  L225             Difference]: With dead ends: 855
[2020-10-15 22:00:13,264 INFO  L226             Difference]: Without dead ends: 543
[2020-10-15 22:00:13,265 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-15 22:00:13,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 543 states.
[2020-10-15 22:00:13,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 523.
[2020-10-15 22:00:13,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 523 states.
[2020-10-15 22:00:13,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 1236 transitions.
[2020-10-15 22:00:13,280 INFO  L78                 Accepts]: Start accepts. Automaton has 523 states and 1236 transitions. Word has length 21
[2020-10-15 22:00:13,280 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:13,281 INFO  L481      AbstractCegarLoop]: Abstraction has 523 states and 1236 transitions.
[2020-10-15 22:00:13,281 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 22:00:13,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 523 states and 1236 transitions.
[2020-10-15 22:00:13,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-15 22:00:13,283 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:13,283 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-15 22:00:13,284 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-15 22:00:13,284 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:13,284 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:13,284 INFO  L82        PathProgramCache]: Analyzing trace with hash -1155030226, now seen corresponding path program 1 times
[2020-10-15 22:00:13,284 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:13,285 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327015117]
[2020-10-15 22:00:13,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:13,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:13,586 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-15 22:00:13,587 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327015117]
[2020-10-15 22:00:13,587 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:13,587 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-15 22:00:13,587 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144536979]
[2020-10-15 22:00:13,588 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-15 22:00:13,588 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:13,588 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-15 22:00:13,588 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-15 22:00:13,588 INFO  L87              Difference]: Start difference. First operand 523 states and 1236 transitions. Second operand 8 states.
[2020-10-15 22:00:13,777 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:13,777 INFO  L93              Difference]: Finished difference Result 711 states and 1628 transitions.
[2020-10-15 22:00:13,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 22:00:13,777 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 24
[2020-10-15 22:00:13,778 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:13,779 INFO  L225             Difference]: With dead ends: 711
[2020-10-15 22:00:13,779 INFO  L226             Difference]: Without dead ends: 509
[2020-10-15 22:00:13,780 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2020-10-15 22:00:13,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 509 states.
[2020-10-15 22:00:13,792 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 455.
[2020-10-15 22:00:13,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 455 states.
[2020-10-15 22:00:13,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1017 transitions.
[2020-10-15 22:00:13,794 INFO  L78                 Accepts]: Start accepts. Automaton has 455 states and 1017 transitions. Word has length 24
[2020-10-15 22:00:13,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:13,794 INFO  L481      AbstractCegarLoop]: Abstraction has 455 states and 1017 transitions.
[2020-10-15 22:00:13,795 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-15 22:00:13,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 455 states and 1017 transitions.
[2020-10-15 22:00:13,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-15 22:00:13,796 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:13,796 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-15 22:00:13,796 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-15 22:00:13,797 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:13,797 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:13,797 INFO  L82        PathProgramCache]: Analyzing trace with hash 1455099246, now seen corresponding path program 2 times
[2020-10-15 22:00:13,797 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:13,797 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070839190]
[2020-10-15 22:00:13,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:13,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:14,015 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-15 22:00:14,015 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070839190]
[2020-10-15 22:00:14,016 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:14,016 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 22:00:14,020 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359123818]
[2020-10-15 22:00:14,021 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-15 22:00:14,021 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:14,021 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-15 22:00:14,021 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-15 22:00:14,022 INFO  L87              Difference]: Start difference. First operand 455 states and 1017 transitions. Second operand 7 states.
[2020-10-15 22:00:14,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:14,212 INFO  L93              Difference]: Finished difference Result 529 states and 1178 transitions.
[2020-10-15 22:00:14,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 22:00:14,216 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-15 22:00:14,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:14,219 INFO  L225             Difference]: With dead ends: 529
[2020-10-15 22:00:14,219 INFO  L226             Difference]: Without dead ends: 497
[2020-10-15 22:00:14,219 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2020-10-15 22:00:14,222 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 497 states.
[2020-10-15 22:00:14,229 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 447.
[2020-10-15 22:00:14,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 447 states.
[2020-10-15 22:00:14,230 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 993 transitions.
[2020-10-15 22:00:14,230 INFO  L78                 Accepts]: Start accepts. Automaton has 447 states and 993 transitions. Word has length 24
[2020-10-15 22:00:14,230 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:14,231 INFO  L481      AbstractCegarLoop]: Abstraction has 447 states and 993 transitions.
[2020-10-15 22:00:14,231 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-15 22:00:14,231 INFO  L276                IsEmpty]: Start isEmpty. Operand 447 states and 993 transitions.
[2020-10-15 22:00:14,233 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-15 22:00:14,233 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:14,233 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-15 22:00:14,233 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-15 22:00:14,233 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:14,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:14,234 INFO  L82        PathProgramCache]: Analyzing trace with hash 542864494, now seen corresponding path program 3 times
[2020-10-15 22:00:14,234 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:14,234 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097601999]
[2020-10-15 22:00:14,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:14,281 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:14,497 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-15 22:00:14,498 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097601999]
[2020-10-15 22:00:14,498 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:14,498 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-15 22:00:14,499 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377099661]
[2020-10-15 22:00:14,500 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-15 22:00:14,501 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:14,501 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-15 22:00:14,501 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2020-10-15 22:00:14,501 INFO  L87              Difference]: Start difference. First operand 447 states and 993 transitions. Second operand 8 states.
[2020-10-15 22:00:14,662 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:14,662 INFO  L93              Difference]: Finished difference Result 479 states and 1062 transitions.
[2020-10-15 22:00:14,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 22:00:14,663 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 24
[2020-10-15 22:00:14,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:14,665 INFO  L225             Difference]: With dead ends: 479
[2020-10-15 22:00:14,665 INFO  L226             Difference]: Without dead ends: 354
[2020-10-15 22:00:14,666 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2020-10-15 22:00:14,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2020-10-15 22:00:14,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 322.
[2020-10-15 22:00:14,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 322 states.
[2020-10-15 22:00:14,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 700 transitions.
[2020-10-15 22:00:14,675 INFO  L78                 Accepts]: Start accepts. Automaton has 322 states and 700 transitions. Word has length 24
[2020-10-15 22:00:14,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:14,675 INFO  L481      AbstractCegarLoop]: Abstraction has 322 states and 700 transitions.
[2020-10-15 22:00:14,675 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-15 22:00:14,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 322 states and 700 transitions.
[2020-10-15 22:00:14,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-10-15 22:00:14,676 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:14,677 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-15 22:00:14,677 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-15 22:00:14,677 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:14,677 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:14,678 INFO  L82        PathProgramCache]: Analyzing trace with hash -1352959002, now seen corresponding path program 1 times
[2020-10-15 22:00:14,678 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:14,678 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294715250]
[2020-10-15 22:00:14,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:14,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 22:00:14,787 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-15 22:00:14,787 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294715250]
[2020-10-15 22:00:14,788 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 22:00:14,788 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-15 22:00:14,788 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985777476]
[2020-10-15 22:00:14,788 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-15 22:00:14,789 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 22:00:14,789 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-15 22:00:14,791 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-15 22:00:14,791 INFO  L87              Difference]: Start difference. First operand 322 states and 700 transitions. Second operand 7 states.
[2020-10-15 22:00:14,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 22:00:14,851 INFO  L93              Difference]: Finished difference Result 293 states and 643 transitions.
[2020-10-15 22:00:14,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-15 22:00:14,852 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-10-15 22:00:14,852 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 22:00:14,852 INFO  L225             Difference]: With dead ends: 293
[2020-10-15 22:00:14,852 INFO  L226             Difference]: Without dead ends: 65
[2020-10-15 22:00:14,853 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-15 22:00:14,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 65 states.
[2020-10-15 22:00:14,854 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2020-10-15 22:00:14,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 65 states.
[2020-10-15 22:00:14,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions.
[2020-10-15 22:00:14,855 INFO  L78                 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 24
[2020-10-15 22:00:14,855 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 22:00:14,855 INFO  L481      AbstractCegarLoop]: Abstraction has 65 states and 123 transitions.
[2020-10-15 22:00:14,855 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-15 22:00:14,855 INFO  L276                IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions.
[2020-10-15 22:00:14,856 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2020-10-15 22:00:14,856 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 22:00:14,856 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-15 22:00:14,856 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-15 22:00:14,856 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 22:00:14,857 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 22:00:14,857 INFO  L82        PathProgramCache]: Analyzing trace with hash 743532320, now seen corresponding path program 1 times
[2020-10-15 22:00:14,857 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 22:00:14,857 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654714626]
[2020-10-15 22:00:14,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 22:00:14,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 22:00:14,894 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 22:00:14,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 22:00:14,933 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 22:00:14,968 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-15 22:00:14,969 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-15 22:00:14,969 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-15 22:00:14,990 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-15 22:00:14,990 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,992 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-15 22:00:14,992 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,993 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-15 22:00:14,993 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,993 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-15 22:00:14,993 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,993 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-15 22:00:14,993 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,994 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-15 22:00:14,994 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,994 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-15 22:00:14,994 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,995 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-15 22:00:14,995 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,995 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-15 22:00:14,995 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,995 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-15 22:00:14,995 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,996 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-15 22:00:14,996 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,996 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-15 22:00:14,996 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,997 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-15 22:00:14,997 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,997 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-15 22:00:14,997 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,997 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-15 22:00:14,997 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,997 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-15 22:00:14,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,998 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-15 22:00:14,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,998 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-15 22:00:14,998 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,998 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-15 22:00:14,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,999 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-15 22:00:14,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,999 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-15 22:00:14,999 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:14,999 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-15 22:00:15,000 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,000 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-15 22:00:15,000 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,000 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-15 22:00:15,000 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,000 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-15 22:00:15,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,001 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-15 22:00:15,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,001 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-15 22:00:15,001 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,001 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-15 22:00:15,002 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 22:00:15,106 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:00:15 BasicIcfg
[2020-10-15 22:00:15,106 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-15 22:00:15,107 INFO  L168              Benchmark]: Toolchain (without parser) took 13287.54 ms. Allocated memory was 244.3 MB in the beginning and 640.7 MB in the end (delta: 396.4 MB). Free memory was 199.5 MB in the beginning and 299.3 MB in the end (delta: -99.9 MB). Peak memory consumption was 296.5 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,108 INFO  L168              Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 244.3 MB. Free memory is still 220.7 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,108 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 769.80 ms. Allocated memory was 244.3 MB in the beginning and 292.6 MB in the end (delta: 48.2 MB). Free memory was 199.5 MB in the beginning and 238.3 MB in the end (delta: -38.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,112 INFO  L168              Benchmark]: Boogie Procedure Inliner took 91.40 ms. Allocated memory is still 292.6 MB. Free memory was 238.3 MB in the beginning and 235.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,112 INFO  L168              Benchmark]: Boogie Preprocessor took 48.99 ms. Allocated memory is still 292.6 MB. Free memory was 235.8 MB in the beginning and 233.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,113 INFO  L168              Benchmark]: RCFGBuilder took 1894.89 ms. Allocated memory was 292.6 MB in the beginning and 350.2 MB in the end (delta: 57.7 MB). Free memory was 233.3 MB in the beginning and 189.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,114 INFO  L168              Benchmark]: TraceAbstraction took 10475.64 ms. Allocated memory was 350.2 MB in the beginning and 640.7 MB in the end (delta: 290.5 MB). Free memory was 189.6 MB in the beginning and 299.3 MB in the end (delta: -109.8 MB). Peak memory consumption was 180.7 MB. Max. memory is 14.2 GB.
[2020-10-15 22:00:15,118 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.22 ms. Allocated memory is still 244.3 MB. Free memory is still 220.7 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 769.80 ms. Allocated memory was 244.3 MB in the beginning and 292.6 MB in the end (delta: 48.2 MB). Free memory was 199.5 MB in the beginning and 238.3 MB in the end (delta: -38.8 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 91.40 ms. Allocated memory is still 292.6 MB. Free memory was 238.3 MB in the beginning and 235.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 48.99 ms. Allocated memory is still 292.6 MB. Free memory was 235.8 MB in the beginning and 233.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 1894.89 ms. Allocated memory was 292.6 MB in the beginning and 350.2 MB in the end (delta: 57.7 MB). Free memory was 233.3 MB in the beginning and 189.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 101.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 10475.64 ms. Allocated memory was 350.2 MB in the beginning and 640.7 MB in the end (delta: 290.5 MB). Free memory was 189.6 MB in the beginning and 299.3 MB in the end (delta: -109.8 MB). Peak memory consumption was 180.7 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1640 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 122 PlacesBefore, 46 PlacesAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6958 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p3_EAX = 0;
[L703]               0  int __unbuffered_p3_EBX = 0;
[L705]               0  int a = 0;
[L707]               0  int b = 0;
[L708]               0  _Bool main$tmp_guard0;
[L709]               0  _Bool main$tmp_guard1;
[L711]               0  int x = 0;
[L713]               0  int y = 0;
[L715]               0  int z = 0;
[L716]               0  _Bool z$flush_delayed;
[L717]               0  int z$mem_tmp;
[L718]               0  _Bool z$r_buff0_thd0;
[L719]               0  _Bool z$r_buff0_thd1;
[L720]               0  _Bool z$r_buff0_thd2;
[L721]               0  _Bool z$r_buff0_thd3;
[L722]               0  _Bool z$r_buff0_thd4;
[L723]               0  _Bool z$r_buff1_thd0;
[L724]               0  _Bool z$r_buff1_thd1;
[L725]               0  _Bool z$r_buff1_thd2;
[L726]               0  _Bool z$r_buff1_thd3;
[L727]               0  _Bool z$r_buff1_thd4;
[L728]               0  _Bool z$read_delayed;
[L729]               0  int *z$read_delayed_var;
[L730]               0  int z$w_buff0;
[L731]               0  _Bool z$w_buff0_used;
[L732]               0  int z$w_buff1;
[L733]               0  _Bool z$w_buff1_used;
[L734]               0  _Bool weak$$choice0;
[L735]               0  _Bool weak$$choice2;
[L833]               0  pthread_t t1269;
[L834]  FCALL, FORK  0  pthread_create(&t1269, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L835]               0  pthread_t t1270;
[L836]  FCALL, FORK  0  pthread_create(&t1270, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]               0  pthread_t t1271;
[L838]  FCALL, FORK  0  pthread_create(&t1271, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]               0  pthread_t t1272;
[L840]  FCALL, FORK  0  pthread_create(&t1272, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L789]               4  z$w_buff1 = z$w_buff0
[L790]               4  z$w_buff0 = 2
[L791]               4  z$w_buff1_used = z$w_buff0_used
[L792]               4  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    4  !expression
[L7]                 4  __VERIFIER_error()
[L794]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L795]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L796]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L797]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L798]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L799]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L802]               4  a = 1
[L805]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L808]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L739]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L742]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L754]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L747]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L749]               1  return 0;
[L757]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L762]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L764]               2  return 0;
[L769]               3  y = 2
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L772]               3  z = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L811]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L811]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L812]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L812]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L813]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L814]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L815]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L818]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L820]               4  return 0;
[L775]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L775]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L776]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L776]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L777]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L777]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L778]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L778]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L779]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L779]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L782]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L784]               3  return 0;
[L842]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L3]    COND FALSE   0  !(!cond)
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L846]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L846]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L847]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L848]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L848]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L849]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L849]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L850]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L850]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L853]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L854]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L855]               0  z$flush_delayed = weak$$choice2
[L856]               0  z$mem_tmp = z
[L857]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L857]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1
[L857]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L857]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L858]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L858]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L858]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L858]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L859]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L859]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L859]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L860]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L861]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L862]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]               0  main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L865]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L865]               0  z = z$flush_delayed ? z$mem_tmp : z
[L866]               0  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 651 SDtfs, 762 SDslu, 1288 SDs, 0 SdLazy, 421 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 550 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 42131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...