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


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


This is Ultimate 0.1.25-1d1d2b5
[2020-10-21 22:01:05,746 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-21 22:01:05,749 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-21 22:01:05,775 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-21 22:01:05,776 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-21 22:01:05,777 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-21 22:01:05,778 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-21 22:01:05,780 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-21 22:01:05,782 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-21 22:01:05,782 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-21 22:01:05,783 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-21 22:01:05,786 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-21 22:01:05,786 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-21 22:01:05,788 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-21 22:01:05,789 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-21 22:01:05,792 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-21 22:01:05,793 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-21 22:01:05,794 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-21 22:01:05,798 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-21 22:01:05,802 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-21 22:01:05,803 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-21 22:01:05,806 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-21 22:01:05,808 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-21 22:01:05,809 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-21 22:01:05,816 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-21 22:01:05,816 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-21 22:01:05,817 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-21 22:01:05,820 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-21 22:01:05,821 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-21 22:01:05,823 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-21 22:01:05,823 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-21 22:01:05,824 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-21 22:01:05,825 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-21 22:01:05,826 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-21 22:01:05,827 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-21 22:01:05,827 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-21 22:01:05,828 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-21 22:01:05,828 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-21 22:01:05,828 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-21 22:01:05,833 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-21 22:01:05,834 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-21 22:01:05,837 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-21 22:01:05,864 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-21 22:01:05,865 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-21 22:01:05,866 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-21 22:01:05,866 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-21 22:01:05,867 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-21 22:01:05,867 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-21 22:01:05,867 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-21 22:01:05,867 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-21 22:01:05,867 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-21 22:01:05,868 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-21 22:01:05,868 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-21 22:01:05,868 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-21 22:01:05,868 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-21 22:01:05,868 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-21 22:01:05,869 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-21 22:01:05,869 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-21 22:01:05,869 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-21 22:01:05,869 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-21 22:01:05,869 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-21 22:01:05,870 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-21 22:01:05,870 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-21 22:01:05,870 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:05,870 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-21 22:01:05,871 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-21 22:01:05,871 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-21 22:01:05,871 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-21 22:01:05,871 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-21 22:01:05,873 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-21 22:01:05,873 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-21 22:01:05,873 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-21 22:01:06,254 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-21 22:01:06,274 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-21 22:01:06,277 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-21 22:01:06,279 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-21 22:01:06,279 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-21 22:01:06,280 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i
[2020-10-21 22:01:06,347 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e970bc44a/620ed06c5ff147bcb69d9564606f40ea/FLAGd059a9dba
[2020-10-21 22:01:06,874 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-21 22:01:06,874 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i
[2020-10-21 22:01:06,894 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e970bc44a/620ed06c5ff147bcb69d9564606f40ea/FLAGd059a9dba
[2020-10-21 22:01:07,220 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e970bc44a/620ed06c5ff147bcb69d9564606f40ea
[2020-10-21 22:01:07,228 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-21 22:01:07,236 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-21 22:01:07,237 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:07,237 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-21 22:01:07,241 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-21 22:01:07,242 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:07" (1/1) ...
[2020-10-21 22:01:07,244 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d1e96c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:07, skipping insertion in model container
[2020-10-21 22:01:07,245 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:01:07" (1/1) ...
[2020-10-21 22:01:07,253 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-21 22:01:07,308 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-21 22:01:07,855 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:07,866 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-21 22:01:07,931 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-21 22:01:08,019 INFO  L208         MainTranslator]: Completed translation
[2020-10-21 22:01:08,019 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08 WrapperNode
[2020-10-21 22:01:08,020 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-21 22:01:08,021 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:08,021 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-21 22:01:08,021 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-21 22:01:08,031 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,053 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,091 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-21 22:01:08,092 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-21 22:01:08,092 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-21 22:01:08,092 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-21 22:01:08,103 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,103 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,108 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,109 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,120 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,128 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,133 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
[2020-10-21 22:01:08,148 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-21 22:01:08,150 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-21 22:01:08,150 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-21 22:01:08,150 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-21 22:01:08,151 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-21 22:01:08,210 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-21 22:01:08,211 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-21 22:01:08,211 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-21 22:01:08,212 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-21 22:01:08,212 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-21 22:01:08,213 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-21 22:01:08,213 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-21 22:01:08,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-21 22:01:08,214 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-21 22:01:08,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-21 22:01:08,215 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-21 22:01:08,215 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-21 22:01:08,215 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-21 22:01:08,216 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-21 22:01:08,218 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-21 22:01:10,384 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-21 22:01:10,385 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-10-21 22:01:10,388 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:10 BoogieIcfgContainer
[2020-10-21 22:01:10,388 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-21 22:01:10,389 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-21 22:01:10,390 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-21 22:01:10,394 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-21 22:01:10,394 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:01:07" (1/3) ...
[2020-10-21 22:01:10,395 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222e4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:10, skipping insertion in model container
[2020-10-21 22:01:10,395 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:01:08" (2/3) ...
[2020-10-21 22:01:10,396 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222e4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:01:10, skipping insertion in model container
[2020-10-21 22:01:10,396 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:01:10" (3/3) ...
[2020-10-21 22:01:10,398 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i
[2020-10-21 22:01:10,410 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-21 22:01:10,411 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-21 22:01:10,419 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-21 22:01:10,421 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-21 22:01:10,452 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,453 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,453 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,453 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,454 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,454 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,454 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,454 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,455 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,458 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,458 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,459 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,459 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,461 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,461 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,461 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,461 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,462 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,462 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,462 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,462 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,463 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,463 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,463 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,463 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,463 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,464 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,464 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,469 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,469 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,469 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,469 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,470 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,471 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,471 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,471 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,471 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,471 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,474 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,475 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,475 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,475 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,475 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,476 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,476 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,476 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,476 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,476 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,478 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,478 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,479 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,480 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-21 22:01:10,481 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-21 22:01:10,498 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-21 22:01:10,523 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-21 22:01:10,523 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-21 22:01:10,523 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-21 22:01:10,523 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-21 22:01:10,524 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-21 22:01:10,524 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-21 22:01:10,524 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-21 22:01:10,524 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-21 22:01:10,541 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-21 22:01:10,544 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:10,548 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:10,551 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow
[2020-10-21 22:01:10,612 INFO  L129       PetriNetUnfolder]: 3/98 cut-off events.
[2020-10-21 22:01:10,612 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-21 22:01:10,618 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. 
[2020-10-21 22:01:10,625 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1870
[2020-10-21 22:01:10,810 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:10,811 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:10,816 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,833 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:10,833 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:10,846 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:10,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:10,920 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:10,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:10,927 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,929 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:10,930 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,934 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:10,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:10,939 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:10,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:10,942 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:10,942 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:10,946 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:10,946 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,950 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:10,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:10,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:10,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,198 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,207 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,207 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,208 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,209 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,213 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,216 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,218 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,221 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:11,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,223 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:11,224 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,225 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:11,226 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,282 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:11,282 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:11,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:11,287 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:11,291 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:11,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,421 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,422 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,423 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,425 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,426 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,428 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,428 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,444 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,445 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,446 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,446 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,448 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,448 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,450 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,451 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,820 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,820 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,821 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,824 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,843 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,844 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,844 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,845 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,847 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,849 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:11,850 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:11,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:11,906 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,907 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:11,907 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,932 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:11,933 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,933 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:11,934 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,979 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:11,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,986 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,989 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,989 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,991 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,992 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,993 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:11,994 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:11,996 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:11,996 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:11,999 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:12,000 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:12,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:12,002 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:12,048 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term
[2020-10-21 22:01:12,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:12,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:12,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:12,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:12,053 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-21 22:01:12,055 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-21 22:01:12,056 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,378 WARN  L193               SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 226 DAG size of output: 186
[2020-10-21 22:01:13,397 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term
[2020-10-21 22:01:13,398 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:13,398 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2020-10-21 22:01:13,399 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,219 WARN  L193               SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122
[2020-10-21 22:01:14,342 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,345 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,346 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,348 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,348 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,364 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,364 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,365 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,366 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,368 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,368 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,433 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,433 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,434 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,435 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,436 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,437 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,452 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,453 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,454 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,454 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,495 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,516 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,518 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,518 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,520 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,520 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,797 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,797 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,798 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,799 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,801 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,802 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,805 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,805 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,828 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,831 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:14,832 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:14,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,878 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-21 22:01:14,881 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,882 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,908 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,908 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,909 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term
[2020-10-21 22:01:14,910 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,910 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,911 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,912 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,913 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:14,915 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,916 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,918 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,919 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term
[2020-10-21 22:01:14,919 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,922 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:14,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:14,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,020 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,021 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,022 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,022 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,024 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,024 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,040 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,041 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,076 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-21 22:01:15,077 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,388 WARN  L193               SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-21 22:01:15,494 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-21 22:01:15,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,661 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,663 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,663 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,667 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,667 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,678 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,681 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,728 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,729 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,729 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,730 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,731 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,732 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,734 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,734 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,746 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,746 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,747 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,748 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,751 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,752 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,855 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,856 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,856 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,857 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,859 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,872 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,872 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,874 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,876 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,916 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,917 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,917 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,943 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,947 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,947 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,948 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:15,959 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,961 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,961 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:15,963 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:15,963 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:15,964 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:15,965 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:16,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,044 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:16,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,066 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:16,066 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,067 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,068 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:16,070 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:16,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:16,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,171 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,172 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,173 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,175 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,175 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,177 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:16,177 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-21 22:01:16,188 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,188 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,189 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-21 22:01:16,190 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-21 22:01:16,191 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:16,192 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-21 22:01:16,192 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-21 22:01:17,128 WARN  L193               SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112
[2020-10-21 22:01:17,305 WARN  L193               SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-21 22:01:17,318 INFO  L131        LiptonReduction]: Checked pairs total: 4899
[2020-10-21 22:01:17,318 INFO  L133        LiptonReduction]: Total number of compositions: 89
[2020-10-21 22:01:17,325 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-21 22:01:17,397 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states.
[2020-10-21 22:01:17,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 974 states.
[2020-10-21 22:01:17,406 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-21 22:01:17,406 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:17,407 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-21 22:01:17,407 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:17,412 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:17,412 INFO  L82        PathProgramCache]: Analyzing trace with hash 1090369, now seen corresponding path program 1 times
[2020-10-21 22:01:17,421 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:17,421 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399664893]
[2020-10-21 22:01:17,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:17,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:17,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:17,660 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399664893]
[2020-10-21 22:01:17,661 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:17,666 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-21 22:01:17,667 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481412137]
[2020-10-21 22:01:17,672 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-21 22:01:17,672 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:17,687 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-21 22:01:17,688 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:01:17,690 INFO  L87              Difference]: Start difference. First operand 974 states. Second operand 3 states.
[2020-10-21 22:01:17,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:17,794 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-21 22:01:17,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-21 22:01:17,797 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-21 22:01:17,797 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:17,823 INFO  L225             Difference]: With dead ends: 812
[2020-10-21 22:01:17,823 INFO  L226             Difference]: Without dead ends: 687
[2020-10-21 22:01:17,825 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-21 22:01:17,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 687 states.
[2020-10-21 22:01:17,937 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687.
[2020-10-21 22:01:17,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 687 states.
[2020-10-21 22:01:17,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions.
[2020-10-21 22:01:17,954 INFO  L78                 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3
[2020-10-21 22:01:17,957 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:17,957 INFO  L481      AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions.
[2020-10-21 22:01:17,957 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-21 22:01:17,957 INFO  L276                IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions.
[2020-10-21 22:01:17,959 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-21 22:01:17,959 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:17,960 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:17,960 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-21 22:01:17,960 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:17,961 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:17,961 INFO  L82        PathProgramCache]: Analyzing trace with hash -369742601, now seen corresponding path program 1 times
[2020-10-21 22:01:17,961 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:17,961 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753002989]
[2020-10-21 22:01:17,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:18,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:18,128 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:18,129 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753002989]
[2020-10-21 22:01:18,131 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:18,132 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:18,132 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828396030]
[2020-10-21 22:01:18,133 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:18,134 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:18,134 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:18,134 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:18,135 INFO  L87              Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states.
[2020-10-21 22:01:18,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:18,246 INFO  L93              Difference]: Finished difference Result 802 states and 2417 transitions.
[2020-10-21 22:01:18,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:18,247 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-21 22:01:18,248 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:18,254 INFO  L225             Difference]: With dead ends: 802
[2020-10-21 22:01:18,254 INFO  L226             Difference]: Without dead ends: 677
[2020-10-21 22:01:18,257 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:18,261 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 677 states.
[2020-10-21 22:01:18,314 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677.
[2020-10-21 22:01:18,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 677 states.
[2020-10-21 22:01:18,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions.
[2020-10-21 22:01:18,318 INFO  L78                 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10
[2020-10-21 22:01:18,319 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:18,319 INFO  L481      AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions.
[2020-10-21 22:01:18,319 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:18,320 INFO  L276                IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions.
[2020-10-21 22:01:18,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-21 22:01:18,325 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:18,325 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:18,326 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-21 22:01:18,326 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:18,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:18,326 INFO  L82        PathProgramCache]: Analyzing trace with hash -403301390, now seen corresponding path program 1 times
[2020-10-21 22:01:18,327 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:18,327 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563219886]
[2020-10-21 22:01:18,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:18,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:18,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:18,465 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563219886]
[2020-10-21 22:01:18,465 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:18,465 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:18,466 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596590360]
[2020-10-21 22:01:18,466 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:18,466 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:18,466 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:18,467 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:18,467 INFO  L87              Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states.
[2020-10-21 22:01:18,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:18,502 INFO  L93              Difference]: Finished difference Result 749 states and 2250 transitions.
[2020-10-21 22:01:18,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:18,503 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-21 22:01:18,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:18,508 INFO  L225             Difference]: With dead ends: 749
[2020-10-21 22:01:18,508 INFO  L226             Difference]: Without dead ends: 629
[2020-10-21 22:01:18,508 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:18,512 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 629 states.
[2020-10-21 22:01:18,527 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629.
[2020-10-21 22:01:18,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 629 states.
[2020-10-21 22:01:18,531 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions.
[2020-10-21 22:01:18,531 INFO  L78                 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11
[2020-10-21 22:01:18,532 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:18,532 INFO  L481      AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions.
[2020-10-21 22:01:18,532 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:18,532 INFO  L276                IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions.
[2020-10-21 22:01:18,534 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:01:18,534 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:18,534 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:18,534 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-21 22:01:18,535 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:18,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:18,535 INFO  L82        PathProgramCache]: Analyzing trace with hash 382555853, now seen corresponding path program 1 times
[2020-10-21 22:01:18,535 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:18,536 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034298411]
[2020-10-21 22:01:18,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:18,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:18,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:18,627 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034298411]
[2020-10-21 22:01:18,628 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:18,628 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-21 22:01:18,628 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942661837]
[2020-10-21 22:01:18,628 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:18,629 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:18,629 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:18,629 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:18,629 INFO  L87              Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 4 states.
[2020-10-21 22:01:18,666 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:18,666 INFO  L93              Difference]: Finished difference Result 701 states and 2098 transitions.
[2020-10-21 22:01:18,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:18,667 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2020-10-21 22:01:18,667 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:18,671 INFO  L225             Difference]: With dead ends: 701
[2020-10-21 22:01:18,672 INFO  L226             Difference]: Without dead ends: 621
[2020-10-21 22:01:18,672 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:18,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 621 states.
[2020-10-21 22:01:18,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621.
[2020-10-21 22:01:18,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 621 states.
[2020-10-21 22:01:18,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions.
[2020-10-21 22:01:18,693 INFO  L78                 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 12
[2020-10-21 22:01:18,694 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:18,694 INFO  L481      AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions.
[2020-10-21 22:01:18,694 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:18,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions.
[2020-10-21 22:01:18,696 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-21 22:01:18,696 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:18,696 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:18,696 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-21 22:01:18,696 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:18,697 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:18,697 INFO  L82        PathProgramCache]: Analyzing trace with hash 1159558494, now seen corresponding path program 1 times
[2020-10-21 22:01:18,697 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:18,697 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55322800]
[2020-10-21 22:01:18,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:18,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:18,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:18,799 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55322800]
[2020-10-21 22:01:18,800 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:18,802 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:18,802 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80972921]
[2020-10-21 22:01:18,803 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:18,803 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:18,803 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:18,803 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:18,804 INFO  L87              Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 5 states.
[2020-10-21 22:01:18,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:18,869 INFO  L93              Difference]: Finished difference Result 829 states and 2510 transitions.
[2020-10-21 22:01:18,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:18,870 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-21 22:01:18,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:18,873 INFO  L225             Difference]: With dead ends: 829
[2020-10-21 22:01:18,874 INFO  L226             Difference]: Without dead ends: 437
[2020-10-21 22:01:18,874 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:18,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2020-10-21 22:01:18,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437.
[2020-10-21 22:01:18,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 437 states.
[2020-10-21 22:01:18,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions.
[2020-10-21 22:01:18,888 INFO  L78                 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 12
[2020-10-21 22:01:18,888 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:18,888 INFO  L481      AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions.
[2020-10-21 22:01:18,888 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:18,888 INFO  L276                IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions.
[2020-10-21 22:01:18,889 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-21 22:01:18,889 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:18,890 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:18,890 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-21 22:01:18,890 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:18,890 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:18,890 INFO  L82        PathProgramCache]: Analyzing trace with hash 1591368352, now seen corresponding path program 1 times
[2020-10-21 22:01:18,891 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:18,891 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420380690]
[2020-10-21 22:01:18,891 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:18,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:18,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:18,983 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420380690]
[2020-10-21 22:01:18,983 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:18,983 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:18,984 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335128025]
[2020-10-21 22:01:18,984 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:18,984 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:18,985 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:18,985 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:18,985 INFO  L87              Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 5 states.
[2020-10-21 22:01:19,082 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:19,083 INFO  L93              Difference]: Finished difference Result 491 states and 1384 transitions.
[2020-10-21 22:01:19,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:19,084 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-21 22:01:19,084 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:19,087 INFO  L225             Difference]: With dead ends: 491
[2020-10-21 22:01:19,087 INFO  L226             Difference]: Without dead ends: 431
[2020-10-21 22:01:19,088 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:19,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 431 states.
[2020-10-21 22:01:19,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431.
[2020-10-21 22:01:19,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 431 states.
[2020-10-21 22:01:19,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions.
[2020-10-21 22:01:19,102 INFO  L78                 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13
[2020-10-21 22:01:19,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:19,103 INFO  L481      AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions.
[2020-10-21 22:01:19,103 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:19,103 INFO  L276                IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions.
[2020-10-21 22:01:19,104 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:19,104 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:19,104 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:19,104 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-21 22:01:19,105 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:19,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:19,105 INFO  L82        PathProgramCache]: Analyzing trace with hash -1726102075, now seen corresponding path program 1 times
[2020-10-21 22:01:19,105 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:19,106 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742991194]
[2020-10-21 22:01:19,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:19,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:19,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:19,212 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742991194]
[2020-10-21 22:01:19,213 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:19,213 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:19,213 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499047064]
[2020-10-21 22:01:19,214 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:19,214 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:19,214 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:19,215 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:19,215 INFO  L87              Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 5 states.
[2020-10-21 22:01:19,328 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:19,328 INFO  L93              Difference]: Finished difference Result 511 states and 1448 transitions.
[2020-10-21 22:01:19,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:19,329 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-21 22:01:19,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:19,333 INFO  L225             Difference]: With dead ends: 511
[2020-10-21 22:01:19,333 INFO  L226             Difference]: Without dead ends: 459
[2020-10-21 22:01:19,334 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:19,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2020-10-21 22:01:19,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459.
[2020-10-21 22:01:19,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 459 states.
[2020-10-21 22:01:19,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 1328 transitions.
[2020-10-21 22:01:19,351 INFO  L78                 Accepts]: Start accepts. Automaton has 459 states and 1328 transitions. Word has length 14
[2020-10-21 22:01:19,352 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:19,352 INFO  L481      AbstractCegarLoop]: Abstraction has 459 states and 1328 transitions.
[2020-10-21 22:01:19,352 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:19,352 INFO  L276                IsEmpty]: Start isEmpty. Operand 459 states and 1328 transitions.
[2020-10-21 22:01:19,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:19,353 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:19,354 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:19,354 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-21 22:01:19,354 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:19,354 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:19,355 INFO  L82        PathProgramCache]: Analyzing trace with hash 2087735349, now seen corresponding path program 1 times
[2020-10-21 22:01:19,355 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:19,355 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198073210]
[2020-10-21 22:01:19,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:19,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:19,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:19,471 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198073210]
[2020-10-21 22:01:19,471 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:19,472 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:19,472 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370909439]
[2020-10-21 22:01:19,472 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:19,472 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:19,473 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:19,473 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:19,473 INFO  L87              Difference]: Start difference. First operand 459 states and 1328 transitions. Second operand 5 states.
[2020-10-21 22:01:19,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:19,570 INFO  L93              Difference]: Finished difference Result 511 states and 1449 transitions.
[2020-10-21 22:01:19,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:19,572 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-21 22:01:19,572 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:19,575 INFO  L225             Difference]: With dead ends: 511
[2020-10-21 22:01:19,576 INFO  L226             Difference]: Without dead ends: 466
[2020-10-21 22:01:19,577 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:19,579 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 466 states.
[2020-10-21 22:01:19,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462.
[2020-10-21 22:01:19,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 462 states.
[2020-10-21 22:01:19,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1336 transitions.
[2020-10-21 22:01:19,591 INFO  L78                 Accepts]: Start accepts. Automaton has 462 states and 1336 transitions. Word has length 14
[2020-10-21 22:01:19,591 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:19,591 INFO  L481      AbstractCegarLoop]: Abstraction has 462 states and 1336 transitions.
[2020-10-21 22:01:19,591 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:19,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 462 states and 1336 transitions.
[2020-10-21 22:01:19,593 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-21 22:01:19,593 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:19,593 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:19,593 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-21 22:01:19,593 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:19,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:19,594 INFO  L82        PathProgramCache]: Analyzing trace with hash 1733371513, now seen corresponding path program 2 times
[2020-10-21 22:01:19,597 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:19,598 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176208345]
[2020-10-21 22:01:19,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:19,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:19,736 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:19,737 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176208345]
[2020-10-21 22:01:19,737 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:19,737 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:19,738 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793902823]
[2020-10-21 22:01:19,738 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:19,738 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:19,738 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:19,739 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:19,739 INFO  L87              Difference]: Start difference. First operand 462 states and 1336 transitions. Second operand 6 states.
[2020-10-21 22:01:19,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:19,923 INFO  L93              Difference]: Finished difference Result 553 states and 1573 transitions.
[2020-10-21 22:01:19,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-21 22:01:19,924 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 14
[2020-10-21 22:01:19,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:19,928 INFO  L225             Difference]: With dead ends: 553
[2020-10-21 22:01:19,928 INFO  L226             Difference]: Without dead ends: 492
[2020-10-21 22:01:19,928 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:19,930 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 492 states.
[2020-10-21 22:01:19,940 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 485.
[2020-10-21 22:01:19,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 485 states.
[2020-10-21 22:01:19,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1392 transitions.
[2020-10-21 22:01:19,943 INFO  L78                 Accepts]: Start accepts. Automaton has 485 states and 1392 transitions. Word has length 14
[2020-10-21 22:01:19,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:19,943 INFO  L481      AbstractCegarLoop]: Abstraction has 485 states and 1392 transitions.
[2020-10-21 22:01:19,943 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:19,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 485 states and 1392 transitions.
[2020-10-21 22:01:19,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-21 22:01:19,945 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:19,945 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:19,945 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-21 22:01:19,945 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:19,946 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:19,946 INFO  L82        PathProgramCache]: Analyzing trace with hash -1970989686, now seen corresponding path program 1 times
[2020-10-21 22:01:19,946 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:19,946 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428235806]
[2020-10-21 22:01:19,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:19,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:20,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:20,083 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428235806]
[2020-10-21 22:01:20,083 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:20,083 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:20,084 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175381250]
[2020-10-21 22:01:20,084 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:20,084 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:20,084 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:20,085 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:20,085 INFO  L87              Difference]: Start difference. First operand 485 states and 1392 transitions. Second operand 6 states.
[2020-10-21 22:01:20,212 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:20,212 INFO  L93              Difference]: Finished difference Result 509 states and 1432 transitions.
[2020-10-21 22:01:20,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:20,213 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2020-10-21 22:01:20,213 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:20,217 INFO  L225             Difference]: With dead ends: 509
[2020-10-21 22:01:20,217 INFO  L226             Difference]: Without dead ends: 477
[2020-10-21 22:01:20,218 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:20,220 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 477 states.
[2020-10-21 22:01:20,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477.
[2020-10-21 22:01:20,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 477 states.
[2020-10-21 22:01:20,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1364 transitions.
[2020-10-21 22:01:20,236 INFO  L78                 Accepts]: Start accepts. Automaton has 477 states and 1364 transitions. Word has length 15
[2020-10-21 22:01:20,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:20,236 INFO  L481      AbstractCegarLoop]: Abstraction has 477 states and 1364 transitions.
[2020-10-21 22:01:20,236 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:20,236 INFO  L276                IsEmpty]: Start isEmpty. Operand 477 states and 1364 transitions.
[2020-10-21 22:01:20,238 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:20,238 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:20,238 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:20,238 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-21 22:01:20,238 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:20,239 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:20,239 INFO  L82        PathProgramCache]: Analyzing trace with hash -971181429, now seen corresponding path program 1 times
[2020-10-21 22:01:20,239 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:20,239 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825074548]
[2020-10-21 22:01:20,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:20,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:20,332 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:20,332 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825074548]
[2020-10-21 22:01:20,333 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:20,333 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:20,333 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155932683]
[2020-10-21 22:01:20,333 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:20,334 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:20,334 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:20,334 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:20,334 INFO  L87              Difference]: Start difference. First operand 477 states and 1364 transitions. Second operand 6 states.
[2020-10-21 22:01:20,477 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:20,477 INFO  L93              Difference]: Finished difference Result 570 states and 1620 transitions.
[2020-10-21 22:01:20,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:20,479 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-21 22:01:20,479 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:20,483 INFO  L225             Difference]: With dead ends: 570
[2020-10-21 22:01:20,483 INFO  L226             Difference]: Without dead ends: 540
[2020-10-21 22:01:20,483 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:20,486 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 540 states.
[2020-10-21 22:01:20,500 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 475.
[2020-10-21 22:01:20,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 475 states.
[2020-10-21 22:01:20,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1357 transitions.
[2020-10-21 22:01:20,503 INFO  L78                 Accepts]: Start accepts. Automaton has 475 states and 1357 transitions. Word has length 16
[2020-10-21 22:01:20,505 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:20,505 INFO  L481      AbstractCegarLoop]: Abstraction has 475 states and 1357 transitions.
[2020-10-21 22:01:20,505 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:20,505 INFO  L276                IsEmpty]: Start isEmpty. Operand 475 states and 1357 transitions.
[2020-10-21 22:01:20,507 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:20,507 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:20,507 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:20,507 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-21 22:01:20,507 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:20,507 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:20,508 INFO  L82        PathProgramCache]: Analyzing trace with hash -928109409, now seen corresponding path program 2 times
[2020-10-21 22:01:20,508 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:20,508 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606356927]
[2020-10-21 22:01:20,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:20,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:20,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:20,690 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606356927]
[2020-10-21 22:01:20,691 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:20,691 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:20,691 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485275770]
[2020-10-21 22:01:20,691 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:01:20,691 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:20,692 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:01:20,692 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:20,692 INFO  L87              Difference]: Start difference. First operand 475 states and 1357 transitions. Second operand 7 states.
[2020-10-21 22:01:20,902 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:20,902 INFO  L93              Difference]: Finished difference Result 569 states and 1615 transitions.
[2020-10-21 22:01:20,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:20,903 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2020-10-21 22:01:20,903 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:20,907 INFO  L225             Difference]: With dead ends: 569
[2020-10-21 22:01:20,908 INFO  L226             Difference]: Without dead ends: 535
[2020-10-21 22:01:20,908 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:20,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 535 states.
[2020-10-21 22:01:20,925 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 469.
[2020-10-21 22:01:20,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 469 states.
[2020-10-21 22:01:20,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1341 transitions.
[2020-10-21 22:01:20,927 INFO  L78                 Accepts]: Start accepts. Automaton has 469 states and 1341 transitions. Word has length 16
[2020-10-21 22:01:20,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:20,928 INFO  L481      AbstractCegarLoop]: Abstraction has 469 states and 1341 transitions.
[2020-10-21 22:01:20,928 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:01:20,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 469 states and 1341 transitions.
[2020-10-21 22:01:20,929 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:20,929 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:20,929 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:20,929 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-21 22:01:20,930 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:20,930 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:20,930 INFO  L82        PathProgramCache]: Analyzing trace with hash -928102682, now seen corresponding path program 1 times
[2020-10-21 22:01:20,930 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:20,931 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426067827]
[2020-10-21 22:01:20,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:20,955 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,165 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,165 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426067827]
[2020-10-21 22:01:21,165 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,166 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:21,166 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415699614]
[2020-10-21 22:01:21,166 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-21 22:01:21,166 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,167 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-21 22:01:21,167 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:21,169 INFO  L87              Difference]: Start difference. First operand 469 states and 1341 transitions. Second operand 7 states.
[2020-10-21 22:01:21,367 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,367 INFO  L93              Difference]: Finished difference Result 645 states and 1787 transitions.
[2020-10-21 22:01:21,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:21,368 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2020-10-21 22:01:21,368 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,372 INFO  L225             Difference]: With dead ends: 645
[2020-10-21 22:01:21,372 INFO  L226             Difference]: Without dead ends: 565
[2020-10-21 22:01:21,373 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:21,375 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 565 states.
[2020-10-21 22:01:21,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 493.
[2020-10-21 22:01:21,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 493 states.
[2020-10-21 22:01:21,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1399 transitions.
[2020-10-21 22:01:21,421 INFO  L78                 Accepts]: Start accepts. Automaton has 493 states and 1399 transitions. Word has length 16
[2020-10-21 22:01:21,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,421 INFO  L481      AbstractCegarLoop]: Abstraction has 493 states and 1399 transitions.
[2020-10-21 22:01:21,421 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-21 22:01:21,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 493 states and 1399 transitions.
[2020-10-21 22:01:21,422 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:21,422 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,423 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,423 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-21 22:01:21,426 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,426 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,427 INFO  L82        PathProgramCache]: Analyzing trace with hash -928533210, now seen corresponding path program 1 times
[2020-10-21 22:01:21,427 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,427 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260520316]
[2020-10-21 22:01:21,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,512 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260520316]
[2020-10-21 22:01:21,513 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,513 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:21,513 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830175194]
[2020-10-21 22:01:21,513 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:21,514 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,514 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:21,515 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:21,515 INFO  L87              Difference]: Start difference. First operand 493 states and 1399 transitions. Second operand 6 states.
[2020-10-21 22:01:21,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,627 INFO  L93              Difference]: Finished difference Result 781 states and 2162 transitions.
[2020-10-21 22:01:21,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:21,628 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-21 22:01:21,629 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,632 INFO  L225             Difference]: With dead ends: 781
[2020-10-21 22:01:21,633 INFO  L226             Difference]: Without dead ends: 472
[2020-10-21 22:01:21,633 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2020-10-21 22:01:21,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 472 states.
[2020-10-21 22:01:21,644 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 432.
[2020-10-21 22:01:21,644 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 432 states.
[2020-10-21 22:01:21,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1124 transitions.
[2020-10-21 22:01:21,646 INFO  L78                 Accepts]: Start accepts. Automaton has 432 states and 1124 transitions. Word has length 16
[2020-10-21 22:01:21,646 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,646 INFO  L481      AbstractCegarLoop]: Abstraction has 432 states and 1124 transitions.
[2020-10-21 22:01:21,646 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:21,646 INFO  L276                IsEmpty]: Start isEmpty. Operand 432 states and 1124 transitions.
[2020-10-21 22:01:21,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-21 22:01:21,647 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,648 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,648 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-21 22:01:21,648 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,648 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,648 INFO  L82        PathProgramCache]: Analyzing trace with hash -1171739132, now seen corresponding path program 2 times
[2020-10-21 22:01:21,649 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,649 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867277614]
[2020-10-21 22:01:21,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,707 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867277614]
[2020-10-21 22:01:21,707 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,707 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-21 22:01:21,707 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10405181]
[2020-10-21 22:01:21,708 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-21 22:01:21,708 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,708 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-21 22:01:21,708 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-21 22:01:21,709 INFO  L87              Difference]: Start difference. First operand 432 states and 1124 transitions. Second operand 4 states.
[2020-10-21 22:01:21,741 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,741 INFO  L93              Difference]: Finished difference Result 416 states and 951 transitions.
[2020-10-21 22:01:21,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-21 22:01:21,742 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-21 22:01:21,742 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,744 INFO  L225             Difference]: With dead ends: 416
[2020-10-21 22:01:21,744 INFO  L226             Difference]: Without dead ends: 318
[2020-10-21 22:01:21,745 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,746 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2020-10-21 22:01:21,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318.
[2020-10-21 22:01:21,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 318 states.
[2020-10-21 22:01:21,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 720 transitions.
[2020-10-21 22:01:21,753 INFO  L78                 Accepts]: Start accepts. Automaton has 318 states and 720 transitions. Word has length 16
[2020-10-21 22:01:21,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,753 INFO  L481      AbstractCegarLoop]: Abstraction has 318 states and 720 transitions.
[2020-10-21 22:01:21,754 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-21 22:01:21,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 318 states and 720 transitions.
[2020-10-21 22:01:21,755 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-21 22:01:21,755 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,755 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,755 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-21 22:01:21,755 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,755 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,756 INFO  L82        PathProgramCache]: Analyzing trace with hash 1009884994, now seen corresponding path program 1 times
[2020-10-21 22:01:21,756 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,756 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339094415]
[2020-10-21 22:01:21,756 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:21,818 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:21,818 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339094415]
[2020-10-21 22:01:21,819 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:21,819 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-21 22:01:21,819 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377039664]
[2020-10-21 22:01:21,819 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-21 22:01:21,820 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:21,820 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-21 22:01:21,820 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-21 22:01:21,820 INFO  L87              Difference]: Start difference. First operand 318 states and 720 transitions. Second operand 5 states.
[2020-10-21 22:01:21,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:21,863 INFO  L93              Difference]: Finished difference Result 253 states and 512 transitions.
[2020-10-21 22:01:21,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-21 22:01:21,863 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-21 22:01:21,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:21,865 INFO  L225             Difference]: With dead ends: 253
[2020-10-21 22:01:21,865 INFO  L226             Difference]: Without dead ends: 200
[2020-10-21 22:01:21,865 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:21,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2020-10-21 22:01:21,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 195.
[2020-10-21 22:01:21,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 195 states.
[2020-10-21 22:01:21,871 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 388 transitions.
[2020-10-21 22:01:21,871 INFO  L78                 Accepts]: Start accepts. Automaton has 195 states and 388 transitions. Word has length 17
[2020-10-21 22:01:21,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:21,871 INFO  L481      AbstractCegarLoop]: Abstraction has 195 states and 388 transitions.
[2020-10-21 22:01:21,871 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-21 22:01:21,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 195 states and 388 transitions.
[2020-10-21 22:01:21,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:01:21,872 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:21,872 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:21,873 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-21 22:01:21,873 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:21,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:21,873 INFO  L82        PathProgramCache]: Analyzing trace with hash 461994248, now seen corresponding path program 1 times
[2020-10-21 22:01:21,873 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:21,874 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323563206]
[2020-10-21 22:01:21,874 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:21,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:22,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:22,186 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323563206]
[2020-10-21 22:01:22,187 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:22,187 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-21 22:01:22,187 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009916827]
[2020-10-21 22:01:22,188 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-21 22:01:22,188 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:22,188 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-21 22:01:22,188 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-21 22:01:22,188 INFO  L87              Difference]: Start difference. First operand 195 states and 388 transitions. Second operand 9 states.
[2020-10-21 22:01:22,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:22,510 INFO  L93              Difference]: Finished difference Result 221 states and 425 transitions.
[2020-10-21 22:01:22,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-21 22:01:22,511 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 19
[2020-10-21 22:01:22,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:22,512 INFO  L225             Difference]: With dead ends: 221
[2020-10-21 22:01:22,513 INFO  L226             Difference]: Without dead ends: 145
[2020-10-21 22:01:22,513 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182
[2020-10-21 22:01:22,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2020-10-21 22:01:22,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131.
[2020-10-21 22:01:22,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 131 states.
[2020-10-21 22:01:22,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions.
[2020-10-21 22:01:22,517 INFO  L78                 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19
[2020-10-21 22:01:22,517 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:22,517 INFO  L481      AbstractCegarLoop]: Abstraction has 131 states and 262 transitions.
[2020-10-21 22:01:22,518 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-21 22:01:22,518 INFO  L276                IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions.
[2020-10-21 22:01:22,518 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-21 22:01:22,518 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:22,518 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:22,519 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-21 22:01:22,519 INFO  L429      AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:22,519 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:22,519 INFO  L82        PathProgramCache]: Analyzing trace with hash -660289219, now seen corresponding path program 1 times
[2020-10-21 22:01:22,519 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:22,520 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519040059]
[2020-10-21 22:01:22,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-21 22:01:22,594 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-21 22:01:22,594 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519040059]
[2020-10-21 22:01:22,595 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-21 22:01:22,595 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-21 22:01:22,595 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709199200]
[2020-10-21 22:01:22,595 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-21 22:01:22,595 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-21 22:01:22,596 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-21 22:01:22,596 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-21 22:01:22,596 INFO  L87              Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states.
[2020-10-21 22:01:22,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-21 22:01:22,648 INFO  L93              Difference]: Finished difference Result 112 states and 223 transitions.
[2020-10-21 22:01:22,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-21 22:01:22,649 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-21 22:01:22,649 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-21 22:01:22,650 INFO  L225             Difference]: With dead ends: 112
[2020-10-21 22:01:22,650 INFO  L226             Difference]: Without dead ends: 63
[2020-10-21 22:01:22,651 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-21 22:01:22,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-10-21 22:01:22,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-10-21 22:01:22,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2020-10-21 22:01:22,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions.
[2020-10-21 22:01:22,654 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19
[2020-10-21 22:01:22,655 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-21 22:01:22,655 INFO  L481      AbstractCegarLoop]: Abstraction has 63 states and 110 transitions.
[2020-10-21 22:01:22,655 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-21 22:01:22,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions.
[2020-10-21 22:01:22,655 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-21 22:01:22,656 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-21 22:01:22,656 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-21 22:01:22,656 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-10-21 22:01:22,656 INFO  L429      AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-21 22:01:22,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-21 22:01:22,656 INFO  L82        PathProgramCache]: Analyzing trace with hash -2015795615, now seen corresponding path program 1 times
[2020-10-21 22:01:22,657 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-21 22:01:22,657 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634293132]
[2020-10-21 22:01:22,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-21 22:01:22,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:22,714 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:22,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-21 22:01:22,781 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-21 22:01:22,853 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-21 22:01:22,853 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-21 22:01:22,854 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-10-21 22:01:22,879 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,880 WARN  L224     RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740]
[2020-10-21 22:01:22,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,889 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,889 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,890 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,890 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,890 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,890 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,891 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,891 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,891 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,891 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,892 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,892 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,892 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,892 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,893 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,893 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,893 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,893 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,894 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,894 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,894 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,894 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,894 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,894 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,894 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,895 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,895 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,895 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,897 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,897 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,897 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,898 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,902 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,902 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,902 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,903 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,903 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,903 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,904 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,904 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,904 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,904 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,904 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,904 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,905 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,905 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,905 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,905 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,906 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,906 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,907 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-21 22:01:22,907 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-21 22:01:22,996 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 10:01:22 BasicIcfg
[2020-10-21 22:01:22,996 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-21 22:01:22,998 INFO  L168              Benchmark]: Toolchain (without parser) took 15767.81 ms. Allocated memory was 141.0 MB in the beginning and 414.7 MB in the end (delta: 273.7 MB). Free memory was 102.1 MB in the beginning and 138.6 MB in the end (delta: -36.5 MB). Peak memory consumption was 237.2 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:22,998 INFO  L168              Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
[2020-10-21 22:01:22,999 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 783.32 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 101.0 MB in the beginning and 150.6 MB in the end (delta: -49.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:22,999 INFO  L168              Benchmark]: Boogie Procedure Inliner took 70.75 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 147.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:23,000 INFO  L168              Benchmark]: Boogie Preprocessor took 57.66 ms. Allocated memory is still 200.3 MB. Free memory was 147.3 MB in the beginning and 144.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:23,001 INFO  L168              Benchmark]: RCFGBuilder took 2238.51 ms. Allocated memory was 200.3 MB in the beginning and 246.4 MB in the end (delta: 46.1 MB). Free memory was 144.7 MB in the beginning and 152.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:23,001 INFO  L168              Benchmark]: TraceAbstraction took 12606.39 ms. Allocated memory was 246.4 MB in the beginning and 414.7 MB in the end (delta: 168.3 MB). Free memory was 150.6 MB in the beginning and 138.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB.
[2020-10-21 22:01:23,005 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.26 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 783.32 ms. Allocated memory was 141.0 MB in the beginning and 200.3 MB in the end (delta: 59.2 MB). Free memory was 101.0 MB in the beginning and 150.6 MB in the end (delta: -49.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 70.75 ms. Allocated memory is still 200.3 MB. Free memory was 150.6 MB in the beginning and 147.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 57.66 ms. Allocated memory is still 200.3 MB. Free memory was 147.3 MB in the beginning and 144.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2238.51 ms. Allocated memory was 200.3 MB in the beginning and 246.4 MB in the end (delta: 46.1 MB). Free memory was 144.7 MB in the beginning and 152.4 MB in the end (delta: -7.7 MB). Peak memory consumption was 99.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 12606.39 ms. Allocated memory was 246.4 MB in the beginning and 414.7 MB in the end (delta: 168.3 MB). Free memory was 150.6 MB in the beginning and 138.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1325 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 170 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.7s, 108 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 4899 MoverChecksTotal
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L712]               0  _Bool main$tmp_guard0;
[L713]               0  _Bool main$tmp_guard1;
[L715]               0  int x = 0;
[L717]               0  int y = 0;
[L719]               0  int z = 0;
[L720]               0  _Bool z$flush_delayed;
[L721]               0  int z$mem_tmp;
[L722]               0  _Bool z$r_buff0_thd0;
[L723]               0  _Bool z$r_buff0_thd1;
[L724]               0  _Bool z$r_buff0_thd2;
[L725]               0  _Bool z$r_buff0_thd3;
[L726]               0  _Bool z$r_buff1_thd0;
[L727]               0  _Bool z$r_buff1_thd1;
[L728]               0  _Bool z$r_buff1_thd2;
[L729]               0  _Bool z$r_buff1_thd3;
[L730]               0  _Bool z$read_delayed;
[L731]               0  int *z$read_delayed_var;
[L732]               0  int z$w_buff0;
[L733]               0  _Bool z$w_buff0_used;
[L734]               0  int z$w_buff1;
[L735]               0  _Bool z$w_buff1_used;
[L736]               0  _Bool weak$$choice0;
[L737]               0  _Bool weak$$choice2;
[L818]               0  pthread_t t2031;
[L819]  FCALL, FORK  0  pthread_create(&t2031, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L741]               1  z$w_buff1 = z$w_buff0
[L742]               1  z$w_buff0 = 2
[L743]               1  z$w_buff1_used = z$w_buff0_used
[L744]               1  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   1  !(!expression)
[L746]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L747]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L748]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L749]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L750]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L820]               0  pthread_t t2032;
[L821]  FCALL, FORK  0  pthread_create(&t2032, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L822]               0  pthread_t t2033;
[L823]  FCALL, FORK  0  pthread_create(&t2033, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L753]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L770]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]  EXPR         2  z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z
[L776]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L776]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L777]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L777]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L778]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L778]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L779]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L779]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L780]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L780]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L790]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L785]               2  return 0;
[L793]               3  z = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L756]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L757]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L757]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L758]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L758]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L759]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L759]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L760]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L760]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L765]               1  return 0;
[L796]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L796]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L796]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L796]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L797]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L797]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L798]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L798]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L799]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L799]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L800]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L800]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L803]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L805]               3  return 0;
[L825]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L829]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L829]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L829]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L829]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L830]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L830]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L831]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L831]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L832]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L832]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L833]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L833]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L836]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L837]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L838]               0  z$flush_delayed = weak$$choice2
[L839]               0  z$mem_tmp = z
[L840]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L840]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L841]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L841]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L842]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L842]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L842]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L842]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L843]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L843]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L844]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L844]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L845]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L846]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L846]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L847]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L848]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L848]               0  z = z$flush_delayed ? z$mem_tmp : z
[L849]               0  z$flush_delayed = (_Bool)0
[L18]   COND TRUE    0  !expression
[L17]   COND FALSE   0  !(0)
[L17]                0  __assert_fail ("0", "safe011_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 489 SDtfs, 601 SDslu, 1078 SDs, 0 SdLazy, 643 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 273 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 275 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 34036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...