/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:03:37,949 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:03:37,951 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:03:37,976 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:03:37,976 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:03:37,978 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:03:37,979 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:03:37,980 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:03:37,982 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:03:37,983 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:03:37,984 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:03:37,985 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:03:37,985 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:03:37,986 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:03:37,987 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:03:37,988 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:03:37,989 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:03:37,990 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:03:37,991 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:03:37,993 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:03:37,994 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:03:37,995 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:03:37,996 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:03:37,997 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:03:37,999 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:03:38,000 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:03:38,000 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:03:38,001 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:03:38,001 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:03:38,002 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:03:38,002 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:03:38,003 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:03:38,004 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:03:38,004 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:03:38,005 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:03:38,005 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:03:38,006 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:03:38,006 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:03:38,007 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:03:38,007 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:03:38,008 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:03:38,009 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 13:03:38,056 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:03:38,056 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:03:38,059 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:03:38,060 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:03:38,060 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:03:38,060 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:03:38,060 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:03:38,060 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:03:38,061 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:03:38,061 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:03:38,061 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:03:38,061 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:03:38,061 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:03:38,062 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:03:38,062 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:03:38,063 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:03:38,064 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:03:38,064 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:03:38,064 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:03:38,064 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:03:38,065 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:03:38,065 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:03:38,065 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:03:38,065 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:03:38,066 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:03:38,067 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:03:38,389 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:03:38,400 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:03:38,403 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:03:38,405 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:03:38,405 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:03:38,406 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i
[2020-10-16 13:03:38,471 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/99d812a82/a58033356b8b4e439ae46f342c48e9cd/FLAG1a6f20a61
[2020-10-16 13:03:39,011 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:03:39,012 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i
[2020-10-16 13:03:39,030 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/99d812a82/a58033356b8b4e439ae46f342c48e9cd/FLAG1a6f20a61
[2020-10-16 13:03:39,293 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/99d812a82/a58033356b8b4e439ae46f342c48e9cd
[2020-10-16 13:03:39,303 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:03:39,305 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:03:39,306 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:03:39,307 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:03:39,310 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:03:39,311 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:03:39" (1/1) ...
[2020-10-16 13:03:39,314 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120f1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:39, skipping insertion in model container
[2020-10-16 13:03:39,314 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:03:39" (1/1) ...
[2020-10-16 13:03:39,322 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:03:39,392 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:03:39,936 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:03:39,952 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:03:40,044 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:03:40,118 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:03:40,118 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40 WrapperNode
[2020-10-16 13:03:40,119 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:03:40,119 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:03:40,120 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:03:40,120 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:03:40,129 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,149 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,188 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:03:40,188 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:03:40,188 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:03:40,188 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:03:40,199 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,199 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,206 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,206 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,220 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,225 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,229 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
[2020-10-16 13:03:40,234 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:03:40,234 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:03:40,234 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:03:40,235 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:03:40,235 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:03:40,306 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:03:40,306 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:03:40,306 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:03:40,306 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:03:40,307 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:03:40,307 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:03:40,307 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:03:40,307 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:03:40,307 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:03:40,308 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:03:40,308 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:03:40,308 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:03:40,308 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:03:40,310 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 13:03:42,332 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:03:42,332 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:03:42,334 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:03:42 BoogieIcfgContainer
[2020-10-16 13:03:42,334 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:03:42,336 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:03:42,336 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:03:42,339 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:03:42,340 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:03:39" (1/3) ...
[2020-10-16 13:03:42,341 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3b6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:03:42, skipping insertion in model container
[2020-10-16 13:03:42,341 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:03:40" (2/3) ...
[2020-10-16 13:03:42,341 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3b6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:03:42, skipping insertion in model container
[2020-10-16 13:03:42,341 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:03:42" (3/3) ...
[2020-10-16 13:03:42,343 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i
[2020-10-16 13:03:42,355 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:03:42,355 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:03:42,363 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:03:42,364 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:03:42,393 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,394 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,394 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,394 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,395 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,395 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,395 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,395 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,395 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,396 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,396 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,396 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,397 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,397 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,397 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,397 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,398 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,398 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,398 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,398 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,399 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,399 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,399 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,399 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,399 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,400 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,400 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,400 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,400 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,401 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,401 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,401 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,401 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,402 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,402 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,402 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,402 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,402 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,403 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,403 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,403 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,404 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,407 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,408 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,408 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,408 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,408 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,409 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,409 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,412 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,413 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,413 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,413 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,415 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,415 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,415 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,416 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,417 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:03:42,419 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:03:42,433 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 13:03:42,454 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:03:42,454 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:03:42,454 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:03:42,454 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:03:42,455 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:03:42,455 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:03:42,455 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:03:42,455 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:03:42,468 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:03:42,469 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-16 13:03:42,472 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-16 13:03:42,474 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow
[2020-10-16 13:03:42,520 INFO  L129       PetriNetUnfolder]: 2/91 cut-off events.
[2020-10-16 13:03:42,521 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:03:42,526 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-16 13:03:42,529 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1724
[2020-10-16 13:03:43,977 WARN  L193               SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 228 DAG size of output: 187
[2020-10-16 13:03:44,012 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2020-10-16 13:03:44,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 13:03:44,015 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 13:03:44,015 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 13:03:44,858 WARN  L193               SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124
[2020-10-16 13:03:45,659 WARN  L193               SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 13:03:46,002 WARN  L193               SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-16 13:03:46,679 WARN  L193               SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-16 13:03:47,420 WARN  L193               SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109
[2020-10-16 13:03:47,723 WARN  L193               SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-16 13:03:48,683 WARN  L193               SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132
[2020-10-16 13:03:48,969 WARN  L193               SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-10-16 13:03:49,305 WARN  L193               SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87
[2020-10-16 13:03:49,420 WARN  L193               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 13:03:49,429 INFO  L132        LiptonReduction]: Checked pairs total: 5052
[2020-10-16 13:03:49,430 INFO  L134        LiptonReduction]: Total number of compositions: 77
[2020-10-16 13:03:49,437 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2020-10-16 13:03:49,548 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1152 states.
[2020-10-16 13:03:49,550 INFO  L276                IsEmpty]: Start isEmpty. Operand 1152 states.
[2020-10-16 13:03:49,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:03:49,558 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:49,559 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:03:49,559 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:49,565 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:49,565 INFO  L82        PathProgramCache]: Analyzing trace with hash 1006320439, now seen corresponding path program 1 times
[2020-10-16 13:03:49,587 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:49,588 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853113775]
[2020-10-16 13:03:49,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:49,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:49,806 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:49,807 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853113775]
[2020-10-16 13:03:49,808 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:49,808 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:03:49,809 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999788742]
[2020-10-16 13:03:49,810 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:49,814 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:49,830 INFO  L258    McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:03:49,831 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:49,835 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:49,836 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:03:49,836 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:49,851 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:03:49,852 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:49,854 INFO  L87              Difference]: Start difference. First operand 1152 states. Second operand 3 states.
[2020-10-16 13:03:49,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:49,952 INFO  L93              Difference]: Finished difference Result 962 states and 3090 transitions.
[2020-10-16 13:03:49,953 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:03:49,954 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:03:49,955 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:49,978 INFO  L225             Difference]: With dead ends: 962
[2020-10-16 13:03:49,978 INFO  L226             Difference]: Without dead ends: 662
[2020-10-16 13:03:49,980 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:50,007 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-16 13:03:50,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2020-10-16 13:03:50,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 662 states.
[2020-10-16 13:03:50,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions.
[2020-10-16 13:03:50,082 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5
[2020-10-16 13:03:50,084 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:50,084 INFO  L481      AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions.
[2020-10-16 13:03:50,085 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:03:50,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions.
[2020-10-16 13:03:50,086 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:03:50,086 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:50,086 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:50,087 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:03:50,087 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:50,087 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:50,087 INFO  L82        PathProgramCache]: Analyzing trace with hash 194599318, now seen corresponding path program 1 times
[2020-10-16 13:03:50,093 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:50,093 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171111632]
[2020-10-16 13:03:50,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:50,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:50,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:50,269 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171111632]
[2020-10-16 13:03:50,269 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:50,270 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:03:50,270 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832568923]
[2020-10-16 13:03:50,270 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:50,271 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:50,273 INFO  L258    McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 13:03:50,273 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:50,274 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:50,275 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:03:50,275 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:50,276 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:03:50,276 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:50,276 INFO  L87              Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states.
[2020-10-16 13:03:50,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:50,316 INFO  L93              Difference]: Finished difference Result 657 states and 2041 transitions.
[2020-10-16 13:03:50,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:03:50,317 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 13:03:50,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:50,324 INFO  L225             Difference]: With dead ends: 657
[2020-10-16 13:03:50,324 INFO  L226             Difference]: Without dead ends: 657
[2020-10-16 13:03:50,325 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:50,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 657 states.
[2020-10-16 13:03:50,352 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657.
[2020-10-16 13:03:50,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 657 states.
[2020-10-16 13:03:50,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2041 transitions.
[2020-10-16 13:03:50,357 INFO  L78                 Accepts]: Start accepts. Automaton has 657 states and 2041 transitions. Word has length 9
[2020-10-16 13:03:50,358 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:50,358 INFO  L481      AbstractCegarLoop]: Abstraction has 657 states and 2041 transitions.
[2020-10-16 13:03:50,358 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:03:50,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 657 states and 2041 transitions.
[2020-10-16 13:03:50,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 13:03:50,360 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:50,361 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:50,361 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:03:50,361 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:50,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:50,362 INFO  L82        PathProgramCache]: Analyzing trace with hash 1326295804, now seen corresponding path program 1 times
[2020-10-16 13:03:50,364 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:50,364 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939398535]
[2020-10-16 13:03:50,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:50,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:50,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:50,515 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939398535]
[2020-10-16 13:03:50,515 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:50,515 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:03:50,516 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898030398]
[2020-10-16 13:03:50,516 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:50,518 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:50,520 INFO  L258    McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions.
[2020-10-16 13:03:50,520 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:50,584 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6677#(or (and (= ~__unbuffered_p2_EAX~0 0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:03:50,585 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:03:50,585 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:50,585 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:03:50,586 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:03:50,586 INFO  L87              Difference]: Start difference. First operand 657 states and 2041 transitions. Second operand 6 states.
[2020-10-16 13:03:50,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:50,811 INFO  L93              Difference]: Finished difference Result 861 states and 2709 transitions.
[2020-10-16 13:03:50,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:03:50,812 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 10
[2020-10-16 13:03:50,813 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:50,829 INFO  L225             Difference]: With dead ends: 861
[2020-10-16 13:03:50,829 INFO  L226             Difference]: Without dead ends: 861
[2020-10-16 13:03:50,830 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:03:50,835 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 861 states.
[2020-10-16 13:03:50,882 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 647.
[2020-10-16 13:03:50,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 647 states.
[2020-10-16 13:03:50,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 2001 transitions.
[2020-10-16 13:03:50,887 INFO  L78                 Accepts]: Start accepts. Automaton has 647 states and 2001 transitions. Word has length 10
[2020-10-16 13:03:50,887 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:50,887 INFO  L481      AbstractCegarLoop]: Abstraction has 647 states and 2001 transitions.
[2020-10-16 13:03:50,888 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:03:50,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 647 states and 2001 transitions.
[2020-10-16 13:03:50,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 13:03:50,896 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:50,896 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:50,896 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:03:50,896 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:50,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:50,897 INFO  L82        PathProgramCache]: Analyzing trace with hash -1979990179, now seen corresponding path program 1 times
[2020-10-16 13:03:50,902 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:50,903 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822721879]
[2020-10-16 13:03:50,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:50,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:51,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-16 13:03:51,044 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822721879]
[2020-10-16 13:03:51,044 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:51,044 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:03:51,044 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1846464076]
[2020-10-16 13:03:51,044 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:51,046 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:51,048 INFO  L258    McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions.
[2020-10-16 13:03:51,048 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:51,063 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,065 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:51,065 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,070 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 1] term
[2020-10-16 13:03:51,071 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,080 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,088 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,090 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,105 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,106 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,116 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,119 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,128 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,131 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,139 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,146 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,172 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,173 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:51,173 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,176 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 1] term
[2020-10-16 13:03:51,177 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,181 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,184 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,194 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,200 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,203 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,209 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,213 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,221 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,230 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,233 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,242 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,248 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,255 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:51,256 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:03:51,256 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:51,257 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:03:51,257 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:03:51,257 INFO  L87              Difference]: Start difference. First operand 647 states and 2001 transitions. Second operand 4 states.
[2020-10-16 13:03:51,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:51,309 INFO  L93              Difference]: Finished difference Result 643 states and 1985 transitions.
[2020-10-16 13:03:51,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:03:51,310 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 13:03:51,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:51,316 INFO  L225             Difference]: With dead ends: 643
[2020-10-16 13:03:51,316 INFO  L226             Difference]: Without dead ends: 643
[2020-10-16 13:03:51,317 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:03:51,320 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 643 states.
[2020-10-16 13:03:51,334 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643.
[2020-10-16 13:03:51,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 643 states.
[2020-10-16 13:03:51,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1985 transitions.
[2020-10-16 13:03:51,337 INFO  L78                 Accepts]: Start accepts. Automaton has 643 states and 1985 transitions. Word has length 11
[2020-10-16 13:03:51,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:51,338 INFO  L481      AbstractCegarLoop]: Abstraction has 643 states and 1985 transitions.
[2020-10-16 13:03:51,338 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:03:51,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 643 states and 1985 transitions.
[2020-10-16 13:03:51,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:03:51,340 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:51,340 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:51,340 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:03:51,340 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:51,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:51,341 INFO  L82        PathProgramCache]: Analyzing trace with hash 154406171, now seen corresponding path program 1 times
[2020-10-16 13:03:51,342 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:51,342 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864177553]
[2020-10-16 13:03:51,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:51,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:51,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:51,407 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864177553]
[2020-10-16 13:03:51,407 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:51,408 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:03:51,408 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [981705978]
[2020-10-16 13:03:51,408 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:51,410 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:51,414 INFO  L258    McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions.
[2020-10-16 13:03:51,414 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:51,471 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:51,471 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:03:51,472 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:51,472 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:03:51,472 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:51,472 INFO  L87              Difference]: Start difference. First operand 643 states and 1985 transitions. Second operand 3 states.
[2020-10-16 13:03:51,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:51,485 INFO  L93              Difference]: Finished difference Result 608 states and 1864 transitions.
[2020-10-16 13:03:51,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:03:51,486 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 13:03:51,486 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:51,491 INFO  L225             Difference]: With dead ends: 608
[2020-10-16 13:03:51,491 INFO  L226             Difference]: Without dead ends: 608
[2020-10-16 13:03:51,491 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:03:51,495 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 608 states.
[2020-10-16 13:03:51,508 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608.
[2020-10-16 13:03:51,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 608 states.
[2020-10-16 13:03:51,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1864 transitions.
[2020-10-16 13:03:51,512 INFO  L78                 Accepts]: Start accepts. Automaton has 608 states and 1864 transitions. Word has length 12
[2020-10-16 13:03:51,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:51,512 INFO  L481      AbstractCegarLoop]: Abstraction has 608 states and 1864 transitions.
[2020-10-16 13:03:51,512 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:03:51,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 608 states and 1864 transitions.
[2020-10-16 13:03:51,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:03:51,514 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:51,514 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:51,514 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:03:51,514 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:51,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:51,515 INFO  L82        PathProgramCache]: Analyzing trace with hash -1046393021, now seen corresponding path program 1 times
[2020-10-16 13:03:51,517 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:51,517 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932798086]
[2020-10-16 13:03:51,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:51,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:51,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:51,679 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932798086]
[2020-10-16 13:03:51,679 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:51,679 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:03:51,680 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326967125]
[2020-10-16 13:03:51,680 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:51,682 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:51,688 INFO  L258    McrAutomatonBuilder]: Finished intersection with 24 states and 36 transitions.
[2020-10-16 13:03:51,689 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:51,719 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,723 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,728 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,730 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:51,730 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,731 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,741 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,744 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,747 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,757 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,758 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,820 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,822 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,822 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,824 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:51,825 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,825 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,828 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,830 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,836 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,839 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:51,845 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,863 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,864 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,864 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,872 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,874 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:51,914 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12601#(or (and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:03:51,915 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:03:51,915 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:51,915 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:03:51,915 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:03:51,916 INFO  L87              Difference]: Start difference. First operand 608 states and 1864 transitions. Second operand 5 states.
[2020-10-16 13:03:52,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:52,064 INFO  L93              Difference]: Finished difference Result 764 states and 2350 transitions.
[2020-10-16 13:03:52,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:03:52,065 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 13:03:52,065 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:52,070 INFO  L225             Difference]: With dead ends: 764
[2020-10-16 13:03:52,070 INFO  L226             Difference]: Without dead ends: 764
[2020-10-16 13:03:52,071 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:03:52,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 764 states.
[2020-10-16 13:03:52,093 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 620.
[2020-10-16 13:03:52,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 620 states.
[2020-10-16 13:03:52,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions.
[2020-10-16 13:03:52,097 INFO  L78                 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12
[2020-10-16 13:03:52,097 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:52,097 INFO  L481      AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions.
[2020-10-16 13:03:52,097 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:03:52,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions.
[2020-10-16 13:03:52,098 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:03:52,099 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:52,099 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:52,099 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:03:52,099 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:52,099 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:52,099 INFO  L82        PathProgramCache]: Analyzing trace with hash -100075009, now seen corresponding path program 1 times
[2020-10-16 13:03:52,101 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:52,101 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441447312]
[2020-10-16 13:03:52,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:52,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:52,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:52,207 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441447312]
[2020-10-16 13:03:52,208 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:52,208 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:03:52,208 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513123680]
[2020-10-16 13:03:52,208 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:52,211 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:52,216 INFO  L258    McrAutomatonBuilder]: Finished intersection with 32 states and 53 transitions.
[2020-10-16 13:03:52,216 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:52,225 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,228 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,234 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,241 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,263 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,265 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,270 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,275 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,284 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,319 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,321 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,327 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,332 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,353 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,354 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,359 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,364 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,404 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,405 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,412 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,418 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,430 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:52,430 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:03:52,431 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:52,431 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:03:52,431 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:03:52,431 INFO  L87              Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand 4 states.
[2020-10-16 13:03:52,492 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:52,492 INFO  L93              Difference]: Finished difference Result 630 states and 1925 transitions.
[2020-10-16 13:03:52,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 13:03:52,493 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 13:03:52,494 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:52,498 INFO  L225             Difference]: With dead ends: 630
[2020-10-16 13:03:52,498 INFO  L226             Difference]: Without dead ends: 630
[2020-10-16 13:03:52,499 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:03:52,502 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 630 states.
[2020-10-16 13:03:52,514 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 626.
[2020-10-16 13:03:52,515 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 626 states.
[2020-10-16 13:03:52,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1911 transitions.
[2020-10-16 13:03:52,518 INFO  L78                 Accepts]: Start accepts. Automaton has 626 states and 1911 transitions. Word has length 13
[2020-10-16 13:03:52,518 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:52,518 INFO  L481      AbstractCegarLoop]: Abstraction has 626 states and 1911 transitions.
[2020-10-16 13:03:52,518 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:03:52,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 626 states and 1911 transitions.
[2020-10-16 13:03:52,519 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:03:52,520 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:52,520 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:52,520 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:03:52,520 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:52,520 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:52,520 INFO  L82        PathProgramCache]: Analyzing trace with hash -101683909, now seen corresponding path program 2 times
[2020-10-16 13:03:52,522 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:52,522 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124078707]
[2020-10-16 13:03:52,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:52,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:52,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:52,595 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124078707]
[2020-10-16 13:03:52,596 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:52,596 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:03:52,596 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [32576091]
[2020-10-16 13:03:52,596 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:52,598 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:52,602 INFO  L258    McrAutomatonBuilder]: Finished intersection with 36 states and 61 transitions.
[2020-10-16 13:03:52,602 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:52,608 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:52,608 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,610 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 2, 1] term
[2020-10-16 13:03:52,610 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,611 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 1] term
[2020-10-16 13:03:52,611 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,612 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,613 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,615 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,620 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,626 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,628 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,632 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,654 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:52,654 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,654 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:52,655 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,656 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 1] term
[2020-10-16 13:03:52,656 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,657 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,658 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,665 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,668 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,671 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:52,675 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,678 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,682 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,682 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,685 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,689 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,694 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,695 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:52,749 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:52,750 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:03:52,750 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:52,750 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:03:52,750 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:03:52,751 INFO  L87              Difference]: Start difference. First operand 626 states and 1911 transitions. Second operand 5 states.
[2020-10-16 13:03:52,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:52,835 INFO  L93              Difference]: Finished difference Result 618 states and 1884 transitions.
[2020-10-16 13:03:52,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 13:03:52,836 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 13:03:52,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:52,840 INFO  L225             Difference]: With dead ends: 618
[2020-10-16 13:03:52,840 INFO  L226             Difference]: Without dead ends: 618
[2020-10-16 13:03:52,841 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:03:52,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 618 states.
[2020-10-16 13:03:52,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608.
[2020-10-16 13:03:52,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 608 states.
[2020-10-16 13:03:52,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions.
[2020-10-16 13:03:52,859 INFO  L78                 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13
[2020-10-16 13:03:52,859 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:52,859 INFO  L481      AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions.
[2020-10-16 13:03:52,859 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:03:52,859 INFO  L276                IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions.
[2020-10-16 13:03:52,860 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 13:03:52,861 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:52,861 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:52,861 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:03:52,861 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:52,861 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:52,861 INFO  L82        PathProgramCache]: Analyzing trace with hash -1950898782, now seen corresponding path program 1 times
[2020-10-16 13:03:52,863 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:52,863 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286508846]
[2020-10-16 13:03:52,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:52,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:52,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:52,945 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286508846]
[2020-10-16 13:03:52,945 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:52,945 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:03:52,945 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752697272]
[2020-10-16 13:03:52,945 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:52,948 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:52,955 INFO  L258    McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions.
[2020-10-16 13:03:52,955 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:53,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,022 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,042 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,056 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,063 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,091 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:53,091 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:03:53,091 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:53,091 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:03:53,092 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:03:53,092 INFO  L87              Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand 4 states.
[2020-10-16 13:03:53,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:53,131 INFO  L93              Difference]: Finished difference Result 570 states and 1538 transitions.
[2020-10-16 13:03:53,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:03:53,132 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 13:03:53,133 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:53,135 INFO  L225             Difference]: With dead ends: 570
[2020-10-16 13:03:53,136 INFO  L226             Difference]: Without dead ends: 412
[2020-10-16 13:03:53,136 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:03:53,168 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 412 states.
[2020-10-16 13:03:53,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412.
[2020-10-16 13:03:53,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 412 states.
[2020-10-16 13:03:53,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1069 transitions.
[2020-10-16 13:03:53,179 INFO  L78                 Accepts]: Start accepts. Automaton has 412 states and 1069 transitions. Word has length 14
[2020-10-16 13:03:53,179 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:53,180 INFO  L481      AbstractCegarLoop]: Abstraction has 412 states and 1069 transitions.
[2020-10-16 13:03:53,180 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:03:53,180 INFO  L276                IsEmpty]: Start isEmpty. Operand 412 states and 1069 transitions.
[2020-10-16 13:03:53,181 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-16 13:03:53,181 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:53,181 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:53,181 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:03:53,181 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:53,182 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:53,182 INFO  L82        PathProgramCache]: Analyzing trace with hash -347834863, now seen corresponding path program 1 times
[2020-10-16 13:03:53,183 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:53,183 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747114212]
[2020-10-16 13:03:53,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:53,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:53,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:53,246 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747114212]
[2020-10-16 13:03:53,246 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:53,246 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:03:53,246 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1472187768]
[2020-10-16 13:03:53,247 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:53,249 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:53,259 INFO  L258    McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions.
[2020-10-16 13:03:53,259 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:53,310 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,319 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,344 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:53,345 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:03:53,345 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:53,345 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:03:53,345 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:03:53,345 INFO  L87              Difference]: Start difference. First operand 412 states and 1069 transitions. Second operand 5 states.
[2020-10-16 13:03:53,389 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:53,389 INFO  L93              Difference]: Finished difference Result 333 states and 803 transitions.
[2020-10-16 13:03:53,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:03:53,390 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-16 13:03:53,390 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:53,392 INFO  L225             Difference]: With dead ends: 333
[2020-10-16 13:03:53,392 INFO  L226             Difference]: Without dead ends: 259
[2020-10-16 13:03:53,392 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:03:53,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 259 states.
[2020-10-16 13:03:53,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 251.
[2020-10-16 13:03:53,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 251 states.
[2020-10-16 13:03:53,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 590 transitions.
[2020-10-16 13:03:53,399 INFO  L78                 Accepts]: Start accepts. Automaton has 251 states and 590 transitions. Word has length 15
[2020-10-16 13:03:53,399 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:53,399 INFO  L481      AbstractCegarLoop]: Abstraction has 251 states and 590 transitions.
[2020-10-16 13:03:53,399 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:03:53,399 INFO  L276                IsEmpty]: Start isEmpty. Operand 251 states and 590 transitions.
[2020-10-16 13:03:53,400 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 13:03:53,400 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:53,400 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:03:53,401 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:03:53,401 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:53,401 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:53,401 INFO  L82        PathProgramCache]: Analyzing trace with hash -1796356976, now seen corresponding path program 1 times
[2020-10-16 13:03:53,402 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:53,403 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240083670]
[2020-10-16 13:03:53,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:53,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:53,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:53,480 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240083670]
[2020-10-16 13:03:53,480 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:53,480 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:03:53,481 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493135417]
[2020-10-16 13:03:53,481 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:53,484 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:53,493 INFO  L258    McrAutomatonBuilder]: Finished intersection with 40 states and 57 transitions.
[2020-10-16 13:03:53,493 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:53,552 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:53,552 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:03:53,553 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:53,553 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:03:53,553 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:03:53,553 INFO  L87              Difference]: Start difference. First operand 251 states and 590 transitions. Second operand 6 states.
[2020-10-16 13:03:53,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:53,607 INFO  L93              Difference]: Finished difference Result 229 states and 544 transitions.
[2020-10-16 13:03:53,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:03:53,608 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-16 13:03:53,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:53,609 INFO  L225             Difference]: With dead ends: 229
[2020-10-16 13:03:53,610 INFO  L226             Difference]: Without dead ends: 215
[2020-10-16 13:03:53,610 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:03:53,611 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2020-10-16 13:03:53,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215.
[2020-10-16 13:03:53,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 215 states.
[2020-10-16 13:03:53,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions.
[2020-10-16 13:03:53,618 INFO  L78                 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 18
[2020-10-16 13:03:53,618 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:53,618 INFO  L481      AbstractCegarLoop]: Abstraction has 215 states and 518 transitions.
[2020-10-16 13:03:53,618 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:03:53,619 INFO  L276                IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions.
[2020-10-16 13:03:53,619 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 13:03:53,620 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:53,620 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-16 13:03:53,620 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 13:03:53,620 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:53,620 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:53,621 INFO  L82        PathProgramCache]: Analyzing trace with hash 1620768660, now seen corresponding path program 1 times
[2020-10-16 13:03:53,622 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:53,623 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777894047]
[2020-10-16 13:03:53,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:53,656 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:53,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:53,776 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777894047]
[2020-10-16 13:03:53,776 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:53,776 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:03:53,777 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [496910828]
[2020-10-16 13:03:53,777 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:53,784 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:53,803 INFO  L258    McrAutomatonBuilder]: Finished intersection with 52 states and 77 transitions.
[2020-10-16 13:03:53,803 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:53,817 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:53,817 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,818 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-10-16 13:03:53,818 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,820 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:53,821 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,822 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:53,823 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,824 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,826 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,828 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,833 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,834 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,836 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,838 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,839 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,840 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,847 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,848 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,849 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,858 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,859 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,861 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,861 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,864 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,865 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,872 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:53,874 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,877 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,878 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,885 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,890 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,898 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,904 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,907 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:53,909 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,909 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,912 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,913 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,920 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,930 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,936 INFO  L603       QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,941 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,946 INFO  L603       QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,950 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,954 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,959 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,962 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:53,962 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:53,964 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,966 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,969 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,970 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,977 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,982 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,983 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,986 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,987 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:53,992 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:53,997 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,997 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:53,998 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,004 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,012 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:54,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,015 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,020 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,026 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,031 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,035 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,036 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,043 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,048 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,049 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,055 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,057 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,063 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,066 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,067 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,071 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,078 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,081 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,084 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,088 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,090 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,091 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,097 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,103 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,103 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,106 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,112 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,113 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,119 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,120 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,124 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,129 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,139 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,209 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,209 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,210 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,212 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,215 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,219 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,219 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,220 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,297 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,298 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,299 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,300 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,313 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,321 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,321 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,338 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,338 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,340 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,341 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,344 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,347 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,348 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,349 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,362 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,362 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,364 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,365 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,368 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,372 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,373 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,374 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,387 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,387 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,389 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,390 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,393 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,397 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,397 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,398 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,411 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,411 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,413 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,413 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,417 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,422 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,422 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,423 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,439 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,439 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,441 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,442 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,445 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,448 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,449 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,450 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,468 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:54,468 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,469 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,470 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,473 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,474 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,484 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,485 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,489 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,494 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,519 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:54,520 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,521 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,522 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,528 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,533 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,534 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,534 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,535 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,540 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,544 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,545 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,547 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,553 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,567 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:54,568 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 13:03:54,568 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:54,568 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 13:03:54,569 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:03:54,569 INFO  L87              Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 7 states.
[2020-10-16 13:03:54,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:54,694 INFO  L93              Difference]: Finished difference Result 283 states and 657 transitions.
[2020-10-16 13:03:54,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:03:54,695 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-16 13:03:54,695 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:54,697 INFO  L225             Difference]: With dead ends: 283
[2020-10-16 13:03:54,697 INFO  L226             Difference]: Without dead ends: 261
[2020-10-16 13:03:54,697 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-16 13:03:54,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2020-10-16 13:03:54,702 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207.
[2020-10-16 13:03:54,702 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 207 states.
[2020-10-16 13:03:54,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 494 transitions.
[2020-10-16 13:03:54,703 INFO  L78                 Accepts]: Start accepts. Automaton has 207 states and 494 transitions. Word has length 22
[2020-10-16 13:03:54,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:54,703 INFO  L481      AbstractCegarLoop]: Abstraction has 207 states and 494 transitions.
[2020-10-16 13:03:54,704 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 13:03:54,704 INFO  L276                IsEmpty]: Start isEmpty. Operand 207 states and 494 transitions.
[2020-10-16 13:03:54,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 13:03:54,705 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:54,705 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-16 13:03:54,705 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-16 13:03:54,705 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:54,705 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:54,705 INFO  L82        PathProgramCache]: Analyzing trace with hash -238495784, now seen corresponding path program 2 times
[2020-10-16 13:03:54,707 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:54,707 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830630841]
[2020-10-16 13:03:54,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:54,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:03:54,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:03:54,874 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830630841]
[2020-10-16 13:03:54,874 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:03:54,874 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-16 13:03:54,874 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772694268]
[2020-10-16 13:03:54,875 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:03:54,880 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:03:54,894 INFO  L258    McrAutomatonBuilder]: Finished intersection with 50 states and 72 transitions.
[2020-10-16 13:03:54,894 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:03:54,910 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:54,910 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,911 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term
[2020-10-16 13:03:54,911 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,912 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,913 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,914 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:54,914 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,915 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,917 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,919 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,923 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,923 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,924 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:54,924 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,929 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,931 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,936 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,937 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,938 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,941 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,942 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,948 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,953 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,954 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,954 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,955 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,963 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,967 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,968 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,969 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,970 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,975 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,976 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,977 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,982 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,983 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,983 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,984 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:54,990 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,992 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:54,993 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,994 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:54,995 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,000 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,010 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,016 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,019 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,021 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,031 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,044 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,045 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,052 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,053 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,054 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,059 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,060 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,069 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,073 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,073 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,079 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,082 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,083 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,083 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,084 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,090 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,091 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,092 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,100 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,101 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,106 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,107 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,108 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,114 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,114 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,116 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,118 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,119 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,124 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,126 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,128 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,130 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,135 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,138 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,140 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,143 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,147 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,150 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,153 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,157 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,163 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,167 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,170 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,212 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term
[2020-10-16 13:03:55,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,213 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term
[2020-10-16 13:03:55,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,214 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:55,215 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,216 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:55,216 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,217 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,218 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,219 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,228 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,229 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,230 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,232 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,237 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,239 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,243 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,247 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,247 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,249 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,254 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,257 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,265 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,270 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,273 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,277 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,277 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,279 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,284 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,292 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,292 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,293 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,298 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,306 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,307 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,314 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,315 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,321 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,346 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,389 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,554 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,623 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,649 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,694 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:03:55,801 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,875 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,902 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,939 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:55,967 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:55,983 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:55,984 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:55,990 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:03:56,033 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,059 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:03:56,099 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:03:56,131 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,175 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:56,175 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,176 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,177 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,178 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,179 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,190 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,193 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,197 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,201 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,223 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,224 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,225 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,227 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,230 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,235 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,235 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,236 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,251 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:03:56,251 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,253 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,254 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,256 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,265 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,267 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,268 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,271 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,275 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,283 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,299 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,300 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,301 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,302 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,306 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,310 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,311 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,312 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,329 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,330 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,331 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,336 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,340 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,341 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,342 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,369 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,370 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,371 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,373 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,375 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:03:56,378 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:03:56,379 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:03:56,400 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:03:56,400 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 13:03:56,401 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:03:56,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 13:03:56,401 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:03:56,402 INFO  L87              Difference]: Start difference. First operand 207 states and 494 transitions. Second operand 8 states.
[2020-10-16 13:03:56,621 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:03:56,621 INFO  L93              Difference]: Finished difference Result 257 states and 594 transitions.
[2020-10-16 13:03:56,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:03:56,622 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 22
[2020-10-16 13:03:56,622 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:03:56,623 INFO  L225             Difference]: With dead ends: 257
[2020-10-16 13:03:56,624 INFO  L226             Difference]: Without dead ends: 183
[2020-10-16 13:03:56,624 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2020-10-16 13:03:56,625 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2020-10-16 13:03:56,633 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183.
[2020-10-16 13:03:56,633 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 183 states.
[2020-10-16 13:03:56,634 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 426 transitions.
[2020-10-16 13:03:56,634 INFO  L78                 Accepts]: Start accepts. Automaton has 183 states and 426 transitions. Word has length 22
[2020-10-16 13:03:56,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:03:56,634 INFO  L481      AbstractCegarLoop]: Abstraction has 183 states and 426 transitions.
[2020-10-16 13:03:56,634 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 13:03:56,634 INFO  L276                IsEmpty]: Start isEmpty. Operand 183 states and 426 transitions.
[2020-10-16 13:03:56,635 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-16 13:03:56,635 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:03:56,635 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-16 13:03:56,635 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-16 13:03:56,636 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:03:56,636 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:03:56,636 INFO  L82        PathProgramCache]: Analyzing trace with hash -813627424, now seen corresponding path program 3 times
[2020-10-16 13:03:56,638 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:03:56,638 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000625776]
[2020-10-16 13:03:56,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:03:56,696 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:03:56,696 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:03:56,731 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:03:56,731 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:03:56,782 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:03:56,782 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:03:56,782 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-16 13:03:56,802 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,802 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,807 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,808 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,808 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,808 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,808 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,808 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,809 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,809 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,809 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,810 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,810 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,810 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,810 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,810 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,811 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,811 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,811 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,811 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,812 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,812 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,812 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,813 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,813 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,813 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,813 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,814 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,814 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,814 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,814 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,815 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,815 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,815 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,819 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,819 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,820 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,820 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,821 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,821 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,822 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,822 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,823 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,823 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,823 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,824 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,824 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,824 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:03:56,824 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:03:56,924 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:03:56 BasicIcfg
[2020-10-16 13:03:56,924 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:03:56,926 INFO  L168              Benchmark]: Toolchain (without parser) took 17621.27 ms. Allocated memory was 138.4 MB in the beginning and 486.0 MB in the end (delta: 347.6 MB). Free memory was 98.7 MB in the beginning and 381.3 MB in the end (delta: -282.7 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,928 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,928 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 812.61 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.5 MB in the beginning and 155.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,929 INFO  L168              Benchmark]: Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,929 INFO  L168              Benchmark]: Boogie Preprocessor took 45.80 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,930 INFO  L168              Benchmark]: RCFGBuilder took 2100.45 ms. Allocated memory was 201.3 MB in the beginning and 252.7 MB in the end (delta: 51.4 MB). Free memory was 149.9 MB in the beginning and 180.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,931 INFO  L168              Benchmark]: TraceAbstraction took 14588.64 ms. Allocated memory was 252.7 MB in the beginning and 486.0 MB in the end (delta: 233.3 MB). Free memory was 180.6 MB in the beginning and 381.3 MB in the end (delta: -200.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:03:56,941 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 812.61 ms. Allocated memory was 138.4 MB in the beginning and 201.3 MB in the end (delta: 62.9 MB). Free memory was 98.5 MB in the beginning and 155.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 68.27 ms. Allocated memory is still 201.3 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 45.80 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 149.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2100.45 ms. Allocated memory was 201.3 MB in the beginning and 252.7 MB in the end (delta: 51.4 MB). Free memory was 149.9 MB in the beginning and 180.6 MB in the end (delta: -30.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 14588.64 ms. Allocated memory was 252.7 MB in the beginning and 486.0 MB in the end (delta: 233.3 MB). Free memory was 180.6 MB in the beginning and 381.3 MB in the end (delta: -200.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    888 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 96 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.9s, 102 PlacesBefore, 38 PlacesAfterwards, 94 TransitionsBefore, 29 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5052 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L702]               0  int __unbuffered_p2_EBX = 0;
[L703]               0  _Bool main$tmp_guard0;
[L704]               0  _Bool main$tmp_guard1;
[L706]               0  int x = 0;
[L707]               0  _Bool x$flush_delayed;
[L708]               0  int x$mem_tmp;
[L709]               0  _Bool x$r_buff0_thd0;
[L710]               0  _Bool x$r_buff0_thd1;
[L711]               0  _Bool x$r_buff0_thd2;
[L712]               0  _Bool x$r_buff0_thd3;
[L713]               0  _Bool x$r_buff1_thd0;
[L714]               0  _Bool x$r_buff1_thd1;
[L715]               0  _Bool x$r_buff1_thd2;
[L716]               0  _Bool x$r_buff1_thd3;
[L717]               0  _Bool x$read_delayed;
[L718]               0  int *x$read_delayed_var;
[L719]               0  int x$w_buff0;
[L720]               0  _Bool x$w_buff0_used;
[L721]               0  int x$w_buff1;
[L722]               0  _Bool x$w_buff1_used;
[L724]               0  int y = 0;
[L726]               0  int z = 0;
[L727]               0  _Bool weak$$choice0;
[L728]               0  _Bool weak$$choice2;
[L812]               0  pthread_t t748;
[L813]  FCALL, FORK  0  pthread_create(&t748, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L814]               0  pthread_t t749;
[L815]  FCALL, FORK  0  pthread_create(&t749, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L752]               2  x$w_buff1 = x$w_buff0
[L753]               2  x$w_buff0 = 2
[L754]               2  x$w_buff1_used = x$w_buff0_used
[L755]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L757]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L758]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L759]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L760]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L761]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L764]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L816]               0  pthread_t t750;
[L817]  FCALL, FORK  0  pthread_create(&t750, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L781]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L784]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L787]               3  __unbuffered_p2_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L790]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L790]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L791]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L791]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L792]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L792]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L793]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L793]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L794]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L794]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L732]               1  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]
[L735]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]
[L767]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L767]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L768]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L768]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L769]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L769]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L770]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L770]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L771]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L771]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L774]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L776]               2  return 0;
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L738]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L738]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L739]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L739]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L740]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L740]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L741]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L741]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L742]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L742]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L747]               1  return 0;
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L819]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L823]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L823]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L824]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L825]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L825]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L826]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L827]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L827]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L830]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L831]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L832]               0  x$flush_delayed = weak$$choice2
[L833]               0  x$mem_tmp = x
[L834]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L834]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L834]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L834]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L835]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L835]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L836]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L836]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L836]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L836]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L837]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L837]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L838]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L838]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L839]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L840]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L840]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L840]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L840]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0)
[L842]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L842]               0  x = x$flush_delayed ? x$mem_tmp : x
[L843]               0  x$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 308 SDtfs, 312 SDslu, 559 SDs, 0 SdLazy, 356 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 20 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred 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, 13 MinimizatonAttempts, 434 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 23302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...