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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:30:54,253 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:30:54,257 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:30:54,300 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:30:54,301 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:30:54,313 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:30:54,314 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:30:54,317 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:30:54,319 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:30:54,321 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:30:54,322 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:30:54,326 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:30:54,326 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:30:54,328 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:30:54,331 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:30:54,332 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:30:54,333 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:30:54,335 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:30:54,337 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:30:54,343 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:30:54,346 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:30:54,347 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:30:54,348 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:30:54,349 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:30:54,354 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:30:54,355 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:30:54,355 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:30:54,357 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:30:54,358 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:30:54,360 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:30:54,360 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:30:54,361 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:30:54,362 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:30:54,362 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:30:54,364 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:30:54,364 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:30:54,364 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:30:54,365 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:30:54,365 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:30:54,366 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:30:54,367 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:30:54,368 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 13:30:54,414 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:30:54,414 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:30:54,417 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:30:54,417 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:30:54,417 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:30:54,418 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:30:54,418 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:30:54,418 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:30:54,418 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:30:54,419 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:30:54,420 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:30:54,420 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:30:54,421 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:30:54,421 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:30:54,421 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:30:54,421 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:30:54,422 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:30:54,422 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:30:54,422 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:30:54,422 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:30:54,422 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:30:54,423 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:30:54,423 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:30:54,423 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:30:54,423 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:30:54,424 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:30:54,424 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:30:54,424 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:30:54,424 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:30:54,424 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:30:54,425 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:30:54,701 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:30:54,718 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:30:54,723 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:30:54,726 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:30:54,729 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:30:54,730 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i
[2020-10-16 13:30:54,788 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/28a96f464/3113450f6eec4b40bef28ac4902fdcd8/FLAG6db8f050f
[2020-10-16 13:30:55,344 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:30:55,345 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/rfi007_power.opt.i
[2020-10-16 13:30:55,361 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/28a96f464/3113450f6eec4b40bef28ac4902fdcd8/FLAG6db8f050f
[2020-10-16 13:30:55,642 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/28a96f464/3113450f6eec4b40bef28ac4902fdcd8
[2020-10-16 13:30:55,651 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:30:55,653 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:30:55,654 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:30:55,654 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:30:55,658 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:30:55,659 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:55" (1/1) ...
[2020-10-16 13:30:55,662 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bed9109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:55, skipping insertion in model container
[2020-10-16 13:30:55,663 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:55" (1/1) ...
[2020-10-16 13:30:55,671 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:30:55,737 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:30:56,310 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:30:56,327 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:30:56,389 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:30:56,470 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:30:56,470 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56 WrapperNode
[2020-10-16 13:30:56,470 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:30:56,471 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:30:56,471 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:30:56,472 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:30:56,480 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,500 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,531 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:30:56,532 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:30:56,532 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:30:56,532 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:30:56,542 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,542 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,548 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,548 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,561 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,574 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,579 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
[2020-10-16 13:30:56,585 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:30:56,585 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:30:56,585 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:30:56,586 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:30:56,586 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:30:56,647 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:30:56,647 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:30:56,647 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:30:56,647 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:30:56,648 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:30:56,648 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:30:56,648 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:30:56,648 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:30:56,648 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:30:56,649 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:30:56,649 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:30:56,651 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 13:30:58,528 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:30:58,529 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:30:58,531 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:58 BoogieIcfgContainer
[2020-10-16 13:30:58,531 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:30:58,533 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:30:58,533 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:30:58,537 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:30:58,537 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:30:55" (1/3) ...
[2020-10-16 13:30:58,538 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcd8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:58, skipping insertion in model container
[2020-10-16 13:30:58,538 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:56" (2/3) ...
[2020-10-16 13:30:58,539 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dcd8c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:58, skipping insertion in model container
[2020-10-16 13:30:58,539 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:58" (3/3) ...
[2020-10-16 13:30:58,541 INFO  L111   eAbstractionObserver]: Analyzing ICFG rfi007_power.opt.i
[2020-10-16 13:30:58,554 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:30:58,554 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:30:58,562 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:30:58,563 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:30:58,593 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,595 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,595 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,595 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,596 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,596 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,596 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,597 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,597 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,597 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,597 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,598 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,598 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,598 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,598 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,599 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,599 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,599 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,600 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,601 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,602 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,603 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,603 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,603 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,603 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,603 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,604 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,605 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,606 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,606 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,606 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,606 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,606 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,607 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,608 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,608 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,609 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,609 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,609 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,609 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,609 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,610 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,610 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,614 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,615 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,615 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,615 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,615 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,615 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,616 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,616 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,616 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,616 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,616 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,617 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,623 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,623 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,623 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,626 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,626 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,627 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,628 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,629 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,629 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,629 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,629 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,629 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,630 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:30:58,631 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:30:58,645 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2020-10-16 13:30:58,667 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:30:58,667 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:30:58,667 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:30:58,667 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:30:58,668 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:30:58,668 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:30:58,668 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:30:58,668 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:30:58,682 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:30:58,683 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 164 flow
[2020-10-16 13:30:58,686 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 164 flow
[2020-10-16 13:30:58,688 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 164 flow
[2020-10-16 13:30:58,730 INFO  L129       PetriNetUnfolder]: 2/75 cut-off events.
[2020-10-16 13:30:58,730 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:30:58,735 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 82 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. 
[2020-10-16 13:30:58,738 INFO  L117        LiptonReduction]: Number of co-enabled transitions 960
[2020-10-16 13:30:58,972 WARN  L193               SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38
[2020-10-16 13:30:59,463 WARN  L193               SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:30:59,585 WARN  L193               SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53
[2020-10-16 13:30:59,852 WARN  L193               SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-16 13:31:00,867 WARN  L193               SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81
[2020-10-16 13:31:00,966 INFO  L132        LiptonReduction]: Checked pairs total: 2466
[2020-10-16 13:31:00,966 INFO  L134        LiptonReduction]: Total number of compositions: 66
[2020-10-16 13:31:00,973 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 20 transitions, 50 flow
[2020-10-16 13:31:00,990 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 194 states.
[2020-10-16 13:31:00,992 INFO  L276                IsEmpty]: Start isEmpty. Operand 194 states.
[2020-10-16 13:31:00,999 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-16 13:31:00,999 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:01,000 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-16 13:31:01,001 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:01,006 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:01,007 INFO  L82        PathProgramCache]: Analyzing trace with hash 902458, now seen corresponding path program 1 times
[2020-10-16 13:31:01,037 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:01,037 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809058329]
[2020-10-16 13:31:01,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:01,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:01,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:01,252 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809058329]
[2020-10-16 13:31:01,253 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:01,254 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:31:01,254 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1353522431]
[2020-10-16 13:31:01,255 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:01,258 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:01,271 INFO  L258    McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions.
[2020-10-16 13:31:01,272 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:01,276 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:01,277 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:31:01,277 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:01,292 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:31:01,293 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,296 INFO  L87              Difference]: Start difference. First operand 194 states. Second operand 3 states.
[2020-10-16 13:31:01,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:01,352 INFO  L93              Difference]: Finished difference Result 162 states and 385 transitions.
[2020-10-16 13:31:01,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:31:01,354 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-16 13:31:01,355 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:01,367 INFO  L225             Difference]: With dead ends: 162
[2020-10-16 13:31:01,367 INFO  L226             Difference]: Without dead ends: 132
[2020-10-16 13:31:01,369 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2020-10-16 13:31:01,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2020-10-16 13:31:01,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 132 states.
[2020-10-16 13:31:01,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions.
[2020-10-16 13:31:01,448 INFO  L78                 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3
[2020-10-16 13:31:01,448 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:01,448 INFO  L481      AbstractCegarLoop]: Abstraction has 132 states and 306 transitions.
[2020-10-16 13:31:01,448 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:31:01,449 INFO  L276                IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions.
[2020-10-16 13:31:01,449 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2020-10-16 13:31:01,449 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:01,450 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:01,450 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:31:01,450 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:01,451 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:01,451 INFO  L82        PathProgramCache]: Analyzing trace with hash 270870414, now seen corresponding path program 1 times
[2020-10-16 13:31:01,456 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:01,456 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668443303]
[2020-10-16 13:31:01,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:01,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:01,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:01,525 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668443303]
[2020-10-16 13:31:01,526 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:01,526 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:31:01,526 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056220331]
[2020-10-16 13:31:01,526 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:01,527 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:01,529 INFO  L258    McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions.
[2020-10-16 13:31:01,529 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:01,529 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:01,531 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:31:01,531 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:01,531 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:31:01,532 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,532 INFO  L87              Difference]: Start difference. First operand 132 states and 306 transitions. Second operand 3 states.
[2020-10-16 13:31:01,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:01,542 INFO  L93              Difference]: Finished difference Result 130 states and 300 transitions.
[2020-10-16 13:31:01,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:31:01,543 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2020-10-16 13:31:01,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:01,544 INFO  L225             Difference]: With dead ends: 130
[2020-10-16 13:31:01,545 INFO  L226             Difference]: Without dead ends: 130
[2020-10-16 13:31:01,546 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,547 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2020-10-16 13:31:01,557 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130.
[2020-10-16 13:31:01,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 130 states.
[2020-10-16 13:31:01,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 300 transitions.
[2020-10-16 13:31:01,560 INFO  L78                 Accepts]: Start accepts. Automaton has 130 states and 300 transitions. Word has length 7
[2020-10-16 13:31:01,560 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:01,560 INFO  L481      AbstractCegarLoop]: Abstraction has 130 states and 300 transitions.
[2020-10-16 13:31:01,560 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:31:01,560 INFO  L276                IsEmpty]: Start isEmpty. Operand 130 states and 300 transitions.
[2020-10-16 13:31:01,561 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2020-10-16 13:31:01,561 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:01,561 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:01,562 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:31:01,562 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:01,562 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:01,562 INFO  L82        PathProgramCache]: Analyzing trace with hash -193915879, now seen corresponding path program 1 times
[2020-10-16 13:31:01,563 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:01,564 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500015249]
[2020-10-16 13:31:01,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:01,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:01,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:01,648 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500015249]
[2020-10-16 13:31:01,648 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:01,648 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:31:01,649 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802490391]
[2020-10-16 13:31:01,649 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:01,650 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:01,652 INFO  L258    McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions.
[2020-10-16 13:31:01,652 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:01,688 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:01,688 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:31:01,689 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:01,689 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:31:01,689 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,689 INFO  L87              Difference]: Start difference. First operand 130 states and 300 transitions. Second operand 3 states.
[2020-10-16 13:31:01,699 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:01,702 INFO  L93              Difference]: Finished difference Result 122 states and 278 transitions.
[2020-10-16 13:31:01,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:31:01,703 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 8
[2020-10-16 13:31:01,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:01,704 INFO  L225             Difference]: With dead ends: 122
[2020-10-16 13:31:01,704 INFO  L226             Difference]: Without dead ends: 122
[2020-10-16 13:31:01,706 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:01,708 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2020-10-16 13:31:01,722 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122.
[2020-10-16 13:31:01,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2020-10-16 13:31:01,726 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions.
[2020-10-16 13:31:01,726 INFO  L78                 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 8
[2020-10-16 13:31:01,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:01,727 INFO  L481      AbstractCegarLoop]: Abstraction has 122 states and 278 transitions.
[2020-10-16 13:31:01,727 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:31:01,727 INFO  L276                IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions.
[2020-10-16 13:31:01,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:31:01,730 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:01,730 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:01,730 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:31:01,731 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:01,731 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:01,731 INFO  L82        PathProgramCache]: Analyzing trace with hash -1718074267, now seen corresponding path program 1 times
[2020-10-16 13:31:01,732 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:01,733 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087291676]
[2020-10-16 13:31:01,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:01,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:01,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:01,818 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087291676]
[2020-10-16 13:31:01,818 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:01,818 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:31:01,819 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582383205]
[2020-10-16 13:31:01,819 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:01,820 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:01,821 INFO  L258    McrAutomatonBuilder]: Finished intersection with 14 states and 17 transitions.
[2020-10-16 13:31:01,821 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:01,845 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:01,845 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:31:01,846 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:01,846 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:31:01,846 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:31:01,846 INFO  L87              Difference]: Start difference. First operand 122 states and 278 transitions. Second operand 4 states.
[2020-10-16 13:31:01,875 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:01,876 INFO  L93              Difference]: Finished difference Result 100 states and 191 transitions.
[2020-10-16 13:31:01,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:31:01,876 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 9
[2020-10-16 13:31:01,876 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:01,877 INFO  L225             Difference]: With dead ends: 100
[2020-10-16 13:31:01,877 INFO  L226             Difference]: Without dead ends: 70
[2020-10-16 13:31:01,878 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:31:01,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2020-10-16 13:31:01,881 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2020-10-16 13:31:01,882 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2020-10-16 13:31:01,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions.
[2020-10-16 13:31:01,883 INFO  L78                 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9
[2020-10-16 13:31:01,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:01,883 INFO  L481      AbstractCegarLoop]: Abstraction has 70 states and 122 transitions.
[2020-10-16 13:31:01,883 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:31:01,883 INFO  L276                IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions.
[2020-10-16 13:31:01,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:31:01,884 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:01,884 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:01,884 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:31:01,885 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:01,885 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:01,885 INFO  L82        PathProgramCache]: Analyzing trace with hash -1630846078, now seen corresponding path program 1 times
[2020-10-16 13:31:01,886 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:01,886 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467084548]
[2020-10-16 13:31:01,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:01,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:02,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:02,023 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467084548]
[2020-10-16 13:31:02,023 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:02,023 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:31:02,023 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785940936]
[2020-10-16 13:31:02,023 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:02,026 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:02,032 INFO  L258    McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions.
[2020-10-16 13:31:02,033 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:02,033 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:02,033 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:31:02,034 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:02,036 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:31:02,037 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:31:02,037 INFO  L87              Difference]: Start difference. First operand 70 states and 122 transitions. Second operand 5 states.
[2020-10-16 13:31:02,073 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:02,074 INFO  L93              Difference]: Finished difference Result 55 states and 90 transitions.
[2020-10-16 13:31:02,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:31:02,074 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 12
[2020-10-16 13:31:02,075 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:02,075 INFO  L225             Difference]: With dead ends: 55
[2020-10-16 13:31:02,075 INFO  L226             Difference]: Without dead ends: 45
[2020-10-16 13:31:02,076 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 13:31:02,076 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2020-10-16 13:31:02,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2020-10-16 13:31:02,078 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2020-10-16 13:31:02,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions.
[2020-10-16 13:31:02,079 INFO  L78                 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12
[2020-10-16 13:31:02,079 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:02,079 INFO  L481      AbstractCegarLoop]: Abstraction has 45 states and 72 transitions.
[2020-10-16 13:31:02,080 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:31:02,080 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions.
[2020-10-16 13:31:02,080 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:31:02,081 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:02,081 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:02,081 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:31:02,081 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:02,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:02,082 INFO  L82        PathProgramCache]: Analyzing trace with hash 1657869163, now seen corresponding path program 1 times
[2020-10-16 13:31:02,084 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:02,084 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6571518]
[2020-10-16 13:31:02,084 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:02,107 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:02,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:02,134 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6571518]
[2020-10-16 13:31:02,134 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:02,134 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:31:02,135 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1069347805]
[2020-10-16 13:31:02,135 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:02,139 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:02,148 INFO  L258    McrAutomatonBuilder]: Finished intersection with 28 states and 37 transitions.
[2020-10-16 13:31:02,149 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:02,188 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:31:02,188 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:31:02,188 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:02,189 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:31:02,189 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:02,189 INFO  L87              Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 3 states.
[2020-10-16 13:31:02,199 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:02,200 INFO  L93              Difference]: Finished difference Result 62 states and 96 transitions.
[2020-10-16 13:31:02,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:31:02,200 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2020-10-16 13:31:02,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:02,201 INFO  L225             Difference]: With dead ends: 62
[2020-10-16 13:31:02,201 INFO  L226             Difference]: Without dead ends: 35
[2020-10-16 13:31:02,201 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:31:02,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2020-10-16 13:31:02,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2020-10-16 13:31:02,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2020-10-16 13:31:02,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions.
[2020-10-16 13:31:02,204 INFO  L78                 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 16
[2020-10-16 13:31:02,204 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:02,205 INFO  L481      AbstractCegarLoop]: Abstraction has 35 states and 52 transitions.
[2020-10-16 13:31:02,205 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:31:02,205 INFO  L276                IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions.
[2020-10-16 13:31:02,205 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:31:02,206 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:02,206 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:02,206 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:31:02,206 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:02,206 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:02,206 INFO  L82        PathProgramCache]: Analyzing trace with hash -374696167, now seen corresponding path program 2 times
[2020-10-16 13:31:02,208 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:02,208 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875897726]
[2020-10-16 13:31:02,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:02,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:31:02,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:31:02,364 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875897726]
[2020-10-16 13:31:02,364 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:31:02,365 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:31:02,365 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1855053569]
[2020-10-16 13:31:02,365 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:31:02,370 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:31:02,383 INFO  L258    McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions.
[2020-10-16 13:31:02,384 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:31:02,416 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:02,417 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,419 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:02,420 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,422 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,423 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,424 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,429 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,439 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,454 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,456 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,458 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,475 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,494 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,501 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,508 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,513 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,517 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,521 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,534 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,535 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,550 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,565 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,580 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,595 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term
[2020-10-16 13:31:02,596 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,697 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:31:02,697 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,698 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,699 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,699 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,700 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,701 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:31:02,701 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,702 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,702 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,703 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,703 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,711 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,711 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,713 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,713 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,714 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:31:02,715 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,716 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,724 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,736 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,760 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,820 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:31:02,820 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:02,821 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 2, 2, 1] term
[2020-10-16 13:31:02,821 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:02,822 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 1] term
[2020-10-16 13:31:02,822 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,826 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:02,827 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,828 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:02,828 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,830 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,830 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,831 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:31:02,837 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,838 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,840 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,841 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,848 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,856 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,858 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,859 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,864 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,865 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,876 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,877 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:31:02,878 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,878 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,887 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,888 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,889 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,890 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,897 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:02,901 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:02,905 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,907 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,908 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,912 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,913 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:02,925 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:31:02,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,057 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 15
[2020-10-16 13:31:03,108 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:31:03,109 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,109 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,110 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,110 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 1] term
[2020-10-16 13:31:03,110 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,114 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,114 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,115 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,115 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,117 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,117 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,123 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,124 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,129 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,130 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,131 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,137 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,148 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,149 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,154 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,158 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,162 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,168 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,171 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,173 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,173 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,180 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,185 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,189 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,190 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,193 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,196 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,198 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:31:03,198 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,221 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:31:03,222 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,222 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,223 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 1] term
[2020-10-16 13:31:03,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,226 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,226 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,227 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,227 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,228 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,232 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,239 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,243 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,244 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,244 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,245 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,251 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,256 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,259 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,261 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,262 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,267 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,275 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,277 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,280 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,282 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,287 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,288 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,294 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,296 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:31:03,296 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,316 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:31:03,317 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,317 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,317 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,318 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 1] term
[2020-10-16 13:31:03,318 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,320 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,320 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,321 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:31:03,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,323 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,323 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,324 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,331 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,332 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,334 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,343 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,344 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:31:03,345 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,345 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,354 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,357 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,360 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,363 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,373 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,374 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,375 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,382 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:31:03,386 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,389 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:31:03,393 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:31:03,393 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:31:03,406 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2203#(and (not (= 0 ~x$w_buff0~0)) (not (= (mod ~x$r_buff0_thd1~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))), 2204#(or (= 0 ~x$r_buff0_thd2~0) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:31:03,406 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-10-16 13:31:03,406 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:31:03,407 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-10-16 13:31:03,407 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:31:03,407 INFO  L87              Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 8 states.
[2020-10-16 13:31:03,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:31:03,586 INFO  L93              Difference]: Finished difference Result 48 states and 67 transitions.
[2020-10-16 13:31:03,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:31:03,587 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2020-10-16 13:31:03,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:31:03,588 INFO  L225             Difference]: With dead ends: 48
[2020-10-16 13:31:03,588 INFO  L226             Difference]: Without dead ends: 30
[2020-10-16 13:31:03,588 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2020-10-16 13:31:03,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2020-10-16 13:31:03,590 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25.
[2020-10-16 13:31:03,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2020-10-16 13:31:03,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions.
[2020-10-16 13:31:03,613 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16
[2020-10-16 13:31:03,614 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:31:03,614 INFO  L481      AbstractCegarLoop]: Abstraction has 25 states and 32 transitions.
[2020-10-16 13:31:03,614 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-10-16 13:31:03,614 INFO  L276                IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions.
[2020-10-16 13:31:03,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:31:03,614 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:31:03,615 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:31:03,615 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:31:03,615 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:31:03,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:31:03,616 INFO  L82        PathProgramCache]: Analyzing trace with hash 694115721, now seen corresponding path program 3 times
[2020-10-16 13:31:03,619 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:31:03,619 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326568885]
[2020-10-16 13:31:03,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:31:03,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:31:03,665 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:31:03,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:31:03,706 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:31:03,741 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:31:03,741 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:31:03,742 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:31:03,747 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:31:03,762 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L806-->L813: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In1346425127 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1346425127 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In1346425127 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In1346425127 256) 0))) (let ((.cse3 (or .cse6 .cse7)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and (= ~x$w_buff1_used~0_In1346425127 ~x$w_buff1_used~0_Out1346425127) .cse0) (and .cse1 .cse2 (= ~x$w_buff1_used~0_Out1346425127 0))) (= ~x$r_buff1_thd0~0_Out1346425127 ~x$r_buff1_thd0~0_In1346425127) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1346425127 0)) (or (and .cse3 (= ~x$w_buff0_used~0_In1346425127 ~x$w_buff0_used~0_Out1346425127)) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out1346425127 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1346425127 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1346425127|) (or (and .cse3 (or (and .cse1 .cse2 (= ~x~0_Out1346425127 ~x$w_buff1~0_In1346425127)) (and .cse0 (= ~x~0_In1346425127 ~x~0_Out1346425127)))) (and .cse4 .cse5 (= ~x~0_Out1346425127 ~x$w_buff0~0_In1346425127))) (= ~x$r_buff0_thd0~0_Out1346425127 ~x$r_buff0_thd0~0_In1346425127))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In1346425127, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1346425127, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1346425127|, ~x$w_buff1~0=~x$w_buff1~0_In1346425127, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1346425127, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1346425127, ~x~0=~x~0_In1346425127, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1346425127}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In1346425127, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1346425127, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1346425127|, ~x$w_buff1~0=~x$w_buff1~0_In1346425127, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1346425127, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1346425127, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1346425127|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1346425127|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1346425127|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1346425127, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1346425127|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1346425127|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1346425127|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1346425127, ~x~0=~x~0_Out1346425127}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite39, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite44, ~x$w_buff0_used~0] because there is no mapped edge
[2020-10-16 13:31:03,767 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,767 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,769 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,769 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,769 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,769 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,770 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,770 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,770 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,770 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,770 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,771 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,771 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,771 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,771 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,771 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,771 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,772 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,772 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,772 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,772 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,773 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,773 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,773 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,774 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,774 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,774 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,774 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,774 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,774 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,775 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,775 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,775 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,775 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,775 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,776 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,776 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:31:03,776 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:31:03,819 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:31:03 BasicIcfg
[2020-10-16 13:31:03,819 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:31:03,821 INFO  L168              Benchmark]: Toolchain (without parser) took 8168.02 ms. Allocated memory was 141.6 MB in the beginning and 312.0 MB in the end (delta: 170.4 MB). Free memory was 102.7 MB in the beginning and 247.3 MB in the end (delta: -144.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,822 INFO  L168              Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,823 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 816.69 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 161.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,824 INFO  L168              Benchmark]: Boogie Procedure Inliner took 60.17 ms. Allocated memory is still 206.6 MB. Free memory was 161.9 MB in the beginning and 159.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,825 INFO  L168              Benchmark]: Boogie Preprocessor took 53.15 ms. Allocated memory is still 206.6 MB. Free memory was 159.3 MB in the beginning and 156.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,826 INFO  L168              Benchmark]: RCFGBuilder took 1946.18 ms. Allocated memory was 206.6 MB in the beginning and 245.9 MB in the end (delta: 39.3 MB). Free memory was 156.8 MB in the beginning and 189.5 MB in the end (delta: -32.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,827 INFO  L168              Benchmark]: TraceAbstraction took 5286.27 ms. Allocated memory was 245.9 MB in the beginning and 312.0 MB in the end (delta: 66.1 MB). Free memory was 189.5 MB in the beginning and 247.3 MB in the end (delta: -57.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB.
[2020-10-16 13:31:03,831 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.20 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 816.69 ms. Allocated memory was 141.6 MB in the beginning and 206.6 MB in the end (delta: 65.0 MB). Free memory was 102.5 MB in the beginning and 161.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 60.17 ms. Allocated memory is still 206.6 MB. Free memory was 161.9 MB in the beginning and 159.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 53.15 ms. Allocated memory is still 206.6 MB. Free memory was 159.3 MB in the beginning and 156.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1946.18 ms. Allocated memory was 206.6 MB in the beginning and 245.9 MB in the end (delta: 39.3 MB). Free memory was 156.8 MB in the beginning and 189.5 MB in the end (delta: -32.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 5286.27 ms. Allocated memory was 245.9 MB in the beginning and 312.0 MB in the end (delta: 66.1 MB). Free memory was 189.5 MB in the beginning and 247.3 MB in the end (delta: -57.7 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    486 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 41 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.2s, 82 PlacesBefore, 27 PlacesAfterwards, 77 TransitionsBefore, 20 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2466 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;
[L799]               0  pthread_t t1707;
[L800]  FCALL, FORK  0  pthread_create(&t1707, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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]
[L727]               1  x$w_buff1 = x$w_buff0
[L728]               1  x$w_buff0 = 1
[L729]               1  x$w_buff1_used = x$w_buff0_used
[L730]               1  x$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L732]               1  x$r_buff1_thd0 = x$r_buff0_thd0
[L733]               1  x$r_buff1_thd1 = x$r_buff0_thd1
[L734]               1  x$r_buff1_thd2 = x$r_buff0_thd2
[L735]               1  x$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L801]               0  pthread_t t1708;
[L802]  FCALL, FORK  0  pthread_create(&t1708, ((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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L738]               1  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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L755]               2  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L758]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L761]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L762]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L763]               2  x$flush_delayed = weak$$choice2
[L764]               2  x$mem_tmp = x
[L765]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L765]               2  x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L766]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L766]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)
[L766]  EXPR         2  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L766]               2  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L767]  EXPR         2  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L767]               2  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L768]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L768]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)
[L768]  EXPR         2  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L768]               2  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L769]  EXPR         2  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L769]               2  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L770]  EXPR         2  weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L770]               2  x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L771]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L771]  EXPR         2  !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)
[L771]  EXPR         2  weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L771]               2  x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L772]               2  __unbuffered_p1_EBX = x
[L773]  EXPR         2  x$flush_delayed ? x$mem_tmp : x
[L773]               2  x = x$flush_delayed ? x$mem_tmp : x
[L774]               2  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L741]  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)
[L741]               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)
[L742]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L742]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L743]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L743]               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
[L744]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L744]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L745]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L745]               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
[L777]  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)
[L777]               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)
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L779]               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
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L781]               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
[L748]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L750]               1  return 0;
[L784]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L786]               2  return 0;
[L804]               0  main$tmp_guard0 = __unbuffered_cnt == 2
[L815]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, 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, 76 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 129 SDtfs, 89 SDslu, 161 SDs, 0 SdLazy, 88 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 3665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...