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


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:52:24,905 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:52:24,907 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:52:24,931 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:52:24,932 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:52:24,933 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:52:24,934 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:52:24,936 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:52:24,938 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:52:24,938 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:52:24,939 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:52:24,940 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:52:24,941 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:52:24,942 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:52:24,943 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:52:24,944 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:52:24,945 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:52:24,946 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:52:24,947 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:52:24,949 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:52:24,950 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:52:24,951 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:52:24,952 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:52:24,953 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:52:24,956 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:52:24,956 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:52:24,956 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:52:24,957 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:52:24,960 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:52:24,961 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:52:24,961 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:52:24,961 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:52:24,962 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:52:24,965 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:52:24,966 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:52:24,967 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:52:24,968 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:52:24,968 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:52:24,968 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:52:24,969 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:52:24,970 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:52:24,976 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-11 14:52:25,023 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:52:25,023 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:52:25,025 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:52:25,025 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:52:25,028 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:52:25,029 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:52:25,029 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:52:25,029 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:52:25,029 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:52:25,029 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:52:25,030 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:52:25,030 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:52:25,030 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:52:25,030 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:52:25,030 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:52:25,031 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:52:25,031 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:52:25,031 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:52:25,031 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:52:25,031 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:52:25,032 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:52:25,032 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:52:25,034 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:52:25,034 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:52:25,034 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:52:25,034 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:52:25,034 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:52:25,035 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:52:25,035 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:52:25,035 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:52:25,355 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:52:25,368 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:52:25,373 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:52:25,375 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:52:25,375 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:52:25,376 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i
[2020-10-11 14:52:25,443 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730e58f88/f2fb78e737b743cd95d62be6ab667edd/FLAG07a4556cd
[2020-10-11 14:52:26,030 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:52:26,030 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i
[2020-10-11 14:52:26,054 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730e58f88/f2fb78e737b743cd95d62be6ab667edd/FLAG07a4556cd
[2020-10-11 14:52:26,266 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/730e58f88/f2fb78e737b743cd95d62be6ab667edd
[2020-10-11 14:52:26,275 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:52:26,277 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:52:26,278 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:52:26,279 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:52:26,282 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:52:26,283 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:26" (1/1) ...
[2020-10-11 14:52:26,286 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b3c5560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:26, skipping insertion in model container
[2020-10-11 14:52:26,286 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:52:26" (1/1) ...
[2020-10-11 14:52:26,294 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:52:26,342 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:52:26,833 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:52:26,851 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:52:26,947 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:52:27,022 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:52:27,022 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27 WrapperNode
[2020-10-11 14:52:27,022 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:52:27,023 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:52:27,024 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:52:27,024 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:52:27,033 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,055 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,093 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:52:27,093 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:52:27,093 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:52:27,094 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:52:27,103 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,103 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,108 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,109 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,120 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,124 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,128 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (1/1) ...
[2020-10-11 14:52:27,134 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:52:27,134 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:52:27,134 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:52:27,135 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:52:27,136 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (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-11 14:52:27,210 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:52:27,211 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:52:27,211 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:52:27,211 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:52:27,211 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:52:27,212 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:52:27,212 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:52:27,213 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:52:27,213 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:52:27,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:52:27,214 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2020-10-11 14:52:27,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2020-10-11 14:52:27,214 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:52:27,215 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:52:27,215 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:52:27,217 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-11 14:52:29,217 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:52:29,217 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:52:29,219 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:29 BoogieIcfgContainer
[2020-10-11 14:52:29,220 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:52:29,221 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:52:29,221 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:52:29,225 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:52:29,225 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:52:26" (1/3) ...
[2020-10-11 14:52:29,226 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e289e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:29, skipping insertion in model container
[2020-10-11 14:52:29,226 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:52:27" (2/3) ...
[2020-10-11 14:52:29,227 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e289e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:52:29, skipping insertion in model container
[2020-10-11 14:52:29,227 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:52:29" (3/3) ...
[2020-10-11 14:52:29,229 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i
[2020-10-11 14:52:29,241 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:52:29,241 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:52:29,249 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:52:29,250 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:52:29,281 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,282 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,282 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,282 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,283 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,283 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,283 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,284 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,284 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,284 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,284 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,284 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,285 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,285 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,285 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,286 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,287 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,287 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,287 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,288 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,288 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,289 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,289 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,289 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,289 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,289 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,290 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,290 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,290 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,290 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,290 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,291 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,291 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,291 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,292 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,292 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,296 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,296 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,296 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,296 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,299 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,299 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,300 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,300 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,300 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,300 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,300 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,301 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,301 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,301 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,303 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,303 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,303 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,303 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,304 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,304 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,304 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,304 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,305 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,305 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,305 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,305 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,307 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,308 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:52:29,323 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-10-11 14:52:29,345 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:52:29,345 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:52:29,345 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:52:29,345 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:52:29,345 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:52:29,346 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:52:29,346 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:52:29,346 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:52:29,360 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:52:29,363 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow
[2020-10-11 14:52:29,366 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow
[2020-10-11 14:52:29,369 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow
[2020-10-11 14:52:29,424 INFO  L129       PetriNetUnfolder]: 2/108 cut-off events.
[2020-10-11 14:52:29,425 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:52:29,430 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. 
[2020-10-11 14:52:29,436 INFO  L117        LiptonReduction]: Number of co-enabled transitions 2540
[2020-10-11 14:52:29,776 WARN  L193               SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45
[2020-10-11 14:52:30,188 WARN  L193               SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-11 14:52:30,332 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,333 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:30,335 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:52:30,335 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:30,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,376 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,515 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,516 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,517 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,517 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,522 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:30,522 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:52:30,526 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:30,527 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,577 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,578 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:30,580 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,581 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,582 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,582 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,586 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,589 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,591 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,592 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,594 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:30,594 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,598 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,598 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,685 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,686 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,707 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,708 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,708 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,709 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,739 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,741 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,761 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,762 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,763 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,817 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:30,840 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:30,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,855 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,855 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,858 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,861 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,861 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:30,864 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:30,867 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:30,867 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,869 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,968 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:30,968 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:30,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:30,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:30,976 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:52:30,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:30,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:32,483 WARN  L193               SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 230 DAG size of output: 189
[2020-10-11 14:52:32,490 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term
[2020-10-11 14:52:32,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:32,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:32,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,457 WARN  L193               SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127
[2020-10-11 14:52:33,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,512 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,512 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,513 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term
[2020-10-11 14:52:33,513 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,548 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,556 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,558 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,562 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:33,564 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,564 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:33,565 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,566 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:33,568 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:33,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,570 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,571 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,572 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,572 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,627 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,629 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:33,630 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-11 14:52:33,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term
[2020-10-11 14:52:33,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,680 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,681 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,698 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,698 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,699 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,699 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,765 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,766 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,789 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term
[2020-10-11 14:52:33,789 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,790 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term
[2020-10-11 14:52:33,791 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,875 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:33,875 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:33,887 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,888 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,888 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,889 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:33,890 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:33,891 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:33,892 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:33,893 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:33,945 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:52:33,946 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:34,608 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:34,609 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:34,610 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-11 14:52:34,610 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:34,611 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:34,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:34,614 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,645 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,648 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:34,649 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:34,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,668 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:34,668 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:34,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:34,672 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:34,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:52:34,924 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:35,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:35,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:52:35,028 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:35,028 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:35,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:35,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 6, 5, 1] term
[2020-10-11 14:52:35,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:35,044 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:35,045 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:35,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,047 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,049 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,050 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 6, 5, 6, 5, 1] term
[2020-10-11 14:52:35,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,053 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:35,054 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:35,863 WARN  L193               SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129
[2020-10-11 14:52:36,223 WARN  L193               SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-11 14:52:37,161 WARN  L193               SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111
[2020-10-11 14:52:37,463 WARN  L193               SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 108
[2020-10-11 14:52:37,633 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:37,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:37,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:37,634 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:37,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:37,636 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:37,638 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:37,638 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:37,649 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:37,649 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:37,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:37,650 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:37,651 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:37,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:37,655 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:37,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:38,519 WARN  L193               SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 136
[2020-10-11 14:52:38,870 WARN  L193               SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 134
[2020-10-11 14:52:38,921 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:38,922 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:38,923 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:38,923 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:38,926 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:38,926 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:38,928 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:38,928 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:52:38,947 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:38,948 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:38,948 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:38,949 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:52:38,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:52:38,955 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:38,957 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:52:38,960 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:52:39,534 WARN  L193               SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97
[2020-10-11 14:52:39,675 WARN  L193               SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2020-10-11 14:52:39,687 INFO  L132        LiptonReduction]: Checked pairs total: 6932
[2020-10-11 14:52:39,687 INFO  L134        LiptonReduction]: Total number of compositions: 93
[2020-10-11 14:52:39,694 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow
[2020-10-11 14:52:39,873 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states.
[2020-10-11 14:52:39,875 INFO  L276                IsEmpty]: Start isEmpty. Operand 3002 states.
[2020-10-11 14:52:39,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:52:39,884 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:39,885 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:39,885 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:39,891 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:39,891 INFO  L82        PathProgramCache]: Analyzing trace with hash 1805630863, now seen corresponding path program 1 times
[2020-10-11 14:52:39,902 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:39,902 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775123487]
[2020-10-11 14:52:39,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:40,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:40,197 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-11 14:52:40,198 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775123487]
[2020-10-11 14:52:40,199 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:40,199 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:52:40,200 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016923329]
[2020-10-11 14:52:40,206 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:52:40,206 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:40,223 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:52:40,224 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:40,226 INFO  L87              Difference]: Start difference. First operand 3002 states. Second operand 3 states.
[2020-10-11 14:52:40,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:40,358 INFO  L93              Difference]: Finished difference Result 2602 states and 10064 transitions.
[2020-10-11 14:52:40,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:40,361 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:52:40,361 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:40,402 INFO  L225             Difference]: With dead ends: 2602
[2020-10-11 14:52:40,402 INFO  L226             Difference]: Without dead ends: 2122
[2020-10-11 14:52:40,403 INFO  L673         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-11 14:52:40,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2122 states.
[2020-10-11 14:52:40,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122.
[2020-10-11 14:52:40,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2122 states.
[2020-10-11 14:52:40,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions.
[2020-10-11 14:52:40,608 INFO  L78                 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9
[2020-10-11 14:52:40,609 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:40,610 INFO  L481      AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions.
[2020-10-11 14:52:40,610 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:52:40,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions.
[2020-10-11 14:52:40,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:52:40,615 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:40,615 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:40,615 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:52:40,616 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:40,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:40,616 INFO  L82        PathProgramCache]: Analyzing trace with hash 44553062, now seen corresponding path program 1 times
[2020-10-11 14:52:40,616 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:40,617 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737608034]
[2020-10-11 14:52:40,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:40,699 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:40,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:52:40,776 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737608034]
[2020-10-11 14:52:40,776 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:40,776 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:52:40,776 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75971211]
[2020-10-11 14:52:40,780 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:52:40,780 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:40,780 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:52:40,781 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:40,781 INFO  L87              Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states.
[2020-10-11 14:52:40,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:40,840 INFO  L93              Difference]: Finished difference Result 2112 states and 8032 transitions.
[2020-10-11 14:52:40,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:40,841 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-11 14:52:40,841 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:40,859 INFO  L225             Difference]: With dead ends: 2112
[2020-10-11 14:52:40,860 INFO  L226             Difference]: Without dead ends: 2112
[2020-10-11 14:52:40,861 INFO  L673         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-11 14:52:40,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2112 states.
[2020-10-11 14:52:40,924 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112.
[2020-10-11 14:52:40,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2112 states.
[2020-10-11 14:52:40,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 8032 transitions.
[2020-10-11 14:52:40,937 INFO  L78                 Accepts]: Start accepts. Automaton has 2112 states and 8032 transitions. Word has length 11
[2020-10-11 14:52:40,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:40,937 INFO  L481      AbstractCegarLoop]: Abstraction has 2112 states and 8032 transitions.
[2020-10-11 14:52:40,937 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:52:40,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 2112 states and 8032 transitions.
[2020-10-11 14:52:40,940 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:52:40,940 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:40,940 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:40,940 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:52:40,941 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:40,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:40,941 INFO  L82        PathProgramCache]: Analyzing trace with hash 1866863478, now seen corresponding path program 1 times
[2020-10-11 14:52:40,941 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:40,942 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755680556]
[2020-10-11 14:52:40,942 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:40,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:41,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:52:41,029 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755680556]
[2020-10-11 14:52:41,030 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:41,030 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:52:41,031 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980462417]
[2020-10-11 14:52:41,031 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:52:41,031 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:41,031 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:52:41,032 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:41,032 INFO  L87              Difference]: Start difference. First operand 2112 states and 8032 transitions. Second operand 3 states.
[2020-10-11 14:52:41,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:41,084 INFO  L93              Difference]: Finished difference Result 2042 states and 7736 transitions.
[2020-10-11 14:52:41,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:41,085 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-11 14:52:41,085 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:41,102 INFO  L225             Difference]: With dead ends: 2042
[2020-10-11 14:52:41,102 INFO  L226             Difference]: Without dead ends: 2042
[2020-10-11 14:52:41,103 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:41,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2042 states.
[2020-10-11 14:52:41,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042.
[2020-10-11 14:52:41,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2042 states.
[2020-10-11 14:52:41,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7736 transitions.
[2020-10-11 14:52:41,171 INFO  L78                 Accepts]: Start accepts. Automaton has 2042 states and 7736 transitions. Word has length 12
[2020-10-11 14:52:41,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:41,172 INFO  L481      AbstractCegarLoop]: Abstraction has 2042 states and 7736 transitions.
[2020-10-11 14:52:41,172 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:52:41,172 INFO  L276                IsEmpty]: Start isEmpty. Operand 2042 states and 7736 transitions.
[2020-10-11 14:52:41,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:52:41,174 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:41,174 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:41,174 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:52:41,174 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:41,174 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:41,175 INFO  L82        PathProgramCache]: Analyzing trace with hash 1379604367, now seen corresponding path program 1 times
[2020-10-11 14:52:41,175 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:41,175 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556853266]
[2020-10-11 14:52:41,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:41,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:41,263 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-11 14:52:41,263 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556853266]
[2020-10-11 14:52:41,264 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:41,264 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:52:41,264 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419035377]
[2020-10-11 14:52:41,264 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:52:41,265 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:41,265 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:52:41,265 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:52:41,265 INFO  L87              Difference]: Start difference. First operand 2042 states and 7736 transitions. Second operand 5 states.
[2020-10-11 14:52:41,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:41,338 INFO  L93              Difference]: Finished difference Result 2030 states and 7676 transitions.
[2020-10-11 14:52:41,342 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:41,342 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-11 14:52:41,343 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:41,360 INFO  L225             Difference]: With dead ends: 2030
[2020-10-11 14:52:41,361 INFO  L226             Difference]: Without dead ends: 2030
[2020-10-11 14:52:41,361 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:52:41,373 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2030 states.
[2020-10-11 14:52:41,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2030.
[2020-10-11 14:52:41,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2030 states.
[2020-10-11 14:52:41,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 7676 transitions.
[2020-10-11 14:52:41,430 INFO  L78                 Accepts]: Start accepts. Automaton has 2030 states and 7676 transitions. Word has length 12
[2020-10-11 14:52:41,430 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:41,430 INFO  L481      AbstractCegarLoop]: Abstraction has 2030 states and 7676 transitions.
[2020-10-11 14:52:41,430 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:52:41,430 INFO  L276                IsEmpty]: Start isEmpty. Operand 2030 states and 7676 transitions.
[2020-10-11 14:52:41,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:52:41,432 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:41,432 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:41,432 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:52:41,432 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:41,433 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:41,433 INFO  L82        PathProgramCache]: Analyzing trace with hash 2036652415, now seen corresponding path program 1 times
[2020-10-11 14:52:41,433 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:41,433 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627125818]
[2020-10-11 14:52:41,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:41,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:41,478 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-11 14:52:41,478 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627125818]
[2020-10-11 14:52:41,479 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:41,479 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:52:41,479 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276016404]
[2020-10-11 14:52:41,479 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:52:41,479 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:41,480 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:52:41,480 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:41,480 INFO  L87              Difference]: Start difference. First operand 2030 states and 7676 transitions. Second operand 3 states.
[2020-10-11 14:52:41,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:41,503 INFO  L93              Difference]: Finished difference Result 1954 states and 7352 transitions.
[2020-10-11 14:52:41,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:41,504 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-11 14:52:41,505 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:41,522 INFO  L225             Difference]: With dead ends: 1954
[2020-10-11 14:52:41,523 INFO  L226             Difference]: Without dead ends: 1954
[2020-10-11 14:52:41,523 INFO  L673         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-11 14:52:41,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1954 states.
[2020-10-11 14:52:41,639 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954.
[2020-10-11 14:52:41,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1954 states.
[2020-10-11 14:52:41,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 7352 transitions.
[2020-10-11 14:52:41,650 INFO  L78                 Accepts]: Start accepts. Automaton has 1954 states and 7352 transitions. Word has length 13
[2020-10-11 14:52:41,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:41,650 INFO  L481      AbstractCegarLoop]: Abstraction has 1954 states and 7352 transitions.
[2020-10-11 14:52:41,650 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:52:41,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 1954 states and 7352 transitions.
[2020-10-11 14:52:41,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 14:52:41,652 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:41,652 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:41,653 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:52:41,653 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:41,653 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:41,653 INFO  L82        PathProgramCache]: Analyzing trace with hash -1289139937, now seen corresponding path program 1 times
[2020-10-11 14:52:41,653 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:41,654 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110896662]
[2020-10-11 14:52:41,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:41,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:41,772 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-11 14:52:41,773 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110896662]
[2020-10-11 14:52:41,774 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:41,774 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:52:41,775 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269269104]
[2020-10-11 14:52:41,776 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:52:41,776 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:41,776 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:52:41,776 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:52:41,776 INFO  L87              Difference]: Start difference. First operand 1954 states and 7352 transitions. Second operand 5 states.
[2020-10-11 14:52:41,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:41,868 INFO  L93              Difference]: Finished difference Result 1898 states and 7104 transitions.
[2020-10-11 14:52:41,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:52:41,870 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-11 14:52:41,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:41,885 INFO  L225             Difference]: With dead ends: 1898
[2020-10-11 14:52:41,885 INFO  L226             Difference]: Without dead ends: 1898
[2020-10-11 14:52:41,886 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:52:41,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1898 states.
[2020-10-11 14:52:41,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1898.
[2020-10-11 14:52:41,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1898 states.
[2020-10-11 14:52:41,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions.
[2020-10-11 14:52:41,943 INFO  L78                 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 14
[2020-10-11 14:52:41,943 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:41,943 INFO  L481      AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions.
[2020-10-11 14:52:41,944 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:52:41,944 INFO  L276                IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions.
[2020-10-11 14:52:41,946 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:52:41,947 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:41,947 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:41,947 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:52:41,947 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:41,947 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:41,948 INFO  L82        PathProgramCache]: Analyzing trace with hash 366071342, now seen corresponding path program 1 times
[2020-10-11 14:52:41,948 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:41,948 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385789]
[2020-10-11 14:52:41,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:41,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:42,011 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-11 14:52:42,012 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385789]
[2020-10-11 14:52:42,012 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:42,012 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:52:42,012 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459232364]
[2020-10-11 14:52:42,013 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:52:42,013 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:42,013 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:52:42,013 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:52:42,014 INFO  L87              Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 4 states.
[2020-10-11 14:52:42,087 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:42,087 INFO  L93              Difference]: Finished difference Result 1866 states and 6962 transitions.
[2020-10-11 14:52:42,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:52:42,088 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2020-10-11 14:52:42,089 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:42,100 INFO  L225             Difference]: With dead ends: 1866
[2020-10-11 14:52:42,100 INFO  L226             Difference]: Without dead ends: 1866
[2020-10-11 14:52:42,101 INFO  L673         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-11 14:52:42,110 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1866 states.
[2020-10-11 14:52:42,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866.
[2020-10-11 14:52:42,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1866 states.
[2020-10-11 14:52:42,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6962 transitions.
[2020-10-11 14:52:42,157 INFO  L78                 Accepts]: Start accepts. Automaton has 1866 states and 6962 transitions. Word has length 15
[2020-10-11 14:52:42,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:42,157 INFO  L481      AbstractCegarLoop]: Abstraction has 1866 states and 6962 transitions.
[2020-10-11 14:52:42,158 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:52:42,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 1866 states and 6962 transitions.
[2020-10-11 14:52:42,161 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-11 14:52:42,161 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:42,161 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:42,161 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:52:42,161 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:42,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:42,162 INFO  L82        PathProgramCache]: Analyzing trace with hash -1976465858, now seen corresponding path program 1 times
[2020-10-11 14:52:42,162 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:42,162 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076894964]
[2020-10-11 14:52:42,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:42,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:42,240 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-11 14:52:42,241 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076894964]
[2020-10-11 14:52:42,241 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:42,241 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:52:42,241 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476249692]
[2020-10-11 14:52:42,242 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:52:42,243 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:42,244 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:52:42,245 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:52:42,245 INFO  L87              Difference]: Start difference. First operand 1866 states and 6962 transitions. Second operand 4 states.
[2020-10-11 14:52:42,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:42,309 INFO  L93              Difference]: Finished difference Result 1930 states and 6566 transitions.
[2020-10-11 14:52:42,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:52:42,311 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2020-10-11 14:52:42,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:42,316 INFO  L225             Difference]: With dead ends: 1930
[2020-10-11 14:52:42,317 INFO  L226             Difference]: Without dead ends: 1450
[2020-10-11 14:52:42,317 INFO  L673         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-11 14:52:42,324 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1450 states.
[2020-10-11 14:52:42,351 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450.
[2020-10-11 14:52:42,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1450 states.
[2020-10-11 14:52:42,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 4882 transitions.
[2020-10-11 14:52:42,357 INFO  L78                 Accepts]: Start accepts. Automaton has 1450 states and 4882 transitions. Word has length 16
[2020-10-11 14:52:42,357 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:42,357 INFO  L481      AbstractCegarLoop]: Abstraction has 1450 states and 4882 transitions.
[2020-10-11 14:52:42,357 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:52:42,357 INFO  L276                IsEmpty]: Start isEmpty. Operand 1450 states and 4882 transitions.
[2020-10-11 14:52:42,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-11 14:52:42,360 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:42,360 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:42,360 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:52:42,360 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:42,361 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:42,361 INFO  L82        PathProgramCache]: Analyzing trace with hash -1140592967, now seen corresponding path program 1 times
[2020-10-11 14:52:42,361 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:42,361 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039101792]
[2020-10-11 14:52:42,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:42,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:42,435 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-11 14:52:42,435 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039101792]
[2020-10-11 14:52:42,436 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:42,436 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:52:42,436 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537383352]
[2020-10-11 14:52:42,436 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:52:42,437 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:42,437 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:52:42,437 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:52:42,437 INFO  L87              Difference]: Start difference. First operand 1450 states and 4882 transitions. Second operand 5 states.
[2020-10-11 14:52:42,496 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:42,496 INFO  L93              Difference]: Finished difference Result 1251 states and 3871 transitions.
[2020-10-11 14:52:42,497 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:52:42,497 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 17
[2020-10-11 14:52:42,497 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:42,501 INFO  L225             Difference]: With dead ends: 1251
[2020-10-11 14:52:42,502 INFO  L226             Difference]: Without dead ends: 951
[2020-10-11 14:52:42,502 INFO  L673         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-11 14:52:42,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 951 states.
[2020-10-11 14:52:42,522 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951.
[2020-10-11 14:52:42,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 951 states.
[2020-10-11 14:52:42,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2886 transitions.
[2020-10-11 14:52:42,526 INFO  L78                 Accepts]: Start accepts. Automaton has 951 states and 2886 transitions. Word has length 17
[2020-10-11 14:52:42,526 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:42,526 INFO  L481      AbstractCegarLoop]: Abstraction has 951 states and 2886 transitions.
[2020-10-11 14:52:42,526 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:52:42,526 INFO  L276                IsEmpty]: Start isEmpty. Operand 951 states and 2886 transitions.
[2020-10-11 14:52:42,528 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2020-10-11 14:52:42,529 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:42,529 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:42,529 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:52:42,529 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:42,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:42,530 INFO  L82        PathProgramCache]: Analyzing trace with hash 709308523, now seen corresponding path program 1 times
[2020-10-11 14:52:42,530 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:42,530 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356498286]
[2020-10-11 14:52:42,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:42,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:42,629 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-11 14:52:42,630 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356498286]
[2020-10-11 14:52:42,630 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:42,630 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:52:42,630 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158973150]
[2020-10-11 14:52:42,631 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:52:42,631 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:42,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:52:42,631 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:52:42,632 INFO  L87              Difference]: Start difference. First operand 951 states and 2886 transitions. Second operand 6 states.
[2020-10-11 14:52:42,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:42,723 INFO  L93              Difference]: Finished difference Result 827 states and 2481 transitions.
[2020-10-11 14:52:42,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:52:42,724 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2020-10-11 14:52:42,724 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:42,727 INFO  L225             Difference]: With dead ends: 827
[2020-10-11 14:52:42,727 INFO  L226             Difference]: Without dead ends: 728
[2020-10-11 14:52:42,728 INFO  L673         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-11 14:52:42,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2020-10-11 14:52:42,749 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728.
[2020-10-11 14:52:42,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 728 states.
[2020-10-11 14:52:42,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 2217 transitions.
[2020-10-11 14:52:42,752 INFO  L78                 Accepts]: Start accepts. Automaton has 728 states and 2217 transitions. Word has length 19
[2020-10-11 14:52:42,754 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:42,754 INFO  L481      AbstractCegarLoop]: Abstraction has 728 states and 2217 transitions.
[2020-10-11 14:52:42,754 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:52:42,754 INFO  L276                IsEmpty]: Start isEmpty. Operand 728 states and 2217 transitions.
[2020-10-11 14:52:42,757 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:52:42,757 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:42,757 INFO  L421         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-11 14:52:42,757 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:52:42,757 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:42,758 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:42,758 INFO  L82        PathProgramCache]: Analyzing trace with hash -1754550781, now seen corresponding path program 1 times
[2020-10-11 14:52:42,758 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:42,758 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931928241]
[2020-10-11 14:52:42,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:42,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:42,900 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-11 14:52:42,900 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931928241]
[2020-10-11 14:52:42,900 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:42,901 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:52:42,901 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177487964]
[2020-10-11 14:52:42,901 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:52:42,902 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:42,902 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:52:42,902 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:52:42,903 INFO  L87              Difference]: Start difference. First operand 728 states and 2217 transitions. Second operand 9 states.
[2020-10-11 14:52:43,055 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:43,056 INFO  L93              Difference]: Finished difference Result 1058 states and 3156 transitions.
[2020-10-11 14:52:43,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-11 14:52:43,056 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2020-10-11 14:52:43,057 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:43,059 INFO  L225             Difference]: With dead ends: 1058
[2020-10-11 14:52:43,059 INFO  L226             Difference]: Without dead ends: 854
[2020-10-11 14:52:43,060 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-10-11 14:52:43,063 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 854 states.
[2020-10-11 14:52:43,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 802.
[2020-10-11 14:52:43,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 802 states.
[2020-10-11 14:52:43,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2385 transitions.
[2020-10-11 14:52:43,085 INFO  L78                 Accepts]: Start accepts. Automaton has 802 states and 2385 transitions. Word has length 22
[2020-10-11 14:52:43,085 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:43,085 INFO  L481      AbstractCegarLoop]: Abstraction has 802 states and 2385 transitions.
[2020-10-11 14:52:43,085 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:52:43,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 802 states and 2385 transitions.
[2020-10-11 14:52:43,087 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:52:43,088 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:43,088 INFO  L421         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-11 14:52:43,088 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:52:43,088 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:43,088 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:43,089 INFO  L82        PathProgramCache]: Analyzing trace with hash -843942049, now seen corresponding path program 2 times
[2020-10-11 14:52:43,089 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:43,089 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596173911]
[2020-10-11 14:52:43,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:43,118 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:43,220 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-11 14:52:43,220 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596173911]
[2020-10-11 14:52:43,220 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:43,221 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:52:43,221 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275355450]
[2020-10-11 14:52:43,221 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:52:43,221 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:43,222 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:52:43,222 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:52:43,222 INFO  L87              Difference]: Start difference. First operand 802 states and 2385 transitions. Second operand 9 states.
[2020-10-11 14:52:43,348 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:43,348 INFO  L93              Difference]: Finished difference Result 999 states and 2814 transitions.
[2020-10-11 14:52:43,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-10-11 14:52:43,349 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2020-10-11 14:52:43,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:43,351 INFO  L225             Difference]: With dead ends: 999
[2020-10-11 14:52:43,351 INFO  L226             Difference]: Without dead ends: 945
[2020-10-11 14:52:43,352 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-10-11 14:52:43,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 945 states.
[2020-10-11 14:52:43,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 849.
[2020-10-11 14:52:43,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 849 states.
[2020-10-11 14:52:43,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2468 transitions.
[2020-10-11 14:52:43,372 INFO  L78                 Accepts]: Start accepts. Automaton has 849 states and 2468 transitions. Word has length 22
[2020-10-11 14:52:43,372 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:43,373 INFO  L481      AbstractCegarLoop]: Abstraction has 849 states and 2468 transitions.
[2020-10-11 14:52:43,373 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:52:43,373 INFO  L276                IsEmpty]: Start isEmpty. Operand 849 states and 2468 transitions.
[2020-10-11 14:52:43,375 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:52:43,375 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:43,375 INFO  L421         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-11 14:52:43,375 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:52:43,376 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:43,376 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:43,376 INFO  L82        PathProgramCache]: Analyzing trace with hash 768181909, now seen corresponding path program 3 times
[2020-10-11 14:52:43,376 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:43,379 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150709717]
[2020-10-11 14:52:43,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:43,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:43,428 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-11 14:52:43,429 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150709717]
[2020-10-11 14:52:43,429 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:43,429 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:52:43,429 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659586196]
[2020-10-11 14:52:43,430 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:52:43,430 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:43,430 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:52:43,430 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:43,431 INFO  L87              Difference]: Start difference. First operand 849 states and 2468 transitions. Second operand 3 states.
[2020-10-11 14:52:43,507 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:43,507 INFO  L93              Difference]: Finished difference Result 1153 states and 3256 transitions.
[2020-10-11 14:52:43,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:52:43,508 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 22
[2020-10-11 14:52:43,509 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:43,510 INFO  L225             Difference]: With dead ends: 1153
[2020-10-11 14:52:43,510 INFO  L226             Difference]: Without dead ends: 725
[2020-10-11 14:52:43,511 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:52:43,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 725 states.
[2020-10-11 14:52:43,524 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 723.
[2020-10-11 14:52:43,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 723 states.
[2020-10-11 14:52:43,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1944 transitions.
[2020-10-11 14:52:43,526 INFO  L78                 Accepts]: Start accepts. Automaton has 723 states and 1944 transitions. Word has length 22
[2020-10-11 14:52:43,527 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:43,527 INFO  L481      AbstractCegarLoop]: Abstraction has 723 states and 1944 transitions.
[2020-10-11 14:52:43,527 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:52:43,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 723 states and 1944 transitions.
[2020-10-11 14:52:43,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:52:43,529 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:43,530 INFO  L421         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-11 14:52:43,530 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:52:43,530 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:43,530 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:43,530 INFO  L82        PathProgramCache]: Analyzing trace with hash 730025773, now seen corresponding path program 4 times
[2020-10-11 14:52:43,531 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:43,531 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042480898]
[2020-10-11 14:52:43,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:43,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:43,605 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-11 14:52:43,605 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042480898]
[2020-10-11 14:52:43,605 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:43,605 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-10-11 14:52:43,606 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397908426]
[2020-10-11 14:52:43,606 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:52:43,606 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:43,606 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:52:43,607 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:52:43,607 INFO  L87              Difference]: Start difference. First operand 723 states and 1944 transitions. Second operand 7 states.
[2020-10-11 14:52:43,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:43,675 INFO  L93              Difference]: Finished difference Result 697 states and 1891 transitions.
[2020-10-11 14:52:43,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-10-11 14:52:43,676 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-11 14:52:43,677 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:43,679 INFO  L225             Difference]: With dead ends: 697
[2020-10-11 14:52:43,679 INFO  L226             Difference]: Without dead ends: 473
[2020-10-11 14:52:43,680 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-11 14:52:43,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 473 states.
[2020-10-11 14:52:43,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473.
[2020-10-11 14:52:43,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 473 states.
[2020-10-11 14:52:43,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1264 transitions.
[2020-10-11 14:52:43,692 INFO  L78                 Accepts]: Start accepts. Automaton has 473 states and 1264 transitions. Word has length 22
[2020-10-11 14:52:43,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:43,692 INFO  L481      AbstractCegarLoop]: Abstraction has 473 states and 1264 transitions.
[2020-10-11 14:52:43,692 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:52:43,693 INFO  L276                IsEmpty]: Start isEmpty. Operand 473 states and 1264 transitions.
[2020-10-11 14:52:43,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:52:43,694 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:43,694 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:43,695 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 14:52:43,695 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:43,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:43,695 INFO  L82        PathProgramCache]: Analyzing trace with hash 1559232615, now seen corresponding path program 1 times
[2020-10-11 14:52:43,695 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:43,696 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597020175]
[2020-10-11 14:52:43,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:43,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:43,744 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-11 14:52:43,745 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597020175]
[2020-10-11 14:52:43,745 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:43,745 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:52:43,745 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701363247]
[2020-10-11 14:52:43,746 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:52:43,746 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:43,746 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:52:43,746 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:52:43,746 INFO  L87              Difference]: Start difference. First operand 473 states and 1264 transitions. Second operand 4 states.
[2020-10-11 14:52:43,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:43,764 INFO  L93              Difference]: Finished difference Result 502 states and 1317 transitions.
[2020-10-11 14:52:43,765 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:52:43,765 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 26
[2020-10-11 14:52:43,765 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:43,766 INFO  L225             Difference]: With dead ends: 502
[2020-10-11 14:52:43,766 INFO  L226             Difference]: Without dead ends: 184
[2020-10-11 14:52:43,766 INFO  L673         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-11 14:52:43,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2020-10-11 14:52:43,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184.
[2020-10-11 14:52:43,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2020-10-11 14:52:43,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 454 transitions.
[2020-10-11 14:52:43,771 INFO  L78                 Accepts]: Start accepts. Automaton has 184 states and 454 transitions. Word has length 26
[2020-10-11 14:52:43,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:43,771 INFO  L481      AbstractCegarLoop]: Abstraction has 184 states and 454 transitions.
[2020-10-11 14:52:43,771 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:52:43,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 184 states and 454 transitions.
[2020-10-11 14:52:43,772 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:52:43,772 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:43,772 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:43,773 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 14:52:43,773 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:43,773 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:43,773 INFO  L82        PathProgramCache]: Analyzing trace with hash 772229995, now seen corresponding path program 2 times
[2020-10-11 14:52:43,774 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:43,774 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265993065]
[2020-10-11 14:52:43,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:43,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:52:44,019 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-11 14:52:44,020 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265993065]
[2020-10-11 14:52:44,020 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:52:44,020 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:52:44,020 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524018455]
[2020-10-11 14:52:44,021 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:52:44,021 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:52:44,021 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:52:44,021 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:52:44,021 INFO  L87              Difference]: Start difference. First operand 184 states and 454 transitions. Second operand 6 states.
[2020-10-11 14:52:44,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:52:44,191 INFO  L93              Difference]: Finished difference Result 246 states and 598 transitions.
[2020-10-11 14:52:44,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:52:44,192 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 26
[2020-10-11 14:52:44,192 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:52:44,192 INFO  L225             Difference]: With dead ends: 246
[2020-10-11 14:52:44,192 INFO  L226             Difference]: Without dead ends: 144
[2020-10-11 14:52:44,193 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:52:44,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2020-10-11 14:52:44,195 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144.
[2020-10-11 14:52:44,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 144 states.
[2020-10-11 14:52:44,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 326 transitions.
[2020-10-11 14:52:44,196 INFO  L78                 Accepts]: Start accepts. Automaton has 144 states and 326 transitions. Word has length 26
[2020-10-11 14:52:44,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:52:44,197 INFO  L481      AbstractCegarLoop]: Abstraction has 144 states and 326 transitions.
[2020-10-11 14:52:44,197 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:52:44,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 144 states and 326 transitions.
[2020-10-11 14:52:44,197 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2020-10-11 14:52:44,198 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:52:44,198 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:52:44,198 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 14:52:44,198 INFO  L429      AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:52:44,198 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:52:44,198 INFO  L82        PathProgramCache]: Analyzing trace with hash 1680604651, now seen corresponding path program 3 times
[2020-10-11 14:52:44,199 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:52:44,199 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322976256]
[2020-10-11 14:52:44,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:52:44,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:52:44,228 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:52:44,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:52:44,259 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:52:44,295 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:52:44,296 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:52:44,296 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-10-11 14:52:44,297 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-11 14:52:44,314 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L846-->L853: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In-1372062912 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In-1372062912 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-1372062912 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-1372062912 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1372062912 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1372062912 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1372062912|) (or (and .cse0 .cse1 (= ~z$w_buff0_used~0_Out-1372062912 0)) (and (= ~z$w_buff0_used~0_Out-1372062912 ~z$w_buff0_used~0_In-1372062912) .cse2)) (or (and .cse3 .cse4 (= ~z$w_buff1_used~0_Out-1372062912 0)) (and .cse5 (= ~z$w_buff1_used~0_In-1372062912 ~z$w_buff1_used~0_Out-1372062912))) (= ~z$r_buff1_thd0~0_Out-1372062912 ~z$r_buff1_thd0~0_In-1372062912) (= ~z$r_buff0_thd0~0_Out-1372062912 ~z$r_buff0_thd0~0_In-1372062912) (or (and .cse0 .cse1 (= ~z~0_Out-1372062912 ~z$w_buff0~0_In-1372062912)) (and .cse2 (or (and .cse3 .cse4 (= ~z$w_buff1~0_In-1372062912 ~z~0_Out-1372062912)) (and .cse5 (= ~z~0_In-1372062912 ~z~0_Out-1372062912))))))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1372062912|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1372062912, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1372062912, ~z$w_buff0~0=~z$w_buff0~0_In-1372062912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1372062912, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1372062912, ~z$w_buff1~0=~z$w_buff1~0_In-1372062912, ~z~0=~z~0_In-1372062912}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1372062912, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1372062912|, ~z$w_buff0~0=~z$w_buff0~0_In-1372062912, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1372062912|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1372062912, ~z$w_buff1~0=~z$w_buff1~0_In-1372062912, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1372062912|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1372062912|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1372062912|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1372062912|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1372062912|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1372062912, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1372062912, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1372062912, ~z~0=~z~0_Out-1372062912}  AuxVars[]  AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge
[2020-10-11 14:52:44,320 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-11 14:52:44,321 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,323 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-11 14:52:44,323 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,323 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-11 14:52:44,323 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,323 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-11 14:52:44,323 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,324 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-11 14:52:44,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,324 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-11 14:52:44,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,324 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-11 14:52:44,324 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,325 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-11 14:52:44,325 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,325 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-11 14:52:44,326 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,326 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-11 14:52:44,326 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,326 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-11 14:52:44,326 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,326 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-11 14:52:44,327 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,327 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-11 14:52:44,327 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,328 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-11 14:52:44,328 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,328 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-11 14:52:44,328 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,328 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-11 14:52:44,328 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,329 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-11 14:52:44,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,329 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-11 14:52:44,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,329 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-11 14:52:44,329 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,330 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-11 14:52:44,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,330 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-11 14:52:44,330 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,330 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-11 14:52:44,331 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,331 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-11 14:52:44,331 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:52:44,405 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:52:44 BasicIcfg
[2020-10-11 14:52:44,405 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:52:44,407 INFO  L168              Benchmark]: Toolchain (without parser) took 18130.23 ms. Allocated memory was 251.7 MB in the beginning and 610.8 MB in the end (delta: 359.1 MB). Free memory was 206.8 MB in the beginning and 382.2 MB in the end (delta: -175.4 MB). Peak memory consumption was 183.7 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,408 INFO  L168              Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,408 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 744.63 ms. Allocated memory was 251.7 MB in the beginning and 313.0 MB in the end (delta: 61.3 MB). Free memory was 206.8 MB in the beginning and 261.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,409 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 313.0 MB. Free memory was 261.2 MB in the beginning and 258.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,409 INFO  L168              Benchmark]: Boogie Preprocessor took 40.69 ms. Allocated memory is still 313.0 MB. Free memory was 258.7 MB in the beginning and 256.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,410 INFO  L168              Benchmark]: RCFGBuilder took 2085.61 ms. Allocated memory was 313.0 MB in the beginning and 356.5 MB in the end (delta: 43.5 MB). Free memory was 256.2 MB in the beginning and 200.6 MB in the end (delta: 55.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,411 INFO  L168              Benchmark]: TraceAbstraction took 15184.35 ms. Allocated memory was 356.5 MB in the beginning and 610.8 MB in the end (delta: 254.3 MB). Free memory was 200.6 MB in the beginning and 382.2 MB in the end (delta: -181.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 14.2 GB.
[2020-10-11 14:52:44,414 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.45 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 744.63 ms. Allocated memory was 251.7 MB in the beginning and 313.0 MB in the end (delta: 61.3 MB). Free memory was 206.8 MB in the beginning and 261.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 313.0 MB. Free memory was 261.2 MB in the beginning and 258.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 40.69 ms. Allocated memory is still 313.0 MB. Free memory was 258.7 MB in the beginning and 256.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2085.61 ms. Allocated memory was 313.0 MB in the beginning and 356.5 MB in the end (delta: 43.5 MB). Free memory was 256.2 MB in the beginning and 200.6 MB in the end (delta: 55.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 15184.35 ms. Allocated memory was 356.5 MB in the beginning and 610.8 MB in the end (delta: 254.3 MB). Free memory was 200.6 MB in the beginning and 382.2 MB in the end (delta: -181.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1747 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 64 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 234 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 6932 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p1_EAX = 0;
[L703]               0  int __unbuffered_p3_EAX = 0;
[L705]               0  int __unbuffered_p3_EBX = 0;
[L707]               0  int a = 0;
[L709]               0  int b = 0;
[L710]               0  _Bool main$tmp_guard0;
[L711]               0  _Bool main$tmp_guard1;
[L713]               0  int x = 0;
[L715]               0  int y = 0;
[L717]               0  int z = 0;
[L718]               0  _Bool z$flush_delayed;
[L719]               0  int z$mem_tmp;
[L720]               0  _Bool z$r_buff0_thd0;
[L721]               0  _Bool z$r_buff0_thd1;
[L722]               0  _Bool z$r_buff0_thd2;
[L723]               0  _Bool z$r_buff0_thd3;
[L724]               0  _Bool z$r_buff0_thd4;
[L725]               0  _Bool z$r_buff1_thd0;
[L726]               0  _Bool z$r_buff1_thd1;
[L727]               0  _Bool z$r_buff1_thd2;
[L728]               0  _Bool z$r_buff1_thd3;
[L729]               0  _Bool z$r_buff1_thd4;
[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;
[L835]               0  pthread_t t1181;
[L836]  FCALL, FORK  0  pthread_create(&t1181, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]               0  pthread_t t1182;
[L838]  FCALL, FORK  0  pthread_create(&t1182, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]               0  pthread_t t1183;
[L840]  FCALL, FORK  0  pthread_create(&t1183, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L841]               0  pthread_t t1184;
[L842]  FCALL, FORK  0  pthread_create(&t1184, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L791]               4  z$w_buff1 = z$w_buff0
[L792]               4  z$w_buff0 = 2
[L793]               4  z$w_buff1_used = z$w_buff0_used
[L794]               4  z$w_buff0_used = (_Bool)1
[L7]    COND FALSE   4  !(!expression)
[L796]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L797]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L798]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L799]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L800]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L801]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L804]               4  a = 1
[L807]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L810]               4  __unbuffered_p3_EBX = b
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L741]               1  b = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L744]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L749]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L751]               1  return 0;
[L759]               2  __unbuffered_p1_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L764]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L766]               2  return 0;
[L771]               3  y = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L774]               3  z = 1
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L777]  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)
[L777]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L777]  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)
[L777]               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)
[L778]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L778]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L779]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L779]               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
[L780]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L780]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L781]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L781]               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
[L784]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L786]               3  return 0;
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]  EXPR         4  z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z
[L813]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L814]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L815]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L816]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L816]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L817]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L817]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L820]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L822]               4  return 0;
[L844]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L855]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L856]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L857]               0  z$flush_delayed = weak$$choice2
[L858]               0  z$mem_tmp = z
[L859]  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)
[L859]               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)
[L860]  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))
[L860]               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))
[L861]  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))
[L861]  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)
[L861]  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))
[L861]               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))
[L862]  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))
[L862]               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))
[L863]  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))
[L863]               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))
[L864]  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))
[L864]  EXPR         0  !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)
[L864]  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))
[L864]               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))
[L865]  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))
[L865]               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))
[L866]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0)
[L867]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L867]               0  z = z$flush_delayed ? z$mem_tmp : z
[L868]               0  z$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 499 SDtfs, 594 SDslu, 1067 SDs, 0 SdLazy, 469 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 150 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 31552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...