/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/mix028_power.opt.i


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


This is Ultimate 0.1.25-11af1e5
[2020-10-11 14:47:31,155 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-11 14:47:31,158 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-11 14:47:31,181 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-11 14:47:31,182 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-11 14:47:31,183 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-11 14:47:31,184 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-11 14:47:31,186 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-11 14:47:31,188 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-11 14:47:31,189 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-11 14:47:31,190 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-11 14:47:31,195 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-11 14:47:31,195 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-11 14:47:31,198 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-11 14:47:31,199 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-11 14:47:31,200 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-11 14:47:31,201 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-11 14:47:31,202 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-11 14:47:31,204 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-11 14:47:31,205 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-11 14:47:31,207 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-11 14:47:31,208 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-11 14:47:31,209 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-11 14:47:31,210 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-11 14:47:31,212 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-11 14:47:31,212 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-11 14:47:31,213 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-11 14:47:31,214 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-11 14:47:31,214 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-11 14:47:31,215 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-11 14:47:31,215 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-11 14:47:31,216 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-11 14:47:31,217 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-11 14:47:31,217 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-11 14:47:31,218 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-11 14:47:31,219 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-11 14:47:31,219 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-11 14:47:31,220 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-11 14:47:31,220 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-11 14:47:31,221 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-11 14:47:31,221 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-11 14:47:31,222 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:47:31,245 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-11 14:47:31,245 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-11 14:47:31,247 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-11 14:47:31,247 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-11 14:47:31,247 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-11 14:47:31,247 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-11 14:47:31,248 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-11 14:47:31,249 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-11 14:47:31,249 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-11 14:47:31,249 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-11 14:47:31,249 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-11 14:47:31,249 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-11 14:47:31,250 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-11 14:47:31,250 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-11 14:47:31,250 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-11 14:47:31,250 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-11 14:47:31,250 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-11 14:47:31,251 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-11 14:47:31,251 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-11 14:47:31,251 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-11 14:47:31,251 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-11 14:47:31,252 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-11 14:47:31,252 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-11 14:47:31,252 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-11 14:47:31,252 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-11 14:47:31,581 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-11 14:47:31,598 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-11 14:47:31,602 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-11 14:47:31,603 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-11 14:47:31,604 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-11 14:47:31,604 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i
[2020-10-11 14:47:31,665 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839f3ffe/637a1cfb49bf4a4583aaa1d76a59d5dc/FLAG288f296f9
[2020-10-11 14:47:32,258 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-11 14:47:32,258 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i
[2020-10-11 14:47:32,280 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839f3ffe/637a1cfb49bf4a4583aaa1d76a59d5dc/FLAG288f296f9
[2020-10-11 14:47:32,463 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1839f3ffe/637a1cfb49bf4a4583aaa1d76a59d5dc
[2020-10-11 14:47:32,472 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-11 14:47:32,474 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-11 14:47:32,475 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-11 14:47:32,475 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-11 14:47:32,480 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-11 14:47:32,482 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:47:32" (1/1) ...
[2020-10-11 14:47:32,485 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68cce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:32, skipping insertion in model container
[2020-10-11 14:47:32,486 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:47:32" (1/1) ...
[2020-10-11 14:47:32,495 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-11 14:47:32,566 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-11 14:47:33,071 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:47:33,082 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-11 14:47:33,150 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-11 14:47:33,218 INFO  L208         MainTranslator]: Completed translation
[2020-10-11 14:47:33,219 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33 WrapperNode
[2020-10-11 14:47:33,219 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-11 14:47:33,220 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-11 14:47:33,220 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-11 14:47:33,220 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-11 14:47:33,228 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:47:33" (1/1) ...
[2020-10-11 14:47:33,249 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:47:33" (1/1) ...
[2020-10-11 14:47:33,284 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-11 14:47:33,285 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-11 14:47:33,285 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-11 14:47:33,285 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-11 14:47:33,294 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,294 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,299 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,300 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,311 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,315 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,319 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (1/1) ...
[2020-10-11 14:47:33,325 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-11 14:47:33,326 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-11 14:47:33,326 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-11 14:47:33,326 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-11 14:47:33,327 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (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:47:33,394 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-11 14:47:33,395 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-11 14:47:33,395 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-11 14:47:33,395 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-11 14:47:33,395 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-11 14:47:33,395 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-11 14:47:33,396 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-11 14:47:33,396 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-11 14:47:33,396 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-11 14:47:33,396 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-11 14:47:33,396 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-11 14:47:33,396 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-11 14:47:33,397 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-11 14:47:33,399 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:47:35,385 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-11 14:47:35,385 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-11 14:47:35,388 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:47:35 BoogieIcfgContainer
[2020-10-11 14:47:35,388 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-11 14:47:35,390 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-11 14:47:35,390 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-11 14:47:35,394 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-11 14:47:35,394 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:47:32" (1/3) ...
[2020-10-11 14:47:35,395 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25df9756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:47:35, skipping insertion in model container
[2020-10-11 14:47:35,396 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:33" (2/3) ...
[2020-10-11 14:47:35,396 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25df9756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:47:35, skipping insertion in model container
[2020-10-11 14:47:35,396 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:47:35" (3/3) ...
[2020-10-11 14:47:35,398 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i
[2020-10-11 14:47:35,412 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-11 14:47:35,413 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-11 14:47:35,422 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-11 14:47:35,423 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-11 14:47:35,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,455 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,456 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,456 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,456 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,457 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,458 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,459 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,460 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,460 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,461 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,461 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,461 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,462 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,462 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,463 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,464 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,465 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,465 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,466 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,466 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,466 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,466 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,467 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,467 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,467 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,467 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,467 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,468 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,469 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,472 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,473 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,473 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,473 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,474 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,474 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,475 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,479 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,480 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,481 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,481 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,481 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,483 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,483 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,484 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,484 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,485 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,486 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-11 14:47:35,504 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-11 14:47:35,529 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-11 14:47:35,529 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-11 14:47:35,530 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-11 14:47:35,530 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-11 14:47:35,530 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-11 14:47:35,530 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-11 14:47:35,530 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-11 14:47:35,531 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-11 14:47:35,546 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-11 14:47:35,549 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-11 14:47:35,552 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 203 flow
[2020-10-11 14:47:35,555 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow
[2020-10-11 14:47:35,605 INFO  L129       PetriNetUnfolder]: 2/91 cut-off events.
[2020-10-11 14:47:35,605 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-11 14:47:35,610 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-11 14:47:35,614 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1724
[2020-10-11 14:47:35,865 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:35,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:35,868 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,869 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:35,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,873 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:35,877 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:35,877 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:35,900 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,901 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:35,902 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,902 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:35,906 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,906 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:35,909 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:35,910 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:35,995 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,995 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:35,997 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:35,997 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:36,001 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:36,001 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:36,005 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:36,005 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:36,024 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:36,025 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:36,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:36,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:36,030 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:36,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:36,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:36,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:36,067 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-11 14:47:36,068 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,069 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:47:36,070 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,088 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-11 14:47:36,088 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,089 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-11 14:47:36,090 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,091 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-11 14:47:36,092 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2020-10-11 14:47:36,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:36,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:47:36,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:37,310 WARN  L193               SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2020-10-11 14:47:37,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term
[2020-10-11 14:47:37,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:37,344 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-11 14:47:37,344 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:38,209 WARN  L193               SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125
[2020-10-11 14:47:38,340 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:47:38,340 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,406 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,406 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,407 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,407 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,410 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,411 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,417 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,418 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,441 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,443 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,444 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,446 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,447 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,497 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,497 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,499 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,502 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,525 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,525 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,526 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,526 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,529 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,530 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,531 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,532 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,586 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,587 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,588 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,588 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,592 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,593 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:38,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:38,616 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:38,618 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:38,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:39,696 WARN  L193               SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 126
[2020-10-11 14:47:40,083 WARN  L193               SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 126
[2020-10-11 14:47:40,162 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:47:40,163 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:40,780 WARN  L193               SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2020-10-11 14:47:41,792 WARN  L193               SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 108
[2020-10-11 14:47:42,078 WARN  L193               SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 105
[2020-10-11 14:47:42,104 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,105 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,105 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,106 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,108 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,108 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,110 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,110 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,130 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,130 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,303 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,304 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,305 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,340 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,340 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,343 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,343 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,350 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,350 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,389 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-11 14:47:42,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,479 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,480 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,480 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,481 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,482 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,483 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,484 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,485 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,503 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,503 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,504 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,505 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,506 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,507 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,596 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,596 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,597 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,597 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,599 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,599 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,602 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-11 14:47:42,620 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,621 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,623 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,624 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:42,625 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:42,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:42,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-11 14:47:42,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,392 WARN  L193               SmtUtils]: Spent 646.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 132
[2020-10-11 14:47:43,709 WARN  L193               SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 129
[2020-10-11 14:47:43,827 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,828 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:43,830 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,830 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,850 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,852 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:43,852 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,854 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,855 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,855 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,857 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,858 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,860 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,860 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,862 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,862 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,864 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,865 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,866 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,866 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,978 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,979 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:43,979 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,979 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,980 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,980 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:43,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,983 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,984 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:43,984 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,986 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,987 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:43,988 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:43,988 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:44,013 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,013 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,119 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,121 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:44,121 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,127 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,128 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,128 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,130 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,130 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,134 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,135 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,136 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,136 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,138 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,139 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,159 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,160 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:44,163 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,163 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,452 WARN  L193               SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87
[2020-10-11 14:47:44,569 WARN  L193               SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-11 14:47:44,644 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,645 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,646 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:44,646 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,647 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,647 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,648 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,648 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,650 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,651 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,652 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,652 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,654 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,654 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,656 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,656 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,657 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,657 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,674 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,674 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:44,676 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,676 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,704 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,705 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:44,707 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,707 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,728 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,728 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,729 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:44,730 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,730 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,731 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,731 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,732 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,733 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,733 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,735 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,735 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,736 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,737 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-11 14:47:44,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,813 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term
[2020-10-11 14:47:44,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,815 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,815 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,816 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-11 14:47:44,818 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,818 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,819 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,819 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,821 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term
[2020-10-11 14:47:44,821 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,823 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,823 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,824 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-11 14:47:44,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-11 14:47:44,864 INFO  L132        LiptonReduction]: Checked pairs total: 4894
[2020-10-11 14:47:44,865 INFO  L134        LiptonReduction]: Total number of compositions: 78
[2020-10-11 14:47:44,872 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow
[2020-10-11 14:47:44,946 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states.
[2020-10-11 14:47:44,948 INFO  L276                IsEmpty]: Start isEmpty. Operand 972 states.
[2020-10-11 14:47:44,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-11 14:47:44,956 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:44,957 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-11 14:47:44,957 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:44,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:44,963 INFO  L82        PathProgramCache]: Analyzing trace with hash 1007243960, now seen corresponding path program 1 times
[2020-10-11 14:47:44,973 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:44,974 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857891583]
[2020-10-11 14:47:44,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:45,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:45,206 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:47:45,207 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857891583]
[2020-10-11 14:47:45,208 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:45,208 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:47:45,209 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938389451]
[2020-10-11 14:47:45,214 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:47:45,214 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:45,230 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:47:45,230 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:47:45,233 INFO  L87              Difference]: Start difference. First operand 972 states. Second operand 3 states.
[2020-10-11 14:47:45,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:45,338 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-11 14:47:45,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:47:45,340 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-11 14:47:45,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:45,365 INFO  L225             Difference]: With dead ends: 812
[2020-10-11 14:47:45,365 INFO  L226             Difference]: Without dead ends: 662
[2020-10-11 14:47:45,366 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:47:45,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-11 14:47:45,470 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2020-10-11 14:47:45,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 662 states.
[2020-10-11 14:47:45,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions.
[2020-10-11 14:47:45,482 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5
[2020-10-11 14:47:45,483 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:45,483 INFO  L481      AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions.
[2020-10-11 14:47:45,483 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:47:45,483 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions.
[2020-10-11 14:47:45,487 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-11 14:47:45,487 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:45,487 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:45,487 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-11 14:47:45,488 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:45,488 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:45,488 INFO  L82        PathProgramCache]: Analyzing trace with hash -1612855145, now seen corresponding path program 1 times
[2020-10-11 14:47:45,488 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:45,488 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325933794]
[2020-10-11 14:47:45,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:45,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:45,671 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:47:45,671 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325933794]
[2020-10-11 14:47:45,671 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:45,672 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:47:45,675 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121933892]
[2020-10-11 14:47:45,676 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:47:45,677 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:45,680 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:47:45,680 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:47:45,681 INFO  L87              Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states.
[2020-10-11 14:47:45,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:45,730 INFO  L93              Difference]: Finished difference Result 657 states and 2041 transitions.
[2020-10-11 14:47:45,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:47:45,731 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-11 14:47:45,732 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:45,739 INFO  L225             Difference]: With dead ends: 657
[2020-10-11 14:47:45,739 INFO  L226             Difference]: Without dead ends: 657
[2020-10-11 14:47:45,740 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:47:45,744 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 657 states.
[2020-10-11 14:47:45,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657.
[2020-10-11 14:47:45,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 657 states.
[2020-10-11 14:47:45,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 2041 transitions.
[2020-10-11 14:47:45,793 INFO  L78                 Accepts]: Start accepts. Automaton has 657 states and 2041 transitions. Word has length 9
[2020-10-11 14:47:45,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:45,794 INFO  L481      AbstractCegarLoop]: Abstraction has 657 states and 2041 transitions.
[2020-10-11 14:47:45,794 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:47:45,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 657 states and 2041 transitions.
[2020-10-11 14:47:45,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-11 14:47:45,796 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:45,796 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:45,796 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-11 14:47:45,797 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:45,797 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:45,797 INFO  L82        PathProgramCache]: Analyzing trace with hash 1129782299, now seen corresponding path program 1 times
[2020-10-11 14:47:45,797 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:45,797 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7422657]
[2020-10-11 14:47:45,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:45,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:45,879 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:47:45,880 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7422657]
[2020-10-11 14:47:45,880 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:45,880 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:47:45,880 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787195611]
[2020-10-11 14:47:45,881 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:47:45,881 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:45,881 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:47:45,881 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:45,881 INFO  L87              Difference]: Start difference. First operand 657 states and 2041 transitions. Second operand 4 states.
[2020-10-11 14:47:45,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:45,960 INFO  L93              Difference]: Finished difference Result 652 states and 2022 transitions.
[2020-10-11 14:47:45,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:47:45,969 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-11 14:47:45,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:45,975 INFO  L225             Difference]: With dead ends: 652
[2020-10-11 14:47:45,975 INFO  L226             Difference]: Without dead ends: 652
[2020-10-11 14:47:45,976 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:47:45,979 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 652 states.
[2020-10-11 14:47:45,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652.
[2020-10-11 14:47:45,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 652 states.
[2020-10-11 14:47:45,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2022 transitions.
[2020-10-11 14:47:45,998 INFO  L78                 Accepts]: Start accepts. Automaton has 652 states and 2022 transitions. Word has length 10
[2020-10-11 14:47:45,999 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:45,999 INFO  L481      AbstractCegarLoop]: Abstraction has 652 states and 2022 transitions.
[2020-10-11 14:47:45,999 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:47:45,999 INFO  L276                IsEmpty]: Start isEmpty. Operand 652 states and 2022 transitions.
[2020-10-11 14:47:46,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-11 14:47:46,001 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,001 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,001 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-11 14:47:46,001 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,002 INFO  L82        PathProgramCache]: Analyzing trace with hash 1540778935, now seen corresponding path program 1 times
[2020-10-11 14:47:46,002 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,002 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238737828]
[2020-10-11 14:47:46,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,055 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:47:46,056 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238737828]
[2020-10-11 14:47:46,056 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,056 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-11 14:47:46,057 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82721681]
[2020-10-11 14:47:46,057 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:47:46,057 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,057 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:47:46,058 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:47:46,058 INFO  L87              Difference]: Start difference. First operand 652 states and 2022 transitions. Second operand 3 states.
[2020-10-11 14:47:46,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,103 INFO  L93              Difference]: Finished difference Result 647 states and 2003 transitions.
[2020-10-11 14:47:46,104 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:47:46,104 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-11 14:47:46,105 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,109 INFO  L225             Difference]: With dead ends: 647
[2020-10-11 14:47:46,109 INFO  L226             Difference]: Without dead ends: 647
[2020-10-11 14:47:46,110 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:47:46,113 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 647 states.
[2020-10-11 14:47:46,126 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647.
[2020-10-11 14:47:46,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 647 states.
[2020-10-11 14:47:46,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 2003 transitions.
[2020-10-11 14:47:46,130 INFO  L78                 Accepts]: Start accepts. Automaton has 647 states and 2003 transitions. Word has length 10
[2020-10-11 14:47:46,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,130 INFO  L481      AbstractCegarLoop]: Abstraction has 647 states and 2003 transitions.
[2020-10-11 14:47:46,131 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:47:46,131 INFO  L276                IsEmpty]: Start isEmpty. Operand 647 states and 2003 transitions.
[2020-10-11 14:47:46,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:47:46,132 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,132 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,133 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-11 14:47:46,133 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,133 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,133 INFO  L82        PathProgramCache]: Analyzing trace with hash -1179260407, now seen corresponding path program 1 times
[2020-10-11 14:47:46,133 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,134 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990164138]
[2020-10-11 14:47:46,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,182 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:47:46,182 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990164138]
[2020-10-11 14:47:46,183 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,183 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:47:46,183 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100967768]
[2020-10-11 14:47:46,183 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-11 14:47:46,184 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,184 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-11 14:47:46,184 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-11 14:47:46,184 INFO  L87              Difference]: Start difference. First operand 647 states and 2003 transitions. Second operand 3 states.
[2020-10-11 14:47:46,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,207 INFO  L93              Difference]: Finished difference Result 932 states and 2781 transitions.
[2020-10-11 14:47:46,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:47:46,208 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2020-10-11 14:47:46,208 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,213 INFO  L225             Difference]: With dead ends: 932
[2020-10-11 14:47:46,213 INFO  L226             Difference]: Without dead ends: 707
[2020-10-11 14:47:46,214 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:47:46,218 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 707 states.
[2020-10-11 14:47:46,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 632.
[2020-10-11 14:47:46,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 632 states.
[2020-10-11 14:47:46,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1876 transitions.
[2020-10-11 14:47:46,279 INFO  L78                 Accepts]: Start accepts. Automaton has 632 states and 1876 transitions. Word has length 11
[2020-10-11 14:47:46,279 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,279 INFO  L481      AbstractCegarLoop]: Abstraction has 632 states and 1876 transitions.
[2020-10-11 14:47:46,279 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-11 14:47:46,279 INFO  L276                IsEmpty]: Start isEmpty. Operand 632 states and 1876 transitions.
[2020-10-11 14:47:46,280 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:47:46,281 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,281 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,281 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-11 14:47:46,281 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,282 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,282 INFO  L82        PathProgramCache]: Analyzing trace with hash 663193779, now seen corresponding path program 1 times
[2020-10-11 14:47:46,282 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,282 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411158558]
[2020-10-11 14:47:46,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,340 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:47:46,340 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411158558]
[2020-10-11 14:47:46,341 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,341 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:47:46,341 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467615985]
[2020-10-11 14:47:46,341 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:47:46,342 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,342 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:47:46,342 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:46,342 INFO  L87              Difference]: Start difference. First operand 632 states and 1876 transitions. Second operand 4 states.
[2020-10-11 14:47:46,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,409 INFO  L93              Difference]: Finished difference Result 612 states and 1805 transitions.
[2020-10-11 14:47:46,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:47:46,410 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-11 14:47:46,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,415 INFO  L225             Difference]: With dead ends: 612
[2020-10-11 14:47:46,415 INFO  L226             Difference]: Without dead ends: 612
[2020-10-11 14:47:46,416 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:47:46,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 612 states.
[2020-10-11 14:47:46,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612.
[2020-10-11 14:47:46,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 612 states.
[2020-10-11 14:47:46,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1805 transitions.
[2020-10-11 14:47:46,434 INFO  L78                 Accepts]: Start accepts. Automaton has 612 states and 1805 transitions. Word has length 11
[2020-10-11 14:47:46,434 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,434 INFO  L481      AbstractCegarLoop]: Abstraction has 612 states and 1805 transitions.
[2020-10-11 14:47:46,434 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:47:46,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 612 states and 1805 transitions.
[2020-10-11 14:47:46,435 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-11 14:47:46,435 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,435 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,435 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-11 14:47:46,436 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,436 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,436 INFO  L82        PathProgramCache]: Analyzing trace with hash 518025758, now seen corresponding path program 1 times
[2020-10-11 14:47:46,436 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,437 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367763173]
[2020-10-11 14:47:46,437 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,510 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:47:46,510 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367763173]
[2020-10-11 14:47:46,510 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,511 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:47:46,511 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067150030]
[2020-10-11 14:47:46,511 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:47:46,511 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,512 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:47:46,512 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:46,512 INFO  L87              Difference]: Start difference. First operand 612 states and 1805 transitions. Second operand 4 states.
[2020-10-11 14:47:46,552 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,552 INFO  L93              Difference]: Finished difference Result 604 states and 1775 transitions.
[2020-10-11 14:47:46,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-11 14:47:46,553 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-11 14:47:46,553 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,557 INFO  L225             Difference]: With dead ends: 604
[2020-10-11 14:47:46,558 INFO  L226             Difference]: Without dead ends: 604
[2020-10-11 14:47:46,558 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:46,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 604 states.
[2020-10-11 14:47:46,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604.
[2020-10-11 14:47:46,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 604 states.
[2020-10-11 14:47:46,575 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1775 transitions.
[2020-10-11 14:47:46,576 INFO  L78                 Accepts]: Start accepts. Automaton has 604 states and 1775 transitions. Word has length 11
[2020-10-11 14:47:46,576 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,576 INFO  L481      AbstractCegarLoop]: Abstraction has 604 states and 1775 transitions.
[2020-10-11 14:47:46,576 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:47:46,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 604 states and 1775 transitions.
[2020-10-11 14:47:46,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-11 14:47:46,577 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,578 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,578 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-11 14:47:46,578 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,578 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,578 INFO  L82        PathProgramCache]: Analyzing trace with hash -917310302, now seen corresponding path program 1 times
[2020-10-11 14:47:46,578 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,579 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950888849]
[2020-10-11 14:47:46,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,663 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:47:46,664 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950888849]
[2020-10-11 14:47:46,664 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,664 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:47:46,664 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819402513]
[2020-10-11 14:47:46,665 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:47:46,665 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,665 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:47:46,665 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:47:46,666 INFO  L87              Difference]: Start difference. First operand 604 states and 1775 transitions. Second operand 5 states.
[2020-10-11 14:47:46,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,751 INFO  L93              Difference]: Finished difference Result 596 states and 1743 transitions.
[2020-10-11 14:47:46,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:47:46,752 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-11 14:47:46,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,757 INFO  L225             Difference]: With dead ends: 596
[2020-10-11 14:47:46,757 INFO  L226             Difference]: Without dead ends: 596
[2020-10-11 14:47:46,757 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:47:46,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 596 states.
[2020-10-11 14:47:46,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596.
[2020-10-11 14:47:46,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 596 states.
[2020-10-11 14:47:46,775 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1743 transitions.
[2020-10-11 14:47:46,776 INFO  L78                 Accepts]: Start accepts. Automaton has 596 states and 1743 transitions. Word has length 12
[2020-10-11 14:47:46,776 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,776 INFO  L481      AbstractCegarLoop]: Abstraction has 596 states and 1743 transitions.
[2020-10-11 14:47:46,776 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:47:46,776 INFO  L276                IsEmpty]: Start isEmpty. Operand 596 states and 1743 transitions.
[2020-10-11 14:47:46,778 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:47:46,778 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,778 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,778 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-11 14:47:46,778 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,778 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,779 INFO  L82        PathProgramCache]: Analyzing trace with hash -393478016, now seen corresponding path program 1 times
[2020-10-11 14:47:46,779 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,779 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836126159]
[2020-10-11 14:47:46,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,792 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:46,826 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:47:46,826 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836126159]
[2020-10-11 14:47:46,826 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:46,827 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-11 14:47:46,827 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939062596]
[2020-10-11 14:47:46,827 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:47:46,827 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:46,828 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:47:46,828 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:46,828 INFO  L87              Difference]: Start difference. First operand 596 states and 1743 transitions. Second operand 4 states.
[2020-10-11 14:47:46,884 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:46,884 INFO  L93              Difference]: Finished difference Result 606 states and 1774 transitions.
[2020-10-11 14:47:46,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:47:46,885 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-11 14:47:46,885 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:46,889 INFO  L225             Difference]: With dead ends: 606
[2020-10-11 14:47:46,889 INFO  L226             Difference]: Without dead ends: 606
[2020-10-11 14:47:46,890 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:46,893 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 606 states.
[2020-10-11 14:47:46,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 602.
[2020-10-11 14:47:46,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 602 states.
[2020-10-11 14:47:46,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1760 transitions.
[2020-10-11 14:47:46,908 INFO  L78                 Accepts]: Start accepts. Automaton has 602 states and 1760 transitions. Word has length 13
[2020-10-11 14:47:46,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:46,909 INFO  L481      AbstractCegarLoop]: Abstraction has 602 states and 1760 transitions.
[2020-10-11 14:47:46,909 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:47:46,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 602 states and 1760 transitions.
[2020-10-11 14:47:46,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-11 14:47:46,910 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:46,910 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:46,911 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-11 14:47:46,911 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:46,911 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:46,911 INFO  L82        PathProgramCache]: Analyzing trace with hash -395086916, now seen corresponding path program 2 times
[2020-10-11 14:47:46,911 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:46,912 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207834134]
[2020-10-11 14:47:46,912 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:46,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:47,002 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:47:47,003 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207834134]
[2020-10-11 14:47:47,003 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:47,003 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:47:47,003 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328712153]
[2020-10-11 14:47:47,004 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:47:47,004 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:47,004 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:47:47,004 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:47:47,004 INFO  L87              Difference]: Start difference. First operand 602 states and 1760 transitions. Second operand 5 states.
[2020-10-11 14:47:47,075 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:47,075 INFO  L93              Difference]: Finished difference Result 594 states and 1733 transitions.
[2020-10-11 14:47:47,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-11 14:47:47,076 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-11 14:47:47,077 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:47,081 INFO  L225             Difference]: With dead ends: 594
[2020-10-11 14:47:47,081 INFO  L226             Difference]: Without dead ends: 594
[2020-10-11 14:47:47,081 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:47:47,084 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 594 states.
[2020-10-11 14:47:47,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 584.
[2020-10-11 14:47:47,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 584 states.
[2020-10-11 14:47:47,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1702 transitions.
[2020-10-11 14:47:47,101 INFO  L78                 Accepts]: Start accepts. Automaton has 584 states and 1702 transitions. Word has length 13
[2020-10-11 14:47:47,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:47,101 INFO  L481      AbstractCegarLoop]: Abstraction has 584 states and 1702 transitions.
[2020-10-11 14:47:47,101 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:47:47,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 584 states and 1702 transitions.
[2020-10-11 14:47:47,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-11 14:47:47,103 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:47,103 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:47,103 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-11 14:47:47,103 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:47,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:47,104 INFO  L82        PathProgramCache]: Analyzing trace with hash 1838509889, now seen corresponding path program 1 times
[2020-10-11 14:47:47,104 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:47,104 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433092896]
[2020-10-11 14:47:47,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:47,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:47,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-11 14:47:47,186 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433092896]
[2020-10-11 14:47:47,186 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:47,186 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-11 14:47:47,187 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705596702]
[2020-10-11 14:47:47,187 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-11 14:47:47,187 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:47,187 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-11 14:47:47,188 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-11 14:47:47,188 INFO  L87              Difference]: Start difference. First operand 584 states and 1702 transitions. Second operand 4 states.
[2020-10-11 14:47:47,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:47,226 INFO  L93              Difference]: Finished difference Result 546 states and 1402 transitions.
[2020-10-11 14:47:47,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-11 14:47:47,227 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-11 14:47:47,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:47,229 INFO  L225             Difference]: With dead ends: 546
[2020-10-11 14:47:47,230 INFO  L226             Difference]: Without dead ends: 396
[2020-10-11 14:47:47,230 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:47:47,232 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 396 states.
[2020-10-11 14:47:47,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396.
[2020-10-11 14:47:47,239 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 396 states.
[2020-10-11 14:47:47,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 982 transitions.
[2020-10-11 14:47:47,242 INFO  L78                 Accepts]: Start accepts. Automaton has 396 states and 982 transitions. Word has length 14
[2020-10-11 14:47:47,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:47,242 INFO  L481      AbstractCegarLoop]: Abstraction has 396 states and 982 transitions.
[2020-10-11 14:47:47,242 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-11 14:47:47,243 INFO  L276                IsEmpty]: Start isEmpty. Operand 396 states and 982 transitions.
[2020-10-11 14:47:47,244 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-10-11 14:47:47,244 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:47,244 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:47,245 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-11 14:47:47,245 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:47,245 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:47,245 INFO  L82        PathProgramCache]: Analyzing trace with hash 1159716946, now seen corresponding path program 1 times
[2020-10-11 14:47:47,246 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:47,246 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735249294]
[2020-10-11 14:47:47,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:47,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:47,396 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:47:47,397 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735249294]
[2020-10-11 14:47:47,397 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:47,397 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-11 14:47:47,397 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71104317]
[2020-10-11 14:47:47,398 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-11 14:47:47,398 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:47,398 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-11 14:47:47,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-11 14:47:47,399 INFO  L87              Difference]: Start difference. First operand 396 states and 982 transitions. Second operand 5 states.
[2020-10-11 14:47:47,462 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:47,462 INFO  L93              Difference]: Finished difference Result 321 states and 735 transitions.
[2020-10-11 14:47:47,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:47:47,464 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2020-10-11 14:47:47,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:47,466 INFO  L225             Difference]: With dead ends: 321
[2020-10-11 14:47:47,466 INFO  L226             Difference]: Without dead ends: 251
[2020-10-11 14:47:47,467 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:47:47,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 251 states.
[2020-10-11 14:47:47,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251.
[2020-10-11 14:47:47,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 251 states.
[2020-10-11 14:47:47,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 563 transitions.
[2020-10-11 14:47:47,477 INFO  L78                 Accepts]: Start accepts. Automaton has 251 states and 563 transitions. Word has length 15
[2020-10-11 14:47:47,479 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:47,479 INFO  L481      AbstractCegarLoop]: Abstraction has 251 states and 563 transitions.
[2020-10-11 14:47:47,479 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-11 14:47:47,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 251 states and 563 transitions.
[2020-10-11 14:47:47,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-11 14:47:47,480 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:47,481 INFO  L421         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-11 14:47:47,481 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-10-11 14:47:47,481 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:47,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:47,482 INFO  L82        PathProgramCache]: Analyzing trace with hash 1501537967, now seen corresponding path program 1 times
[2020-10-11 14:47:47,482 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:47,485 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535165763]
[2020-10-11 14:47:47,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:47,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:47,633 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:47:47,633 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535165763]
[2020-10-11 14:47:47,633 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:47,633 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:47:47,634 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027654180]
[2020-10-11 14:47:47,637 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-11 14:47:47,638 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:47,638 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-11 14:47:47,638 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-11 14:47:47,638 INFO  L87              Difference]: Start difference. First operand 251 states and 563 transitions. Second operand 6 states.
[2020-10-11 14:47:47,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:47,702 INFO  L93              Difference]: Finished difference Result 229 states and 518 transitions.
[2020-10-11 14:47:47,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:47:47,703 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-11 14:47:47,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:47,705 INFO  L225             Difference]: With dead ends: 229
[2020-10-11 14:47:47,705 INFO  L226             Difference]: Without dead ends: 165
[2020-10-11 14:47:47,706 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:47:47,707 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2020-10-11 14:47:47,710 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165.
[2020-10-11 14:47:47,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 165 states.
[2020-10-11 14:47:47,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 378 transitions.
[2020-10-11 14:47:47,711 INFO  L78                 Accepts]: Start accepts. Automaton has 165 states and 378 transitions. Word has length 18
[2020-10-11 14:47:47,712 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:47,712 INFO  L481      AbstractCegarLoop]: Abstraction has 165 states and 378 transitions.
[2020-10-11 14:47:47,712 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-11 14:47:47,712 INFO  L276                IsEmpty]: Start isEmpty. Operand 165 states and 378 transitions.
[2020-10-11 14:47:47,713 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:47:47,713 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:47,713 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:47:47,713 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-10-11 14:47:47,713 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:47,713 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:47,714 INFO  L82        PathProgramCache]: Analyzing trace with hash -417287629, now seen corresponding path program 1 times
[2020-10-11 14:47:47,714 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:47,714 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786968190]
[2020-10-11 14:47:47,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:47,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:47,968 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:47:47,968 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786968190]
[2020-10-11 14:47:47,968 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:47,969 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-11 14:47:47,969 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19855404]
[2020-10-11 14:47:47,969 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-11 14:47:47,969 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:47,969 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-11 14:47:47,970 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-11 14:47:47,970 INFO  L87              Difference]: Start difference. First operand 165 states and 378 transitions. Second operand 7 states.
[2020-10-11 14:47:48,135 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:48,135 INFO  L93              Difference]: Finished difference Result 239 states and 534 transitions.
[2020-10-11 14:47:48,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-11 14:47:48,136 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-11 14:47:48,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:48,138 INFO  L225             Difference]: With dead ends: 239
[2020-10-11 14:47:48,138 INFO  L226             Difference]: Without dead ends: 217
[2020-10-11 14:47:48,138 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90
[2020-10-11 14:47:48,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2020-10-11 14:47:48,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 157.
[2020-10-11 14:47:48,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 157 states.
[2020-10-11 14:47:48,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 354 transitions.
[2020-10-11 14:47:48,145 INFO  L78                 Accepts]: Start accepts. Automaton has 157 states and 354 transitions. Word has length 22
[2020-10-11 14:47:48,145 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:48,145 INFO  L481      AbstractCegarLoop]: Abstraction has 157 states and 354 transitions.
[2020-10-11 14:47:48,145 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-11 14:47:48,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 157 states and 354 transitions.
[2020-10-11 14:47:48,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:47:48,146 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:48,146 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:47:48,147 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-10-11 14:47:48,147 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:48,147 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:48,147 INFO  L82        PathProgramCache]: Analyzing trace with hash 2018415223, now seen corresponding path program 2 times
[2020-10-11 14:47:48,147 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:48,148 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935522036]
[2020-10-11 14:47:48,148 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:48,176 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-11 14:47:48,461 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:47:48,462 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935522036]
[2020-10-11 14:47:48,462 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-11 14:47:48,462 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-10-11 14:47:48,462 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360328936]
[2020-10-11 14:47:48,463 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-11 14:47:48,463 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-11 14:47:48,463 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-11 14:47:48,464 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-11 14:47:48,464 INFO  L87              Difference]: Start difference. First operand 157 states and 354 transitions. Second operand 9 states.
[2020-10-11 14:47:48,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-11 14:47:48,722 INFO  L93              Difference]: Finished difference Result 207 states and 454 transitions.
[2020-10-11 14:47:48,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-11 14:47:48,723 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 22
[2020-10-11 14:47:48,724 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-11 14:47:48,725 INFO  L225             Difference]: With dead ends: 207
[2020-10-11 14:47:48,725 INFO  L226             Difference]: Without dead ends: 133
[2020-10-11 14:47:48,725 INFO  L673         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2020-10-11 14:47:48,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 133 states.
[2020-10-11 14:47:48,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133.
[2020-10-11 14:47:48,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 133 states.
[2020-10-11 14:47:48,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 286 transitions.
[2020-10-11 14:47:48,730 INFO  L78                 Accepts]: Start accepts. Automaton has 133 states and 286 transitions. Word has length 22
[2020-10-11 14:47:48,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-11 14:47:48,730 INFO  L481      AbstractCegarLoop]: Abstraction has 133 states and 286 transitions.
[2020-10-11 14:47:48,730 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-11 14:47:48,731 INFO  L276                IsEmpty]: Start isEmpty. Operand 133 states and 286 transitions.
[2020-10-11 14:47:48,731 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-11 14:47:48,731 INFO  L413         BasicCegarLoop]: Found error trace
[2020-10-11 14:47:48,732 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:47:48,732 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-10-11 14:47:48,732 INFO  L429      AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-11 14:47:48,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-11 14:47:48,732 INFO  L82        PathProgramCache]: Analyzing trace with hash 1443283583, now seen corresponding path program 3 times
[2020-10-11 14:47:48,733 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-11 14:47:48,733 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479625997]
[2020-10-11 14:47:48,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-11 14:47:48,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:47:48,777 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:47:48,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-11 14:47:48,822 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-11 14:47:48,859 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-11 14:47:48,859 INFO  L519         BasicCegarLoop]: Counterexample might be feasible
[2020-10-11 14:47:48,860 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-10-11 14:47:48,880 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:47:48,880 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,882 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:47:48,882 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,882 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:47:48,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,883 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:47:48,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,883 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:47:48,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,884 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:47:48,884 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,885 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:47:48,885 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,885 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:47:48,885 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,885 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:47:48,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,886 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:47:48,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,886 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:47:48,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,887 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,887 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,889 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-11 14:47:48,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,912 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:47:48,913 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,913 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:47:48,913 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,913 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:47:48,913 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,913 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:47:48,914 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,914 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:47:48,914 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,914 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:47:48,914 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,915 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:47:48,915 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,915 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:47:48,915 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,915 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:47:48,915 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,916 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:47:48,916 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,916 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:47:48,916 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,916 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:47:48,916 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,917 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:47:48,917 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,917 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:47:48,917 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,917 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:47:48,918 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,918 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:47:48,918 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,918 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:47:48,918 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,918 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:47:48,919 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-11 14:47:48,984 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:47:48 BasicIcfg
[2020-10-11 14:47:48,984 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-11 14:47:48,986 INFO  L168              Benchmark]: Toolchain (without parser) took 16512.63 ms. Allocated memory was 249.6 MB in the beginning and 557.3 MB in the end (delta: 307.8 MB). Free memory was 205.5 MB in the beginning and 514.6 MB in the end (delta: -309.0 MB). Peak memory consumption was 362.4 MB. Max. memory is 14.2 GB.
[2020-10-11 14:47:48,986 INFO  L168              Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB.
[2020-10-11 14:47:48,987 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 744.86 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 205.5 MB in the beginning and 258.8 MB in the end (delta: -53.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB.
[2020-10-11 14:47:48,988 INFO  L168              Benchmark]: Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 308.8 MB. Free memory was 258.8 MB in the beginning and 256.3 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:47:48,988 INFO  L168              Benchmark]: Boogie Preprocessor took 40.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.3 MB in the beginning and 253.8 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:47:48,989 INFO  L168              Benchmark]: RCFGBuilder took 2062.69 ms. Allocated memory was 308.8 MB in the beginning and 356.0 MB in the end (delta: 47.2 MB). Free memory was 253.8 MB in the beginning and 183.4 MB in the end (delta: 70.4 MB). Peak memory consumption was 117.6 MB. Max. memory is 14.2 GB.
[2020-10-11 14:47:48,990 INFO  L168              Benchmark]: TraceAbstraction took 13594.34 ms. Allocated memory was 356.0 MB in the beginning and 557.3 MB in the end (delta: 201.3 MB). Free memory was 183.4 MB in the beginning and 514.6 MB in the end (delta: -331.2 MB). Peak memory consumption was 233.8 MB. Max. memory is 14.2 GB.
[2020-10-11 14:47:48,993 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.26 ms. Allocated memory is still 249.6 MB. Free memory is still 225.9 MB. There was no memory consumed. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 744.86 ms. Allocated memory was 249.6 MB in the beginning and 308.8 MB in the end (delta: 59.2 MB). Free memory was 205.5 MB in the beginning and 258.8 MB in the end (delta: -53.2 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 64.58 ms. Allocated memory is still 308.8 MB. Free memory was 258.8 MB in the beginning and 256.3 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.40 ms. Allocated memory is still 308.8 MB. Free memory was 256.3 MB in the beginning and 253.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2062.69 ms. Allocated memory was 308.8 MB in the beginning and 356.0 MB in the end (delta: 47.2 MB). Free memory was 253.8 MB in the beginning and 183.4 MB in the end (delta: 70.4 MB). Peak memory consumption was 117.6 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 13594.34 ms. Allocated memory was 356.0 MB in the beginning and 557.3 MB in the end (delta: 201.3 MB). Free memory was 183.4 MB in the beginning and 514.6 MB in the end (delta: -331.2 MB). Peak memory consumption was 233.8 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1149 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 56 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 145 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 102 PlacesBefore, 37 PlacesAfterwards, 94 TransitionsBefore, 28 TransitionsAfterwards, 1724 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 4894 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p2_EAX = 0;
[L702]               0  int __unbuffered_p2_EBX = 0;
[L703]               0  _Bool main$tmp_guard0;
[L704]               0  _Bool main$tmp_guard1;
[L706]               0  int x = 0;
[L707]               0  _Bool x$flush_delayed;
[L708]               0  int x$mem_tmp;
[L709]               0  _Bool x$r_buff0_thd0;
[L710]               0  _Bool x$r_buff0_thd1;
[L711]               0  _Bool x$r_buff0_thd2;
[L712]               0  _Bool x$r_buff0_thd3;
[L713]               0  _Bool x$r_buff1_thd0;
[L714]               0  _Bool x$r_buff1_thd1;
[L715]               0  _Bool x$r_buff1_thd2;
[L716]               0  _Bool x$r_buff1_thd3;
[L717]               0  _Bool x$read_delayed;
[L718]               0  int *x$read_delayed_var;
[L719]               0  int x$w_buff0;
[L720]               0  _Bool x$w_buff0_used;
[L721]               0  int x$w_buff1;
[L722]               0  _Bool x$w_buff1_used;
[L724]               0  int y = 0;
[L726]               0  int z = 0;
[L727]               0  _Bool weak$$choice0;
[L728]               0  _Bool weak$$choice2;
[L812]               0  pthread_t t748;
[L813]  FCALL, FORK  0  pthread_create(&t748, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L814]               0  pthread_t t749;
[L815]  FCALL, FORK  0  pthread_create(&t749, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L752]               2  x$w_buff1 = x$w_buff0
[L753]               2  x$w_buff0 = 2
[L754]               2  x$w_buff1_used = x$w_buff0_used
[L755]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L757]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L758]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L759]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L760]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L761]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L764]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L816]               0  pthread_t t750;
[L817]  FCALL, FORK  0  pthread_create(&t750, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L781]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L784]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L787]               3  __unbuffered_p2_EBX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L790]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L790]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L791]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L791]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L792]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L792]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L793]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L793]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L794]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L794]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L732]               1  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]
[L735]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]
[L767]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L767]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L768]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L768]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L769]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L769]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L770]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L770]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L771]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L771]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L774]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L776]               2  return 0;
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L738]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L738]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L738]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L739]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L739]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L740]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L740]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L741]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L741]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L742]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L742]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L745]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L747]               1  return 0;
[L797]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L799]               3  return 0;
[L819]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L3]    COND FALSE   0  !(!cond)
[L823]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L823]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L823]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L824]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L824]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L825]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L825]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L826]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L826]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L827]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L827]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L830]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L831]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L832]               0  x$flush_delayed = weak$$choice2
[L833]               0  x$mem_tmp = x
[L834]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L834]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L834]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L834]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L835]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L835]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L836]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L836]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)
[L836]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L836]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L837]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L837]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L838]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L838]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L839]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L839]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L840]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L840]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0
[L840]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L840]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L840]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L841]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0)
[L842]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L842]               0  x = x$flush_delayed ? x$mem_tmp : x
[L843]               0  x$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 351 SDtfs, 394 SDslu, 479 SDs, 0 SdLazy, 313 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 149 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 25210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...