/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i


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


This is Ultimate 0.1.25-1d1d2b5
[2020-10-21 22:01:08,643 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-21 22:01:08,646 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-21 22:01:08,687 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-21 22:01:08,688 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-21 22:01:08,696 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-21 22:01:08,699 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-21 22:01:08,703 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-21 22:01:08,706 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-21 22:01:08,709 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-21 22:01:08,710 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-21 22:01:08,711 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-21 22:01:08,711 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-21 22:01:08,714 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-21 22:01:08,717 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-21 22:01:08,718 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-21 22:01:08,721 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-21 22:01:08,722 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-21 22:01:08,723 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-21 22:01:08,731 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-21 22:01:08,734 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-21 22:01:08,735 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-21 22:01:08,736 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-21 22:01:08,737 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-21 22:01:08,754 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-21 22:01:08,755 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-21 22:01:08,755 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-21 22:01:08,756 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-21 22:01:08,756 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-21 22:01:08,760 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-21 22:01:08,760 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-21 22:01:08,761 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-21 22:01:08,762 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-21 22:01:08,763 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-21 22:01:08,763 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-21 22:01:08,764 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-21 22:01:08,764 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-21 22:01:08,765 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-21 22:01:08,765 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-21 22:01:08,770 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-21 22:01:08,771 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-21 22:01:08,772 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-21 22:01:08,800 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-21 22:01:08,801 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-21 22:01:08,802 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-21 22:01:08,802 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-21 22:01:08,802 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-21 22:01:08,803 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-21 22:01:08,803 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-21 22:01:08,803 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-21 22:01:08,803 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-21 22:01:08,804 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-21 22:01:08,804 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-21 22:01:08,804 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-21 22:01:08,804 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-21 22:01:08,804 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-21 22:01:08,805 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-21 22:01:08,805 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-21 22:01:08,805 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-21 22:01:08,805 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-21 22:01:08,806 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-21 22:01:08,806 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-21 22:01:08,806 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-21 22:01:08,806 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:08,806 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-21 22:01:08,807 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-21 22:01:08,808 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-21 22:01:09,093 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-21 22:01:09,106 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-21 22:01:09,110 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-21 22:01:09,112 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-21 22:01:09,112 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-21 22:01:09,113 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-21 22:01:09,188 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5053fcd32/e3253bdd45d642e4bef52476fb64c260/FLAGfa97b529f
[2020-10-21 22:01:09,772 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-21 22:01:09,773 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i
[2020-10-21 22:01:09,792 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5053fcd32/e3253bdd45d642e4bef52476fb64c260/FLAGfa97b529f
[2020-10-21 22:01:10,105 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5053fcd32/e3253bdd45d642e4bef52476fb64c260
[2020-10-21 22:01:10,114 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-21 22:01:10,121 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-21 22:01:10,122 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:10,122 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-21 22:01:10,126 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-21 22:01:10,127 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,130 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e0b9ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10, skipping insertion in model container
[2020-10-21 22:01:10,130 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,138 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-21 22:01:10,180 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-21 22:01:10,738 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:10,750 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-21 22:01:10,816 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:10,898 INFO  L208         MainTranslator]: Completed translation
[2020-10-21 22:01:10,899 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10 WrapperNode
[2020-10-21 22:01:10,899 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:10,900 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:10,900 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-21 22:01:10,900 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-21 22:01:10,910 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,931 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,975 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:10,976 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-21 22:01:10,976 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-21 22:01:10,976 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-21 22:01:10,987 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,988 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,993 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:10,994 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:11,013 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:11,025 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:11,030 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
[2020-10-21 22:01:11,036 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-21 22:01:11,044 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-21 22:01:11,044 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-21 22:01:11,044 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-21 22:01:11,046 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:11,130 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-21 22:01:11,130 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-21 22:01:11,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-21 22:01:11,131 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-21 22:01:11,131 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-21 22:01:11,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-21 22:01:11,131 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-21 22:01:11,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-21 22:01:11,132 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-21 22:01:11,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-21 22:01:11,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-21 22:01:11,133 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-21 22:01:11,133 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-21 22:01:11,133 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-21 22:01:11,135 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-21 22:01:13,336 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-21 22:01:13,336 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-10-21 22:01:13,339 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:13 BoogieIcfgContainer
[2020-10-21 22:01:13,340 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-21 22:01:13,341 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-21 22:01:13,341 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-21 22:01:13,345 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-21 22:01:13,345 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:01:10" (1/3) ...
[2020-10-21 22:01:13,346 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142c11f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:13, skipping insertion in model container
[2020-10-21 22:01:13,347 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:10" (2/3) ...
[2020-10-21 22:01:13,347 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142c11f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:13, skipping insertion in model container
[2020-10-21 22:01:13,348 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:13" (3/3) ...
[2020-10-21 22:01:13,350 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i
[2020-10-21 22:01:13,364 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-21 22:01:13,364 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-21 22:01:13,372 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-21 22:01:13,374 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-21 22:01:13,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,408 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,408 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,409 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,409 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,409 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,410 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,410 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,410 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,410 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,410 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,411 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,413 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,413 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,413 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,413 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,414 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,415 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,416 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,416 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,416 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,417 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,418 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,423 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,423 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,423 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,423 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,424 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,424 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,424 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,424 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,425 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,425 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,425 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,425 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,425 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,426 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,430 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,430 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,430 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,431 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,431 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,431 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,431 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,431 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,432 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,432 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,436 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,437 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,437 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,437 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,438 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,438 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,438 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,438 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,439 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:13,441 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-21 22:01:13,457 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-21 22:01:13,484 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-21 22:01:13,484 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-21 22:01:13,484 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-21 22:01:13,484 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-21 22:01:13,485 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-21 22:01:13,485 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-21 22:01:13,485 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-21 22:01:13,485 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-21 22:01:13,502 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-21 22:01:13,505 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:13,508 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:13,510 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:13,562 INFO  L129       PetriNetUnfolder]: 3/98 cut-off events.
[2020-10-21 22:01:13,562 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-21 22:01:13,568 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. 
[2020-10-21 22:01:13,572 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1870
[2020-10-21 22:01:13,721 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:13,722 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,724 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:13,725 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,730 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:13,730 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:13,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:13,735 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,810 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:13,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,819 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,823 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:13,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:13,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:13,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:13,832 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:13,833 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,836 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:13,837 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,839 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:13,839 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,063 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,078 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,078 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,080 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,080 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,084 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,084 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,087 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,093 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,094 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,097 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,098 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,099 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,100 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,150 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,150 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,151 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:14,152 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,155 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:14,158 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,283 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,285 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,290 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,290 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,308 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,675 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,681 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,686 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,712 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,713 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,714 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,714 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,717 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,717 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,723 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,724 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,786 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,787 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,787 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:14,788 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,820 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,821 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,822 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:14,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,878 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,879 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,886 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,886 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,887 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,893 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,893 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,894 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,895 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,897 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,897 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,899 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,899 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,902 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,902 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,969 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:14,969 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:14,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,974 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:14,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:14,979 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,193 WARN  L193               SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-21 22:01:16,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-21 22:01:16,200 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,222 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:16,223 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,023 WARN  L193               SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-21 22:01:17,153 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,156 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,157 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,159 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,181 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,181 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,182 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,183 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,184 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,184 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,186 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,186 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,252 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,253 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,253 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,254 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,258 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,258 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,272 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,272 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,273 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,274 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,276 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,277 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,313 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,314 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,319 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,336 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,337 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,338 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,339 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,341 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,541 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,542 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,542 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,543 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,590 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,591 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,609 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,609 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,610 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,613 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,615 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,649 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:17,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:17,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:17,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:17,671 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,672 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:01:17,672 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,673 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,674 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,675 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,680 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:17,681 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,682 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,685 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:17,776 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,776 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,777 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,777 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,779 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,779 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,781 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,781 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,795 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,795 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,796 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,796 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:17,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:17,798 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,800 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:17,800 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-21 22:01:17,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,122 WARN  L193               SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-21 22:01:18,231 WARN  L193               SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-21 22:01:18,414 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,414 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,415 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,416 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,417 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,417 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,419 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,419 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,430 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,431 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,432 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,432 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,434 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,434 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,435 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,436 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,482 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,484 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,486 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,486 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,488 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,503 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,504 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,505 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,508 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,509 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,607 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,608 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,609 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,610 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,622 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,623 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,624 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,624 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,627 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,664 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,664 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,665 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,666 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,667 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,667 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,684 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,684 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,783 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,784 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,785 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,785 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,788 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,790 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,811 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,817 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,958 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,959 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,960 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,962 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,962 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,964 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,965 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:18,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,981 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:18,983 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:18,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:18,985 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:18,985 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:19,235 WARN  L193               SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54
[2020-10-21 22:01:19,948 WARN  L193               SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112
[2020-10-21 22:01:20,136 WARN  L193               SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-21 22:01:20,145 INFO  L131        LiptonReduction]: Checked pairs total: 4899
[2020-10-21 22:01:20,146 INFO  L133        LiptonReduction]: Total number of compositions: 89
[2020-10-21 22:01:20,153 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-21 22:01:20,227 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states.
[2020-10-21 22:01:20,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 974 states.
[2020-10-21 22:01:20,236 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-21 22:01:20,236 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:20,237 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-21 22:01:20,237 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:20,243 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:20,244 INFO  L82        PathProgramCache]: Analyzing trace with hash 1090369, now seen corresponding path program 1 times
[2020-10-21 22:01:20,254 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:20,255 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102135261]
[2020-10-21 22:01:20,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:20,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:20,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:20,518 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102135261]
[2020-10-21 22:01:20,519 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:20,520 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:01:20,520 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269140879]
[2020-10-21 22:01:20,526 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:01:20,526 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:20,546 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:01:20,546 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:01:20,549 INFO  L87              Difference]: Start difference. First operand 974 states. Second operand 3 states.
[2020-10-21 22:01:20,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:20,652 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-21 22:01:20,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:01:20,654 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-21 22:01:20,655 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:20,689 INFO  L225             Difference]: With dead ends: 812
[2020-10-21 22:01:20,690 INFO  L226             Difference]: Without dead ends: 687
[2020-10-21 22:01:20,694 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:01:20,728 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2020-10-21 22:01:20,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2020-10-21 22:01:20,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 687 states.
[2020-10-21 22:01:20,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions.
[2020-10-21 22:01:20,833 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3
[2020-10-21 22:01:20,834 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:20,834 INFO  L481      AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions.
[2020-10-21 22:01:20,834 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:01:20,834 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions.
[2020-10-21 22:01:20,836 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-21 22:01:20,836 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:20,836 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:20,837 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-21 22:01:20,837 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:20,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:20,837 INFO  L82        PathProgramCache]: Analyzing trace with hash -369742601, now seen corresponding path program 1 times
[2020-10-21 22:01:20,838 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:20,838 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813109165]
[2020-10-21 22:01:20,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:20,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,043 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813109165]
[2020-10-21 22:01:21,043 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,044 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:21,044 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836167749]
[2020-10-21 22:01:21,045 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:21,046 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,046 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:21,046 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:21,047 INFO  L87              Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states.
[2020-10-21 22:01:21,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,136 INFO  L93              Difference]: Finished difference Result 802 states and 2417 transitions.
[2020-10-21 22:01:21,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:21,138 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-21 22:01:21,138 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,148 INFO  L225             Difference]: With dead ends: 802
[2020-10-21 22:01:21,149 INFO  L226             Difference]: Without dead ends: 677
[2020-10-21 22:01:21,150 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,154 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 677 states.
[2020-10-21 22:01:21,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677.
[2020-10-21 22:01:21,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 677 states.
[2020-10-21 22:01:21,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions.
[2020-10-21 22:01:21,187 INFO  L78                 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10
[2020-10-21 22:01:21,188 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,189 INFO  L481      AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions.
[2020-10-21 22:01:21,189 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:21,189 INFO  L276                IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions.
[2020-10-21 22:01:21,193 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:01:21,193 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,194 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,194 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-21 22:01:21,194 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,194 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,195 INFO  L82        PathProgramCache]: Analyzing trace with hash -403301390, now seen corresponding path program 1 times
[2020-10-21 22:01:21,195 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,196 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212187570]
[2020-10-21 22:01:21,196 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,387 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212187570]
[2020-10-21 22:01:21,387 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,387 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:21,387 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798859274]
[2020-10-21 22:01:21,387 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:21,388 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,388 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:21,388 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:21,388 INFO  L87              Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states.
[2020-10-21 22:01:21,419 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,419 INFO  L93              Difference]: Finished difference Result 749 states and 2250 transitions.
[2020-10-21 22:01:21,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:21,419 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-21 22:01:21,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,424 INFO  L225             Difference]: With dead ends: 749
[2020-10-21 22:01:21,425 INFO  L226             Difference]: Without dead ends: 629
[2020-10-21 22:01:21,425 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,428 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 629 states.
[2020-10-21 22:01:21,444 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629.
[2020-10-21 22:01:21,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 629 states.
[2020-10-21 22:01:21,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions.
[2020-10-21 22:01:21,448 INFO  L78                 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11
[2020-10-21 22:01:21,448 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,448 INFO  L481      AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions.
[2020-10-21 22:01:21,448 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:21,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions.
[2020-10-21 22:01:21,450 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:01:21,450 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,450 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,451 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-21 22:01:21,451 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,451 INFO  L82        PathProgramCache]: Analyzing trace with hash 382555853, now seen corresponding path program 1 times
[2020-10-21 22:01:21,451 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,452 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75613111]
[2020-10-21 22:01:21,452 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,576 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75613111]
[2020-10-21 22:01:21,576 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,576 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:21,577 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266790862]
[2020-10-21 22:01:21,577 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:21,577 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,577 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:21,578 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:21,578 INFO  L87              Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 4 states.
[2020-10-21 22:01:21,607 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,607 INFO  L93              Difference]: Finished difference Result 701 states and 2098 transitions.
[2020-10-21 22:01:21,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:21,608 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-21 22:01:21,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,613 INFO  L225             Difference]: With dead ends: 701
[2020-10-21 22:01:21,613 INFO  L226             Difference]: Without dead ends: 621
[2020-10-21 22:01:21,613 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 621 states.
[2020-10-21 22:01:21,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621.
[2020-10-21 22:01:21,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 621 states.
[2020-10-21 22:01:21,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions.
[2020-10-21 22:01:21,635 INFO  L78                 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 12
[2020-10-21 22:01:21,635 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,635 INFO  L481      AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions.
[2020-10-21 22:01:21,635 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:21,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions.
[2020-10-21 22:01:21,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:01:21,637 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,637 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,637 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-21 22:01:21,637 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,638 INFO  L82        PathProgramCache]: Analyzing trace with hash 1159558494, now seen corresponding path program 1 times
[2020-10-21 22:01:21,638 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,638 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968983263]
[2020-10-21 22:01:21,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,708 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968983263]
[2020-10-21 22:01:21,708 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,709 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:21,709 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369659118]
[2020-10-21 22:01:21,709 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:21,709 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,710 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:21,710 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,710 INFO  L87              Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 5 states.
[2020-10-21 22:01:21,767 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,768 INFO  L93              Difference]: Finished difference Result 829 states and 2510 transitions.
[2020-10-21 22:01:21,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:21,768 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:01:21,769 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,772 INFO  L225             Difference]: With dead ends: 829
[2020-10-21 22:01:21,772 INFO  L226             Difference]: Without dead ends: 437
[2020-10-21 22:01:21,773 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:21,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2020-10-21 22:01:21,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437.
[2020-10-21 22:01:21,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 437 states.
[2020-10-21 22:01:21,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions.
[2020-10-21 22:01:21,786 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12
[2020-10-21 22:01:21,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,787 INFO  L481      AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions.
[2020-10-21 22:01:21,787 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:21,787 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions.
[2020-10-21 22:01:21,788 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:01:21,788 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,788 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,788 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-21 22:01:21,788 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,789 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,789 INFO  L82        PathProgramCache]: Analyzing trace with hash 1591368352, now seen corresponding path program 1 times
[2020-10-21 22:01:21,789 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,789 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621273369]
[2020-10-21 22:01:21,789 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,886 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621273369]
[2020-10-21 22:01:21,886 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,887 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:21,887 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750789784]
[2020-10-21 22:01:21,887 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:21,888 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,888 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:21,888 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:21,888 INFO  L87              Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 4 states.
[2020-10-21 22:01:21,969 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,969 INFO  L93              Difference]: Finished difference Result 491 states and 1384 transitions.
[2020-10-21 22:01:21,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:21,970 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-21 22:01:21,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,974 INFO  L225             Difference]: With dead ends: 491
[2020-10-21 22:01:21,974 INFO  L226             Difference]: Without dead ends: 431
[2020-10-21 22:01:21,974 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2020-10-21 22:01:21,986 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431.
[2020-10-21 22:01:21,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 431 states.
[2020-10-21 22:01:21,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions.
[2020-10-21 22:01:21,988 INFO  L78                 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13
[2020-10-21 22:01:21,988 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,989 INFO  L481      AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions.
[2020-10-21 22:01:21,989 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:21,989 INFO  L276                IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions.
[2020-10-21 22:01:21,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:21,990 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,990 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,990 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-21 22:01:21,990 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,991 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,991 INFO  L82        PathProgramCache]: Analyzing trace with hash -1726102075, now seen corresponding path program 1 times
[2020-10-21 22:01:21,991 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,991 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548170148]
[2020-10-21 22:01:21,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:22,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:22,138 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548170148]
[2020-10-21 22:01:22,138 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:22,139 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:22,139 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271632496]
[2020-10-21 22:01:22,139 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:22,139 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:22,140 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:22,140 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:22,140 INFO  L87              Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states.
[2020-10-21 22:01:22,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:22,302 INFO  L93              Difference]: Finished difference Result 511 states and 1448 transitions.
[2020-10-21 22:01:22,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:22,303 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:01:22,303 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:22,308 INFO  L225             Difference]: With dead ends: 511
[2020-10-21 22:01:22,308 INFO  L226             Difference]: Without dead ends: 459
[2020-10-21 22:01:22,308 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:22,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2020-10-21 22:01:22,324 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459.
[2020-10-21 22:01:22,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 459 states.
[2020-10-21 22:01:22,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1328 transitions.
[2020-10-21 22:01:22,326 INFO  L78                 Accepts]: Start accepts. Automaton has 459 states and 1328 transitions. Word has length 14
[2020-10-21 22:01:22,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:22,327 INFO  L481      AbstractCegarLoop]: Abstraction has 459 states and 1328 transitions.
[2020-10-21 22:01:22,327 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:22,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 459 states and 1328 transitions.
[2020-10-21 22:01:22,328 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:22,328 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:22,328 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:22,328 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-21 22:01:22,328 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:22,329 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:22,329 INFO  L82        PathProgramCache]: Analyzing trace with hash 2087735349, now seen corresponding path program 1 times
[2020-10-21 22:01:22,329 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:22,329 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676501885]
[2020-10-21 22:01:22,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:22,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:22,402 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676501885]
[2020-10-21 22:01:22,402 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:22,402 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:22,402 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795505769]
[2020-10-21 22:01:22,403 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:22,403 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:22,403 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:22,403 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:22,404 INFO  L87              Difference]: Start difference. First operand 459 states and 1328 transitions. Second operand 5 states.
[2020-10-21 22:01:22,505 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:22,505 INFO  L93              Difference]: Finished difference Result 511 states and 1449 transitions.
[2020-10-21 22:01:22,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:22,506 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-21 22:01:22,507 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:22,510 INFO  L225             Difference]: With dead ends: 511
[2020-10-21 22:01:22,510 INFO  L226             Difference]: Without dead ends: 466
[2020-10-21 22:01:22,511 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:22,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 466 states.
[2020-10-21 22:01:22,523 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462.
[2020-10-21 22:01:22,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 462 states.
[2020-10-21 22:01:22,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1336 transitions.
[2020-10-21 22:01:22,527 INFO  L78                 Accepts]: Start accepts. Automaton has 462 states and 1336 transitions. Word has length 14
[2020-10-21 22:01:22,527 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:22,527 INFO  L481      AbstractCegarLoop]: Abstraction has 462 states and 1336 transitions.
[2020-10-21 22:01:22,527 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:22,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 462 states and 1336 transitions.
[2020-10-21 22:01:22,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:22,529 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:22,529 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:22,529 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-21 22:01:22,530 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:22,530 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:22,530 INFO  L82        PathProgramCache]: Analyzing trace with hash 1733371513, now seen corresponding path program 2 times
[2020-10-21 22:01:22,530 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:22,531 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189575867]
[2020-10-21 22:01:22,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:22,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:22,628 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189575867]
[2020-10-21 22:01:22,629 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:22,629 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:22,629 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976243213]
[2020-10-21 22:01:22,630 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:22,630 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:22,630 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:22,630 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:22,631 INFO  L87              Difference]: Start difference. First operand 462 states and 1336 transitions. Second operand 6 states.
[2020-10-21 22:01:22,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:22,877 INFO  L93              Difference]: Finished difference Result 553 states and 1573 transitions.
[2020-10-21 22:01:22,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-21 22:01:22,878 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:01:22,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:22,882 INFO  L225             Difference]: With dead ends: 553
[2020-10-21 22:01:22,882 INFO  L226             Difference]: Without dead ends: 492
[2020-10-21 22:01:22,883 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:22,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2020-10-21 22:01:22,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485.
[2020-10-21 22:01:22,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 485 states.
[2020-10-21 22:01:22,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions.
[2020-10-21 22:01:22,900 INFO  L78                 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 14
[2020-10-21 22:01:22,901 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:22,901 INFO  L481      AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions.
[2020-10-21 22:01:22,901 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:22,901 INFO  L276                IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions.
[2020-10-21 22:01:22,902 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:01:22,902 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:22,903 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:22,903 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-21 22:01:22,903 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:22,903 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:22,904 INFO  L82        PathProgramCache]: Analyzing trace with hash -1970989686, now seen corresponding path program 1 times
[2020-10-21 22:01:22,904 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:22,904 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816593957]
[2020-10-21 22:01:22,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:23,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:23,098 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816593957]
[2020-10-21 22:01:23,099 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:23,099 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:23,099 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782733097]
[2020-10-21 22:01:23,099 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:01:23,100 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:23,100 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:01:23,100 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:23,100 INFO  L87              Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 7 states.
[2020-10-21 22:01:23,191 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:23,192 INFO  L93              Difference]: Finished difference Result 509 states and 1432 transitions.
[2020-10-21 22:01:23,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:23,192 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-10-21 22:01:23,192 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:23,196 INFO  L225             Difference]: With dead ends: 509
[2020-10-21 22:01:23,196 INFO  L226             Difference]: Without dead ends: 477
[2020-10-21 22:01:23,196 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:23,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 477 states.
[2020-10-21 22:01:23,207 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477.
[2020-10-21 22:01:23,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 477 states.
[2020-10-21 22:01:23,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions.
[2020-10-21 22:01:23,209 INFO  L78                 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15
[2020-10-21 22:01:23,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:23,209 INFO  L481      AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions.
[2020-10-21 22:01:23,209 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:01:23,209 INFO  L276                IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions.
[2020-10-21 22:01:23,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:23,211 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:23,211 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:23,211 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-21 22:01:23,211 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:23,211 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:23,211 INFO  L82        PathProgramCache]: Analyzing trace with hash -971181429, now seen corresponding path program 1 times
[2020-10-21 22:01:23,212 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:23,212 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151011]
[2020-10-21 22:01:23,212 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:23,232 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:23,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:23,298 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151011]
[2020-10-21 22:01:23,298 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:23,298 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:23,298 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427649954]
[2020-10-21 22:01:23,299 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:23,299 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:23,299 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:23,299 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:23,300 INFO  L87              Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 6 states.
[2020-10-21 22:01:23,443 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:23,444 INFO  L93              Difference]: Finished difference Result 570 states and 1620 transitions.
[2020-10-21 22:01:23,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:23,445 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-21 22:01:23,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:23,450 INFO  L225             Difference]: With dead ends: 570
[2020-10-21 22:01:23,450 INFO  L226             Difference]: Without dead ends: 540
[2020-10-21 22:01:23,450 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:23,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 540 states.
[2020-10-21 22:01:23,465 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 475.
[2020-10-21 22:01:23,465 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 475 states.
[2020-10-21 22:01:23,468 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1357 transitions.
[2020-10-21 22:01:23,468 INFO  L78                 Accepts]: Start accepts. Automaton has 475 states and 1357 transitions. Word has length 16
[2020-10-21 22:01:23,468 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:23,468 INFO  L481      AbstractCegarLoop]: Abstraction has 475 states and 1357 transitions.
[2020-10-21 22:01:23,468 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:23,468 INFO  L276                IsEmpty]: Start isEmpty. Operand 475 states and 1357 transitions.
[2020-10-21 22:01:23,469 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:23,470 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:23,470 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:23,470 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-21 22:01:23,470 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:23,470 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:23,470 INFO  L82        PathProgramCache]: Analyzing trace with hash -928109409, now seen corresponding path program 2 times
[2020-10-21 22:01:23,471 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:23,471 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623472873]
[2020-10-21 22:01:23,471 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:23,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:23,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:23,588 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623472873]
[2020-10-21 22:01:23,588 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:23,589 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:23,589 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244533760]
[2020-10-21 22:01:23,589 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:01:23,590 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:23,590 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:01:23,590 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:23,590 INFO  L87              Difference]: Start difference. First operand 475 states and 1357 transitions. Second operand 7 states.
[2020-10-21 22:01:23,741 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:23,741 INFO  L93              Difference]: Finished difference Result 531 states and 1489 transitions.
[2020-10-21 22:01:23,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:23,742 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2020-10-21 22:01:23,742 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:23,746 INFO  L225             Difference]: With dead ends: 531
[2020-10-21 22:01:23,746 INFO  L226             Difference]: Without dead ends: 497
[2020-10-21 22:01:23,746 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:23,748 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 497 states.
[2020-10-21 22:01:23,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 443.
[2020-10-21 22:01:23,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 443 states.
[2020-10-21 22:01:23,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1253 transitions.
[2020-10-21 22:01:23,759 INFO  L78                 Accepts]: Start accepts. Automaton has 443 states and 1253 transitions. Word has length 16
[2020-10-21 22:01:23,759 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:23,759 INFO  L481      AbstractCegarLoop]: Abstraction has 443 states and 1253 transitions.
[2020-10-21 22:01:23,760 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:01:23,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 443 states and 1253 transitions.
[2020-10-21 22:01:23,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:23,761 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:23,761 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:23,761 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-21 22:01:23,761 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:23,761 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:23,762 INFO  L82        PathProgramCache]: Analyzing trace with hash -928102682, now seen corresponding path program 1 times
[2020-10-21 22:01:23,762 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:23,762 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616567357]
[2020-10-21 22:01:23,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:23,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:23,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:23,962 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616567357]
[2020-10-21 22:01:23,963 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:23,963 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:23,963 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843117629]
[2020-10-21 22:01:23,963 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:01:23,963 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:23,964 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:01:23,964 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:23,964 INFO  L87              Difference]: Start difference. First operand 443 states and 1253 transitions. Second operand 7 states.
[2020-10-21 22:01:24,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:24,213 INFO  L93              Difference]: Finished difference Result 599 states and 1633 transitions.
[2020-10-21 22:01:24,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-21 22:01:24,214 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2020-10-21 22:01:24,214 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:24,218 INFO  L225             Difference]: With dead ends: 599
[2020-10-21 22:01:24,218 INFO  L226             Difference]: Without dead ends: 519
[2020-10-21 22:01:24,219 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2020-10-21 22:01:24,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 519 states.
[2020-10-21 22:01:24,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 447.
[2020-10-21 22:01:24,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 447 states.
[2020-10-21 22:01:24,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1245 transitions.
[2020-10-21 22:01:24,233 INFO  L78                 Accepts]: Start accepts. Automaton has 447 states and 1245 transitions. Word has length 16
[2020-10-21 22:01:24,234 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:24,234 INFO  L481      AbstractCegarLoop]: Abstraction has 447 states and 1245 transitions.
[2020-10-21 22:01:24,234 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:01:24,234 INFO  L276                IsEmpty]: Start isEmpty. Operand 447 states and 1245 transitions.
[2020-10-21 22:01:24,235 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:24,235 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:24,235 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:24,236 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-21 22:01:24,236 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:24,236 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:24,236 INFO  L82        PathProgramCache]: Analyzing trace with hash -928533210, now seen corresponding path program 1 times
[2020-10-21 22:01:24,236 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:24,237 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471129377]
[2020-10-21 22:01:24,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:24,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:24,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:24,329 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471129377]
[2020-10-21 22:01:24,329 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:24,330 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:24,330 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570876708]
[2020-10-21 22:01:24,330 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:24,330 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:24,331 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:24,331 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:24,331 INFO  L87              Difference]: Start difference. First operand 447 states and 1245 transitions. Second operand 6 states.
[2020-10-21 22:01:24,375 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:24,375 INFO  L93              Difference]: Finished difference Result 715 states and 1958 transitions.
[2020-10-21 22:01:24,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:24,376 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-21 22:01:24,376 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:24,379 INFO  L225             Difference]: With dead ends: 715
[2020-10-21 22:01:24,379 INFO  L226             Difference]: Without dead ends: 403
[2020-10-21 22:01:24,379 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:24,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 403 states.
[2020-10-21 22:01:24,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379.
[2020-10-21 22:01:24,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 379 states.
[2020-10-21 22:01:24,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 982 transitions.
[2020-10-21 22:01:24,390 INFO  L78                 Accepts]: Start accepts. Automaton has 379 states and 982 transitions. Word has length 16
[2020-10-21 22:01:24,390 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:24,390 INFO  L481      AbstractCegarLoop]: Abstraction has 379 states and 982 transitions.
[2020-10-21 22:01:24,390 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:24,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 379 states and 982 transitions.
[2020-10-21 22:01:24,391 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:24,391 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:24,391 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:24,391 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-21 22:01:24,392 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:24,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:24,392 INFO  L82        PathProgramCache]: Analyzing trace with hash -1171739132, now seen corresponding path program 2 times
[2020-10-21 22:01:24,392 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:24,392 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979536544]
[2020-10-21 22:01:24,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:24,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:24,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:24,443 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979536544]
[2020-10-21 22:01:24,443 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:24,443 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:24,443 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752559511]
[2020-10-21 22:01:24,444 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:24,444 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:24,444 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:24,444 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:24,444 INFO  L87              Difference]: Start difference. First operand 379 states and 982 transitions. Second operand 4 states.
[2020-10-21 22:01:24,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:24,475 INFO  L93              Difference]: Finished difference Result 372 states and 855 transitions.
[2020-10-21 22:01:24,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:24,475 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-21 22:01:24,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:24,477 INFO  L225             Difference]: With dead ends: 372
[2020-10-21 22:01:24,478 INFO  L226             Difference]: Without dead ends: 285
[2020-10-21 22:01:24,478 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:24,479 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 285 states.
[2020-10-21 22:01:24,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285.
[2020-10-21 22:01:24,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 285 states.
[2020-10-21 22:01:24,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 650 transitions.
[2020-10-21 22:01:24,485 INFO  L78                 Accepts]: Start accepts. Automaton has 285 states and 650 transitions. Word has length 16
[2020-10-21 22:01:24,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:24,485 INFO  L481      AbstractCegarLoop]: Abstraction has 285 states and 650 transitions.
[2020-10-21 22:01:24,485 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:24,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 285 states and 650 transitions.
[2020-10-21 22:01:24,486 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-21 22:01:24,486 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:24,486 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:24,487 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-21 22:01:24,487 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:24,487 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:24,487 INFO  L82        PathProgramCache]: Analyzing trace with hash 1009884994, now seen corresponding path program 1 times
[2020-10-21 22:01:24,487 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:24,488 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840560451]
[2020-10-21 22:01:24,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:24,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:24,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:24,541 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840560451]
[2020-10-21 22:01:24,542 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:24,542 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:24,542 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154192155]
[2020-10-21 22:01:24,542 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:24,543 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:24,543 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:24,543 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:24,543 INFO  L87              Difference]: Start difference. First operand 285 states and 650 transitions. Second operand 5 states.
[2020-10-21 22:01:24,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:24,586 INFO  L93              Difference]: Finished difference Result 233 states and 474 transitions.
[2020-10-21 22:01:24,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:24,587 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-21 22:01:24,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:24,588 INFO  L225             Difference]: With dead ends: 233
[2020-10-21 22:01:24,588 INFO  L226             Difference]: Without dead ends: 185
[2020-10-21 22:01:24,589 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:24,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2020-10-21 22:01:24,593 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185.
[2020-10-21 22:01:24,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2020-10-21 22:01:24,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions.
[2020-10-21 22:01:24,594 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 17
[2020-10-21 22:01:24,594 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:24,594 INFO  L481      AbstractCegarLoop]: Abstraction has 185 states and 368 transitions.
[2020-10-21 22:01:24,594 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:24,595 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions.
[2020-10-21 22:01:24,595 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:01:24,595 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:24,595 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-21 22:01:24,596 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-21 22:01:24,596 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:24,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:24,596 INFO  L82        PathProgramCache]: Analyzing trace with hash 461994248, now seen corresponding path program 1 times
[2020-10-21 22:01:24,596 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:24,597 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514800404]
[2020-10-21 22:01:24,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:24,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:24,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:24,981 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514800404]
[2020-10-21 22:01:24,981 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:24,981 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-21 22:01:24,981 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689788837]
[2020-10-21 22:01:24,982 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-21 22:01:24,982 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:24,982 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-21 22:01:24,982 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:24,983 INFO  L87              Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 9 states.
[2020-10-21 22:01:25,213 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:25,214 INFO  L93              Difference]: Finished difference Result 211 states and 405 transitions.
[2020-10-21 22:01:25,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:25,217 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2020-10-21 22:01:25,218 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:25,219 INFO  L225             Difference]: With dead ends: 211
[2020-10-21 22:01:25,219 INFO  L226             Difference]: Without dead ends: 145
[2020-10-21 22:01:25,219 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132
[2020-10-21 22:01:25,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2020-10-21 22:01:25,222 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131.
[2020-10-21 22:01:25,222 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2020-10-21 22:01:25,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions.
[2020-10-21 22:01:25,223 INFO  L78                 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19
[2020-10-21 22:01:25,223 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:25,223 INFO  L481      AbstractCegarLoop]: Abstraction has 131 states and 262 transitions.
[2020-10-21 22:01:25,223 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-21 22:01:25,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions.
[2020-10-21 22:01:25,224 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:01:25,224 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:25,224 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-21 22:01:25,224 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-21 22:01:25,225 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:25,225 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:25,225 INFO  L82        PathProgramCache]: Analyzing trace with hash -660289219, now seen corresponding path program 1 times
[2020-10-21 22:01:25,225 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:25,225 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480658741]
[2020-10-21 22:01:25,225 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:25,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:25,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:25,297 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480658741]
[2020-10-21 22:01:25,298 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:25,298 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:25,298 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136938089]
[2020-10-21 22:01:25,298 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:25,299 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:25,299 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:25,299 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:25,299 INFO  L87              Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states.
[2020-10-21 22:01:25,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:25,348 INFO  L93              Difference]: Finished difference Result 112 states and 223 transitions.
[2020-10-21 22:01:25,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:25,349 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-21 22:01:25,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:25,350 INFO  L225             Difference]: With dead ends: 112
[2020-10-21 22:01:25,350 INFO  L226             Difference]: Without dead ends: 63
[2020-10-21 22:01:25,350 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:25,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-10-21 22:01:25,352 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-10-21 22:01:25,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2020-10-21 22:01:25,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions.
[2020-10-21 22:01:25,353 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19
[2020-10-21 22:01:25,353 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:25,353 INFO  L481      AbstractCegarLoop]: Abstraction has 63 states and 110 transitions.
[2020-10-21 22:01:25,353 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:25,353 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions.
[2020-10-21 22:01:25,354 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-21 22:01:25,354 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:25,354 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]
[2020-10-21 22:01:25,354 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-21 22:01:25,354 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:25,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:25,354 INFO  L82        PathProgramCache]: Analyzing trace with hash -2015795615, now seen corresponding path program 1 times
[2020-10-21 22:01:25,355 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:25,355 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041726078]
[2020-10-21 22:01:25,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:25,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:25,393 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:25,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:25,437 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:25,472 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-21 22:01:25,472 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-21 22:01:25,472 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-21 22:01:25,492 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,493 WARN  L224     RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740]
[2020-10-21 22:01:25,495 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,496 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,496 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,496 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,496 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,496 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,497 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,497 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,497 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,497 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,497 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,497 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,498 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,498 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,499 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,499 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,499 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,499 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,499 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,500 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,500 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,500 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,500 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,501 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,501 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,501 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,501 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,501 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,501 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,502 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,502 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,502 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,502 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,502 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,503 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,503 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,503 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,504 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,504 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,504 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,504 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,504 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,504 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,504 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,505 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,505 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,505 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,505 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,506 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,506 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,506 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,506 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,506 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,506 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,507 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,507 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,507 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,507 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,507 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,507 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,507 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,508 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,508 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:25,508 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:25,577 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:01:25 BasicIcfg
[2020-10-21 22:01:25,577 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-21 22:01:25,579 INFO  L168              Benchmark]: Toolchain (without parser) took 15463.91 ms. Allocated memory was 139.5 MB in the beginning and 455.1 MB in the end (delta: 315.6 MB). Free memory was 100.4 MB in the beginning and 293.5 MB in the end (delta: -193.2 MB). Peak memory consumption was 122.5 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,580 INFO  L168              Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,581 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 777.97 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 153.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,582 INFO  L168              Benchmark]: Boogie Procedure Inliner took 75.32 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,582 INFO  L168              Benchmark]: Boogie Preprocessor took 60.64 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 147.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,583 INFO  L168              Benchmark]: RCFGBuilder took 2295.87 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 147.6 MB in the beginning and 160.0 MB in the end (delta: -12.4 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,584 INFO  L168              Benchmark]: TraceAbstraction took 12236.61 ms. Allocated memory was 248.0 MB in the beginning and 455.1 MB in the end (delta: 207.1 MB). Free memory was 158.0 MB in the beginning and 293.5 MB in the end (delta: -135.6 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:25,587 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.5 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 777.97 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 153.4 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 75.32 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 60.64 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 147.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2295.87 ms. Allocated memory was 202.9 MB in the beginning and 248.0 MB in the end (delta: 45.1 MB). Free memory was 147.6 MB in the beginning and 160.0 MB in the end (delta: -12.4 MB). Peak memory consumption was 101.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 12236.61 ms. Allocated memory was 248.0 MB in the beginning and 455.1 MB in the end (delta: 207.1 MB). Free memory was 158.0 MB in the beginning and 293.5 MB in the end (delta: -135.6 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1325 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 170 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.6s, 108 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 4899 MoverChecksTotal
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L712]               0  _Bool main$tmp_guard0;
[L713]               0  _Bool main$tmp_guard1;
[L715]               0  int x = 0;
[L717]               0  int y = 0;
[L719]               0  int z = 0;
[L720]               0  _Bool z$flush_delayed;
[L721]               0  int z$mem_tmp;
[L722]               0  _Bool z$r_buff0_thd0;
[L723]               0  _Bool z$r_buff0_thd1;
[L724]               0  _Bool z$r_buff0_thd2;
[L725]               0  _Bool z$r_buff0_thd3;
[L726]               0  _Bool z$r_buff1_thd0;
[L727]               0  _Bool z$r_buff1_thd1;
[L728]               0  _Bool z$r_buff1_thd2;
[L729]               0  _Bool z$r_buff1_thd3;
[L730]               0  _Bool z$read_delayed;
[L731]               0  int *z$read_delayed_var;
[L732]               0  int z$w_buff0;
[L733]               0  _Bool z$w_buff0_used;
[L734]               0  int z$w_buff1;
[L735]               0  _Bool z$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L818]               0  pthread_t t2037;
[L819]  FCALL, FORK  0  pthread_create(&t2037, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L741]               1  z$w_buff1 = z$w_buff0
[L742]               1  z$w_buff0 = 2
[L743]               1  z$w_buff1_used = z$w_buff0_used
[L744]               1  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L746]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L747]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L748]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L749]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L750]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L820]               0  pthread_t t2038;
[L821]  FCALL, FORK  0  pthread_create(&t2038, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L822]               0  pthread_t t2039;
[L823]  FCALL, FORK  0  pthread_create(&t2039, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L753]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L770]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L777]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L777]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L778]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L778]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L779]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L779]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L780]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L780]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L790]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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]
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L785]               2  return 0;
[L793]               3  z = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L756]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L757]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L758]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L758]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L759]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L759]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L760]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L760]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L765]               1  return 0;
[L796]  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)
[L796]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L796]  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)
[L796]               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)
[L797]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L797]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L798]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L798]               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
[L799]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L799]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L800]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L800]               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
[L803]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L805]               3  return 0;
[L825]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L829]  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)
[L829]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L829]  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)
[L829]               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)
[L830]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L830]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L831]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L831]               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
[L832]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L832]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L833]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L833]               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
[L836]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L837]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L838]               0  z$flush_delayed = weak$$choice2
[L839]               0  z$mem_tmp = z
[L840]  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)
[L840]               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)
[L841]  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))
[L841]               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))
[L842]  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))
[L842]  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)
[L842]  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))
[L842]               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))
[L843]  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))
[L843]               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))
[L844]  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))
[L844]               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))
[L845]  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))
[L845]               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))
[L846]  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))
[L846]               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))
[L847]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L848]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L848]               0  z = z$flush_delayed ? z$mem_tmp : z
[L849]               0  z$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L17]   COND FALSE   0  !(0)
[L17]                0  __assert_fail ("0", "safe011_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 484 SDtfs, 597 SDslu, 975 SDs, 0 SdLazy, 559 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 240 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 34277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...