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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 11:15:11,403 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 11:15:11,406 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 11:15:11,442 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 11:15:11,442 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 11:15:11,449 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 11:15:11,452 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 11:15:11,456 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 11:15:11,458 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 11:15:11,460 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 11:15:11,461 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 11:15:11,462 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 11:15:11,462 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 11:15:11,465 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 11:15:11,467 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 11:15:11,468 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 11:15:11,469 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 11:15:11,470 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 11:15:11,471 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 11:15:11,479 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 11:15:11,481 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 11:15:11,482 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 11:15:11,482 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 11:15:11,483 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 11:15:11,485 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 11:15:11,486 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 11:15:11,486 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 11:15:11,489 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 11:15:11,489 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 11:15:11,490 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 11:15:11,490 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 11:15:11,491 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 11:15:11,496 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 11:15:11,497 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 11:15:11,498 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 11:15:11,498 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 11:15:11,498 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 11:15:11,498 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 11:15:11,499 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 11:15:11,499 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 11:15:11,500 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 11:15:11,501 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-16 11:15:11,521 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 11:15:11,521 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 11:15:11,522 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 11:15:11,522 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 11:15:11,522 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 11:15:11,523 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 11:15:11,523 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 11:15:11,523 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 11:15:11,523 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 11:15:11,523 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 11:15:11,524 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 11:15:11,524 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 11:15:11,524 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 11:15:11,524 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 11:15:11,524 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 11:15:11,525 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 11:15:11,525 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 11:15:11,525 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 11:15:11,525 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 11:15:11,525 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 11:15:11,525 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 11:15:11,526 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:15:11,526 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 11:15:11,526 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-16 11:15:11,526 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 11:15:11,526 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 11:15:11,527 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 11:15:11,527 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 11:15:11,527 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-16 11:15:11,527 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-16 11:15:11,800 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 11:15:11,814 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 11:15:11,818 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 11:15:11,819 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 11:15:11,819 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 11:15:11,820 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i
[2020-10-16 11:15:11,891 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b37737691/cd62899859d74507931b6fb451b57f94/FLAGa72539c85
[2020-10-16 11:15:12,477 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 11:15:12,478 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i
[2020-10-16 11:15:12,495 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b37737691/cd62899859d74507931b6fb451b57f94/FLAGa72539c85
[2020-10-16 11:15:12,800 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b37737691/cd62899859d74507931b6fb451b57f94
[2020-10-16 11:15:12,809 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 11:15:12,811 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 11:15:12,812 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 11:15:12,812 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 11:15:12,816 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 11:15:12,818 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:12" (1/1) ...
[2020-10-16 11:15:12,820 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d61f71a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:12, skipping insertion in model container
[2020-10-16 11:15:12,821 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:15:12" (1/1) ...
[2020-10-16 11:15:12,829 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 11:15:12,872 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 11:15:13,337 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:15:13,350 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 11:15:13,409 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 11:15:13,498 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 11:15:13,500 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13 WrapperNode
[2020-10-16 11:15:13,500 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 11:15:13,501 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 11:15:13,501 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 11:15:13,501 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 11:15:13,510 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,535 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,571 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 11:15:13,572 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 11:15:13,572 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 11:15:13,572 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 11:15:13,582 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,582 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,587 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,587 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,599 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,603 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,607 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
[2020-10-16 11:15:13,611 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 11:15:13,612 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 11:15:13,614 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 11:15:13,614 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 11:15:13,615 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 11:15:13,679 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 11:15:13,680 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 11:15:13,680 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 11:15:13,680 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 11:15:13,680 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 11:15:13,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 11:15:13,680 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 11:15:13,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 11:15:13,681 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 11:15:13,681 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 11:15:13,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 11:15:13,683 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 11:15:15,443 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 11:15:15,443 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 11:15:15,446 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:15 BoogieIcfgContainer
[2020-10-16 11:15:15,446 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 11:15:15,447 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 11:15:15,447 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 11:15:15,451 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 11:15:15,451 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:15:12" (1/3) ...
[2020-10-16 11:15:15,452 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35857fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:15, skipping insertion in model container
[2020-10-16 11:15:15,452 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:15:13" (2/3) ...
[2020-10-16 11:15:15,453 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35857fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:15:15, skipping insertion in model container
[2020-10-16 11:15:15,453 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:15:15" (3/3) ...
[2020-10-16 11:15:15,455 INFO  L111   eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i
[2020-10-16 11:15:15,467 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 11:15:15,467 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-16 11:15:15,475 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 11:15:15,476 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 11:15:15,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,505 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,505 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,506 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,506 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,507 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,508 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,509 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,509 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,509 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,510 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,510 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,510 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,510 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,511 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,512 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,513 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,513 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,516 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,517 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,517 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,517 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,517 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,518 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,518 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,518 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,525 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,527 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 11:15:15,529 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 11:15:15,542 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2020-10-16 11:15:15,563 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 11:15:15,564 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 11:15:15,564 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-16 11:15:15,564 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-16 11:15:15,564 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 11:15:15,564 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 11:15:15,564 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 11:15:15,565 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 11:15:15,578 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-16 11:15:15,581 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 166 flow
[2020-10-16 11:15:15,584 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 166 flow
[2020-10-16 11:15:15,586 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow
[2020-10-16 11:15:15,625 INFO  L129       PetriNetUnfolder]: 2/76 cut-off events.
[2020-10-16 11:15:15,625 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 11:15:15,630 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. 
[2020-10-16 11:15:15,632 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1012
[2020-10-16 11:15:15,938 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:15,939 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:15,941 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:15,941 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:15,946 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:15,947 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:15,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:15,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,011 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,011 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:16,041 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,043 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,052 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,052 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,056 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,057 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,059 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,059 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,062 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:16,062 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,067 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,067 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,071 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,071 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,131 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,131 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,132 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,132 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,165 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,169 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,170 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,255 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,255 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,256 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,256 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,274 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,275 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,275 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,276 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,315 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,317 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,339 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,340 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,341 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,341 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,370 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,370 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:16,371 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2020-10-16 11:15:16,371 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:16,392 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,393 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,393 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,394 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,422 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,423 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,424 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,424 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,439 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,440 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,485 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,486 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:16,487 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,489 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,489 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,492 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,495 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,496 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:16,496 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:16,498 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:16,498 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,500 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,500 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,501 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,502 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,547 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:16,547 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,549 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:16,549 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,552 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:16,553 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:16,555 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:16,556 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:16,880 WARN  L193               SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 11:15:17,023 WARN  L193               SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 11:15:17,153 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,154 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,154 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:17,155 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,157 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:17,158 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:17,161 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:17,161 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,205 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,205 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:17,211 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,211 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,213 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,213 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,216 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,217 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:17,219 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,219 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:17,220 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:17,221 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:17,227 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:17,227 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,229 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,229 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,232 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,232 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,297 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,298 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:17,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,323 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,324 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,324 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:17,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,354 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,354 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,356 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:17,357 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,379 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:17,379 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:17,380 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:17,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:18,552 WARN  L193               SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 228 DAG size of output: 187
[2020-10-16 11:15:18,569 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2020-10-16 11:15:18,569 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:18,570 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:18,570 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,652 WARN  L193               SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 144 DAG size of output: 124
[2020-10-16 11:15:19,720 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:19,721 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,722 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:19,722 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:19,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,740 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2020-10-16 11:15:19,740 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,808 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,808 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,814 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,814 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,816 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,816 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,818 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,818 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:19,820 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,821 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:19,822 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,822 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:19,824 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:19,824 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:19,826 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,828 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:19,828 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,870 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term
[2020-10-16 11:15:19,870 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,871 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2020-10-16 11:15:19,871 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,873 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:19,874 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-16 11:15:19,876 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term
[2020-10-16 11:15:19,876 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:19,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:19,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,952 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,954 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:19,955 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:19,956 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:19,969 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:19,970 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,970 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,971 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:19,972 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:19,973 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:19,974 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:19,975 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:20,113 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,114 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,115 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 11:15:20,115 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,116 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,116 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,117 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,117 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,118 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,119 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,120 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,120 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,122 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,122 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,123 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,123 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,124 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,124 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,143 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,144 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:20,145 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,146 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,297 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,298 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-16 11:15:20,300 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,300 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,314 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,315 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term
[2020-10-16 11:15:20,316 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,316 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,317 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,318 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,318 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,319 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,320 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,321 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,321 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,323 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term
[2020-10-16 11:15:20,323 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,325 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,325 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,326 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,326 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-16 11:15:20,498 WARN  L193               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 11:15:20,659 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:20,660 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,660 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,661 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,662 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,662 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:20,664 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:20,664 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:20,676 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:20,677 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,677 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,678 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:20,679 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-16 11:15:20,679 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:20,681 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-16 11:15:20,682 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-16 11:15:21,599 WARN  L193               SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121
[2020-10-16 11:15:21,895 WARN  L193               SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 118
[2020-10-16 11:15:22,471 WARN  L193               SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109
[2020-10-16 11:15:22,780 WARN  L193               SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 106
[2020-10-16 11:15:23,395 WARN  L193               SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110
[2020-10-16 11:15:23,682 WARN  L193               SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 107
[2020-10-16 11:15:23,946 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-16 11:15:23,947 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-16 11:15:24,375 WARN  L193               SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 127
[2020-10-16 11:15:24,735 WARN  L193               SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 127
[2020-10-16 11:15:25,054 WARN  L193               SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81
[2020-10-16 11:15:25,147 INFO  L132        LiptonReduction]: Checked pairs total: 3022
[2020-10-16 11:15:25,148 INFO  L134        LiptonReduction]: Total number of compositions: 69
[2020-10-16 11:15:25,154 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions, 52 flow
[2020-10-16 11:15:25,173 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 212 states.
[2020-10-16 11:15:25,175 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states.
[2020-10-16 11:15:25,181 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 11:15:25,181 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:25,182 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 11:15:25,182 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:25,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:25,186 INFO  L82        PathProgramCache]: Analyzing trace with hash 872957254, now seen corresponding path program 1 times
[2020-10-16 11:15:25,197 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:25,197 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740636305]
[2020-10-16 11:15:25,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:25,342 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:25,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:25,434 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740636305]
[2020-10-16 11:15:25,435 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:25,436 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:15:25,437 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845080092]
[2020-10-16 11:15:25,442 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:25,443 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:25,458 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:25,459 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:25,461 INFO  L87              Difference]: Start difference. First operand 212 states. Second operand 3 states.
[2020-10-16 11:15:25,562 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:25,563 INFO  L93              Difference]: Finished difference Result 187 states and 450 transitions.
[2020-10-16 11:15:25,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:25,567 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 11:15:25,567 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:25,584 INFO  L225             Difference]: With dead ends: 187
[2020-10-16 11:15:25,585 INFO  L226             Difference]: Without dead ends: 152
[2020-10-16 11:15:25,586 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:25,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2020-10-16 11:15:25,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2020-10-16 11:15:25,632 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2020-10-16 11:15:25,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 357 transitions.
[2020-10-16 11:15:25,638 INFO  L78                 Accepts]: Start accepts. Automaton has 152 states and 357 transitions. Word has length 5
[2020-10-16 11:15:25,638 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:25,638 INFO  L481      AbstractCegarLoop]: Abstraction has 152 states and 357 transitions.
[2020-10-16 11:15:25,638 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:25,639 INFO  L276                IsEmpty]: Start isEmpty. Operand 152 states and 357 transitions.
[2020-10-16 11:15:25,640 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 11:15:25,640 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:25,640 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:25,640 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 11:15:25,640 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:25,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:25,641 INFO  L82        PathProgramCache]: Analyzing trace with hash 1393376099, now seen corresponding path program 1 times
[2020-10-16 11:15:25,641 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:25,641 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309071419]
[2020-10-16 11:15:25,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:25,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:25,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:25,759 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309071419]
[2020-10-16 11:15:25,759 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:25,759 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:15:25,760 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913722704]
[2020-10-16 11:15:25,761 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:25,761 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:25,761 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:25,762 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:25,762 INFO  L87              Difference]: Start difference. First operand 152 states and 357 transitions. Second operand 3 states.
[2020-10-16 11:15:25,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:25,789 INFO  L93              Difference]: Finished difference Result 147 states and 343 transitions.
[2020-10-16 11:15:25,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:25,790 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 11:15:25,791 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:25,792 INFO  L225             Difference]: With dead ends: 147
[2020-10-16 11:15:25,793 INFO  L226             Difference]: Without dead ends: 147
[2020-10-16 11:15:25,794 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:25,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2020-10-16 11:15:25,806 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2020-10-16 11:15:25,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2020-10-16 11:15:25,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 343 transitions.
[2020-10-16 11:15:25,808 INFO  L78                 Accepts]: Start accepts. Automaton has 147 states and 343 transitions. Word has length 7
[2020-10-16 11:15:25,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:25,808 INFO  L481      AbstractCegarLoop]: Abstraction has 147 states and 343 transitions.
[2020-10-16 11:15:25,808 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:25,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 147 states and 343 transitions.
[2020-10-16 11:15:25,809 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2020-10-16 11:15:25,809 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:25,809 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:25,809 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 11:15:25,810 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:25,810 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:25,810 INFO  L82        PathProgramCache]: Analyzing trace with hash 243471209, now seen corresponding path program 1 times
[2020-10-16 11:15:25,810 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:25,811 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429916209]
[2020-10-16 11:15:25,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:25,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:25,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:25,878 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429916209]
[2020-10-16 11:15:25,878 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:25,878 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:15:25,879 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114573720]
[2020-10-16 11:15:25,879 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:15:25,879 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:25,879 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:15:25,880 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:15:25,880 INFO  L87              Difference]: Start difference. First operand 147 states and 343 transitions. Second operand 4 states.
[2020-10-16 11:15:25,952 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:25,952 INFO  L93              Difference]: Finished difference Result 141 states and 326 transitions.
[2020-10-16 11:15:25,953 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 11:15:25,953 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 8
[2020-10-16 11:15:25,954 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:25,955 INFO  L225             Difference]: With dead ends: 141
[2020-10-16 11:15:25,955 INFO  L226             Difference]: Without dead ends: 141
[2020-10-16 11:15:25,956 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:25,957 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2020-10-16 11:15:25,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141.
[2020-10-16 11:15:25,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 141 states.
[2020-10-16 11:15:25,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 326 transitions.
[2020-10-16 11:15:25,967 INFO  L78                 Accepts]: Start accepts. Automaton has 141 states and 326 transitions. Word has length 8
[2020-10-16 11:15:25,967 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:25,968 INFO  L481      AbstractCegarLoop]: Abstraction has 141 states and 326 transitions.
[2020-10-16 11:15:25,968 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:15:25,968 INFO  L276                IsEmpty]: Start isEmpty. Operand 141 states and 326 transitions.
[2020-10-16 11:15:25,969 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 11:15:25,969 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:25,969 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:25,969 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 11:15:25,969 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:25,969 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:25,970 INFO  L82        PathProgramCache]: Analyzing trace with hash 1447425666, now seen corresponding path program 1 times
[2020-10-16 11:15:25,970 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:25,970 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210060462]
[2020-10-16 11:15:25,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:25,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,052 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210060462]
[2020-10-16 11:15:26,053 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,053 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:15:26,053 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451319381]
[2020-10-16 11:15:26,053 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:15:26,054 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,054 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:15:26,054 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:26,054 INFO  L87              Difference]: Start difference. First operand 141 states and 326 transitions. Second operand 5 states.
[2020-10-16 11:15:26,134 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,134 INFO  L93              Difference]: Finished difference Result 141 states and 314 transitions.
[2020-10-16 11:15:26,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:15:26,135 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 9
[2020-10-16 11:15:26,135 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,138 INFO  L225             Difference]: With dead ends: 141
[2020-10-16 11:15:26,138 INFO  L226             Difference]: Without dead ends: 141
[2020-10-16 11:15:26,138 INFO  L677         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-16 11:15:26,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2020-10-16 11:15:26,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141.
[2020-10-16 11:15:26,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 141 states.
[2020-10-16 11:15:26,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 314 transitions.
[2020-10-16 11:15:26,150 INFO  L78                 Accepts]: Start accepts. Automaton has 141 states and 314 transitions. Word has length 9
[2020-10-16 11:15:26,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,150 INFO  L481      AbstractCegarLoop]: Abstraction has 141 states and 314 transitions.
[2020-10-16 11:15:26,150 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:15:26,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 141 states and 314 transitions.
[2020-10-16 11:15:26,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:15:26,151 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,152 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,152 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 11:15:26,152 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,152 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,152 INFO  L82        PathProgramCache]: Analyzing trace with hash -975752067, now seen corresponding path program 1 times
[2020-10-16 11:15:26,152 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,153 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688047412]
[2020-10-16 11:15:26,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,237 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688047412]
[2020-10-16 11:15:26,237 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,238 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 11:15:26,241 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393953311]
[2020-10-16 11:15:26,241 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:26,241 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,241 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:26,242 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:26,242 INFO  L87              Difference]: Start difference. First operand 141 states and 314 transitions. Second operand 3 states.
[2020-10-16 11:15:26,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,252 INFO  L93              Difference]: Finished difference Result 139 states and 310 transitions.
[2020-10-16 11:15:26,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:26,253 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:15:26,253 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,254 INFO  L225             Difference]: With dead ends: 139
[2020-10-16 11:15:26,254 INFO  L226             Difference]: Without dead ends: 139
[2020-10-16 11:15:26,254 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:26,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2020-10-16 11:15:26,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139.
[2020-10-16 11:15:26,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 139 states.
[2020-10-16 11:15:26,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 310 transitions.
[2020-10-16 11:15:26,268 INFO  L78                 Accepts]: Start accepts. Automaton has 139 states and 310 transitions. Word has length 12
[2020-10-16 11:15:26,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,269 INFO  L481      AbstractCegarLoop]: Abstraction has 139 states and 310 transitions.
[2020-10-16 11:15:26,269 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:26,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 139 states and 310 transitions.
[2020-10-16 11:15:26,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:15:26,270 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,271 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,271 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 11:15:26,271 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,271 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,271 INFO  L82        PathProgramCache]: Analyzing trace with hash -1214858387, now seen corresponding path program 1 times
[2020-10-16 11:15:26,272 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,272 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030262347]
[2020-10-16 11:15:26,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,312 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030262347]
[2020-10-16 11:15:26,313 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,313 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 11:15:26,313 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629567906]
[2020-10-16 11:15:26,313 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 11:15:26,314 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,314 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 11:15:26,314 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 11:15:26,314 INFO  L87              Difference]: Start difference. First operand 139 states and 310 transitions. Second operand 3 states.
[2020-10-16 11:15:26,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,330 INFO  L93              Difference]: Finished difference Result 198 states and 441 transitions.
[2020-10-16 11:15:26,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:26,331 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 11:15:26,331 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,332 INFO  L225             Difference]: With dead ends: 198
[2020-10-16 11:15:26,332 INFO  L226             Difference]: Without dead ends: 97
[2020-10-16 11:15:26,333 INFO  L677         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-16 11:15:26,333 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2020-10-16 11:15:26,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2020-10-16 11:15:26,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2020-10-16 11:15:26,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 213 transitions.
[2020-10-16 11:15:26,338 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 213 transitions. Word has length 12
[2020-10-16 11:15:26,338 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,338 INFO  L481      AbstractCegarLoop]: Abstraction has 97 states and 213 transitions.
[2020-10-16 11:15:26,339 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 11:15:26,339 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 213 transitions.
[2020-10-16 11:15:26,340 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 11:15:26,340 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,340 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,340 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 11:15:26,340 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,341 INFO  L82        PathProgramCache]: Analyzing trace with hash 608633669, now seen corresponding path program 2 times
[2020-10-16 11:15:26,341 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,341 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948685165]
[2020-10-16 11:15:26,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,472 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948685165]
[2020-10-16 11:15:26,472 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,472 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:15:26,472 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760994185]
[2020-10-16 11:15:26,473 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:15:26,473 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,473 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:15:26,473 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:26,474 INFO  L87              Difference]: Start difference. First operand 97 states and 213 transitions. Second operand 5 states.
[2020-10-16 11:15:26,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,503 INFO  L93              Difference]: Finished difference Result 96 states and 210 transitions.
[2020-10-16 11:15:26,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 11:15:26,504 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 11:15:26,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,505 INFO  L225             Difference]: With dead ends: 96
[2020-10-16 11:15:26,505 INFO  L226             Difference]: Without dead ends: 96
[2020-10-16 11:15:26,505 INFO  L677         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-16 11:15:26,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2020-10-16 11:15:26,509 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2020-10-16 11:15:26,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2020-10-16 11:15:26,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 210 transitions.
[2020-10-16 11:15:26,510 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 210 transitions. Word has length 12
[2020-10-16 11:15:26,511 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,511 INFO  L481      AbstractCegarLoop]: Abstraction has 96 states and 210 transitions.
[2020-10-16 11:15:26,511 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:15:26,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 210 transitions.
[2020-10-16 11:15:26,512 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 11:15:26,512 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,512 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,512 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 11:15:26,512 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,513 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,513 INFO  L82        PathProgramCache]: Analyzing trace with hash 1687741796, now seen corresponding path program 1 times
[2020-10-16 11:15:26,513 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,513 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112209123]
[2020-10-16 11:15:26,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,630 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112209123]
[2020-10-16 11:15:26,630 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,630 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 11:15:26,631 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580170921]
[2020-10-16 11:15:26,631 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 11:15:26,631 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,631 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 11:15:26,632 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 11:15:26,632 INFO  L87              Difference]: Start difference. First operand 96 states and 210 transitions. Second operand 4 states.
[2020-10-16 11:15:26,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,658 INFO  L93              Difference]: Finished difference Result 82 states and 151 transitions.
[2020-10-16 11:15:26,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 11:15:26,659 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2020-10-16 11:15:26,659 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,660 INFO  L225             Difference]: With dead ends: 82
[2020-10-16 11:15:26,660 INFO  L226             Difference]: Without dead ends: 55
[2020-10-16 11:15:26,660 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:26,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2020-10-16 11:15:26,662 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2020-10-16 11:15:26,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2020-10-16 11:15:26,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions.
[2020-10-16 11:15:26,663 INFO  L78                 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 13
[2020-10-16 11:15:26,663 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,663 INFO  L481      AbstractCegarLoop]: Abstraction has 55 states and 91 transitions.
[2020-10-16 11:15:26,663 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 11:15:26,663 INFO  L276                IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions.
[2020-10-16 11:15:26,664 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 11:15:26,664 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,664 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,665 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 11:15:26,665 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,665 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,665 INFO  L82        PathProgramCache]: Analyzing trace with hash -1727981485, now seen corresponding path program 1 times
[2020-10-16 11:15:26,665 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,666 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275994605]
[2020-10-16 11:15:26,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,703 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:26,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:26,765 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275994605]
[2020-10-16 11:15:26,765 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:26,765 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 11:15:26,765 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573066832]
[2020-10-16 11:15:26,766 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 11:15:26,766 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:26,766 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 11:15:26,766 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 11:15:26,767 INFO  L87              Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 5 states.
[2020-10-16 11:15:26,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:26,805 INFO  L93              Difference]: Finished difference Result 43 states and 65 transitions.
[2020-10-16 11:15:26,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:15:26,811 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 11:15:26,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:26,811 INFO  L225             Difference]: With dead ends: 43
[2020-10-16 11:15:26,811 INFO  L226             Difference]: Without dead ends: 34
[2020-10-16 11:15:26,811 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 11:15:26,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2020-10-16 11:15:26,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34.
[2020-10-16 11:15:26,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2020-10-16 11:15:26,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions.
[2020-10-16 11:15:26,813 INFO  L78                 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 14
[2020-10-16 11:15:26,813 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:26,813 INFO  L481      AbstractCegarLoop]: Abstraction has 34 states and 49 transitions.
[2020-10-16 11:15:26,814 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 11:15:26,814 INFO  L276                IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions.
[2020-10-16 11:15:26,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:15:26,814 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:26,815 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:26,815 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 11:15:26,815 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:26,815 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:26,815 INFO  L82        PathProgramCache]: Analyzing trace with hash 1918077124, now seen corresponding path program 1 times
[2020-10-16 11:15:26,816 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:26,816 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022514630]
[2020-10-16 11:15:26,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:26,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 11:15:27,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 11:15:27,045 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022514630]
[2020-10-16 11:15:27,045 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 11:15:27,046 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 11:15:27,046 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532703385]
[2020-10-16 11:15:27,047 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 11:15:27,047 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 11:15:27,047 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 11:15:27,048 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2020-10-16 11:15:27,048 INFO  L87              Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 7 states.
[2020-10-16 11:15:27,145 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 11:15:27,145 INFO  L93              Difference]: Finished difference Result 42 states and 58 transitions.
[2020-10-16 11:15:27,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 11:15:27,146 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2020-10-16 11:15:27,146 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 11:15:27,147 INFO  L225             Difference]: With dead ends: 42
[2020-10-16 11:15:27,147 INFO  L226             Difference]: Without dead ends: 30
[2020-10-16 11:15:27,147 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2020-10-16 11:15:27,147 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2020-10-16 11:15:27,149 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2020-10-16 11:15:27,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2020-10-16 11:15:27,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions.
[2020-10-16 11:15:27,149 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17
[2020-10-16 11:15:27,149 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 11:15:27,150 INFO  L481      AbstractCegarLoop]: Abstraction has 30 states and 41 transitions.
[2020-10-16 11:15:27,150 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 11:15:27,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions.
[2020-10-16 11:15:27,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2020-10-16 11:15:27,150 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 11:15:27,150 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 11:15:27,151 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 11:15:27,151 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 11:15:27,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 11:15:27,151 INFO  L82        PathProgramCache]: Analyzing trace with hash 483918532, now seen corresponding path program 2 times
[2020-10-16 11:15:27,151 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 11:15:27,152 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399344426]
[2020-10-16 11:15:27,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 11:15:27,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:15:27,189 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:15:27,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 11:15:27,223 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 11:15:27,255 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 11:15:27,255 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 11:15:27,255 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 11:15:27,256 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 11:15:27,264 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L2-->L803: Formula: (let ((.cse6 (= (mod ~x$w_buff1_used~0_In-1344780889 256) 0)) (.cse7 (= (mod ~x$r_buff1_thd0~0_In-1344780889 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-1344780889 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-1344780889 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1344780889| ULTIMATE.start_assume_abort_if_not_~cond_Out-1344780889) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1344780889 0)) (or (and (= ~x$w_buff0_used~0_Out-1344780889 0) .cse0 .cse1) (and .cse2 (= ~x$w_buff0_used~0_In-1344780889 ~x$w_buff0_used~0_Out-1344780889))) (or (and (= ~x~0_Out-1344780889 ~x$w_buff0~0_In-1344780889) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~x~0_Out-1344780889 ~x$w_buff1~0_In-1344780889) .cse4) (and .cse5 (= ~x~0_Out-1344780889 ~x~0_In-1344780889))))) (= ~x$r_buff1_thd0~0_In-1344780889 ~x$r_buff1_thd0~0_Out-1344780889) (= ~x$r_buff0_thd0~0_Out-1344780889 ~x$r_buff0_thd0~0_In-1344780889) (or (and .cse5 (= ~x$w_buff1_used~0_In-1344780889 ~x$w_buff1_used~0_Out-1344780889)) (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out-1344780889 0))))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In-1344780889, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1344780889, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1344780889|, ~x$w_buff1~0=~x$w_buff1~0_In-1344780889, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1344780889, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1344780889, ~x~0=~x~0_In-1344780889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1344780889}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1344780889, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1344780889, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1344780889|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1344780889|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1344780889|, ~x$w_buff1~0=~x$w_buff1~0_In-1344780889, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1344780889, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1344780889|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1344780889, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1344780889|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1344780889|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1344780889, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1344780889|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1344780889, ~x~0=~x~0_Out-1344780889}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite16, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge
[2020-10-16 11:15:27,269 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,269 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,271 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,271 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,271 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,272 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,272 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,273 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,273 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,274 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,274 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,275 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,275 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,276 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,276 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,276 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,277 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,277 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,277 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,277 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,278 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,278 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,278 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,278 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,278 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,278 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,279 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,279 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,279 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,279 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,279 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,280 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,280 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,280 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,280 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,280 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 11:15:27,280 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 11:15:27,327 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:15:27 BasicIcfg
[2020-10-16 11:15:27,327 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 11:15:27,329 INFO  L168              Benchmark]: Toolchain (without parser) took 14518.03 ms. Allocated memory was 140.5 MB in the beginning and 412.6 MB in the end (delta: 272.1 MB). Free memory was 101.7 MB in the beginning and 316.4 MB in the end (delta: -214.7 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,330 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,330 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 688.30 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.5 MB in the beginning and 156.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,331 INFO  L168              Benchmark]: Boogie Procedure Inliner took 70.84 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,332 INFO  L168              Benchmark]: Boogie Preprocessor took 39.63 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,332 INFO  L168              Benchmark]: RCFGBuilder took 1834.26 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 151.3 MB in the beginning and 193.7 MB in the end (delta: -42.4 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,333 INFO  L168              Benchmark]: TraceAbstraction took 11879.87 ms. Allocated memory was 247.5 MB in the beginning and 412.6 MB in the end (delta: 165.2 MB). Free memory was 193.7 MB in the beginning and 316.4 MB in the end (delta: -122.6 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB.
[2020-10-16 11:15:27,341 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.21 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 688.30 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 101.5 MB in the beginning and 156.4 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 70.84 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 39.63 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1834.26 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 151.3 MB in the beginning and 193.7 MB in the end (delta: -42.4 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 11879.87 ms. Allocated memory was 247.5 MB in the beginning and 412.6 MB in the end (delta: 165.2 MB). Free memory was 193.7 MB in the beginning and 316.4 MB in the end (delta: -122.6 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    635 VarBasedMoverChecksPositive, 56 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.5s, 83 PlacesBefore, 28 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1012 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 69 TotalNumberOfCompositions, 3022 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L697]               0  int __unbuffered_cnt = 0;
[L699]               0  int __unbuffered_p1_EAX = 0;
[L701]               0  int __unbuffered_p1_EBX = 0;
[L702]               0  _Bool main$tmp_guard0;
[L703]               0  _Bool main$tmp_guard1;
[L705]               0  int x = 0;
[L706]               0  _Bool x$flush_delayed;
[L707]               0  int x$mem_tmp;
[L708]               0  _Bool x$r_buff0_thd0;
[L709]               0  _Bool x$r_buff0_thd1;
[L710]               0  _Bool x$r_buff0_thd2;
[L711]               0  _Bool x$r_buff1_thd0;
[L712]               0  _Bool x$r_buff1_thd1;
[L713]               0  _Bool x$r_buff1_thd2;
[L714]               0  _Bool x$read_delayed;
[L715]               0  int *x$read_delayed_var;
[L716]               0  int x$w_buff0;
[L717]               0  _Bool x$w_buff0_used;
[L718]               0  int x$w_buff1;
[L719]               0  _Bool x$w_buff1_used;
[L721]               0  int y = 0;
[L722]               0  _Bool weak$$choice0;
[L723]               0  _Bool weak$$choice2;
[L789]               0  pthread_t t1591;
[L790]  FCALL, FORK  0  pthread_create(&t1591, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L791]               0  pthread_t t1592;
[L792]  FCALL, FORK  0  pthread_create(&t1592, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L747]               2  x$w_buff1 = x$w_buff0
[L748]               2  x$w_buff0 = 2
[L749]               2  x$w_buff1_used = x$w_buff0_used
[L750]               2  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    2  !expression
[L7]                 2  __VERIFIER_error()
[L752]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L753]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L754]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L755]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L758]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L761]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L764]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L727]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L730]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]
[L733]  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)
[L733]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L733]  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)
[L733]               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)
[L734]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L734]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L735]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L735]               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
[L736]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L736]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L737]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L737]               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
[L740]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L742]               1  return 0;
[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]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[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;
[L794]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L805]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L806]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L807]               0  x$flush_delayed = weak$$choice2
[L808]               0  x$mem_tmp = x
[L809]  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)
[L809]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1
[L809]  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)
[L809]               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)
[L810]  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))
[L810]  EXPR         0  !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)
[L810]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0
[L810]  EXPR         0  !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)
[L810]  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))
[L810]               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))
[L811]  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))
[L811]  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)
[L811]  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))
[L811]               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))
[L812]  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))
[L812]               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))
[L813]  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))
[L813]               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))
[L814]  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))
[L814]               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))
[L815]  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))
[L815]  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)
[L815]  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))
[L815]               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))
[L816]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1)
[L817]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L817]               0  x = x$flush_delayed ? x$mem_tmp : x
[L818]               0  x$flush_delayed = (_Bool)0
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 77 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 161 SDtfs, 134 SDslu, 164 SDs, 0 SdLazy, 152 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 7462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...