/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/safe031_power.oepc.i


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:47:11,539 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:47:11,542 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:47:11,584 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:47:11,585 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:47:11,593 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:47:11,596 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:47:11,600 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:47:11,602 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:47:11,605 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:47:11,605 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:47:11,606 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:47:11,607 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:47:11,609 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:47:11,611 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:47:11,613 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:47:11,614 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:47:11,616 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:47:11,617 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:47:11,625 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:47:11,627 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:47:11,628 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:47:11,629 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:47:11,629 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:47:11,637 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:47:11,637 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:47:11,638 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:47:11,641 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:47:11,641 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:47:11,642 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:47:11,642 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:47:11,643 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:47:11,646 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:47:11,647 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:47:11,647 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:47:11,648 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:47:11,648 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:47:11,648 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:47:11,648 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:47:11,649 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:47:11,650 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:47:11,651 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:47:11,672 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:47:11,672 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:47:11,673 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:47:11,673 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:47:11,674 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:47:11,674 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:47:11,674 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:47:11,674 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:47:11,674 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:47:11,675 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:47:11,676 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:47:11,676 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:47:11,676 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:47:11,676 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:47:11,676 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:47:11,677 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:47:11,677 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:47:11,677 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:47:11,677 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:47:11,677 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:47:11,678 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:47:12,000 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:47:12,017 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:47:12,021 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:47:12,023 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:47:12,025 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:47:12,027 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i
[2020-10-16 13:47:12,102 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b08b0d263/28f368392f82496fadfe6e45a7a2d07b/FLAGefed1a8e1
[2020-10-16 13:47:12,613 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:47:12,617 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc.i
[2020-10-16 13:47:12,637 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b08b0d263/28f368392f82496fadfe6e45a7a2d07b/FLAGefed1a8e1
[2020-10-16 13:47:12,949 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b08b0d263/28f368392f82496fadfe6e45a7a2d07b
[2020-10-16 13:47:12,958 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:47:12,960 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:47:12,961 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:47:12,962 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:47:12,966 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:47:12,967 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:47:12" (1/1) ...
[2020-10-16 13:47:12,971 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26187474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:12, skipping insertion in model container
[2020-10-16 13:47:12,971 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:47:12" (1/1) ...
[2020-10-16 13:47:12,980 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:47:13,033 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:47:13,513 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:47:13,525 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:47:13,613 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:47:13,687 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:47:13,687 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13 WrapperNode
[2020-10-16 13:47:13,687 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:47:13,688 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:47:13,689 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:47:13,689 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:47:13,698 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:47:13" (1/1) ...
[2020-10-16 13:47:13,718 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:47:13" (1/1) ...
[2020-10-16 13:47:13,766 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:47:13,766 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:47:13,766 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:47:13,767 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:47:13,776 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,777 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,785 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,786 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,796 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,800 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,803 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
[2020-10-16 13:47:13,808 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:47:13,809 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:47:13,809 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:47:13,809 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:47:13,810 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:47:13,890 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:47:13,890 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:47:13,890 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:47:13,890 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:47:13,890 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:47:13,891 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:47:13,891 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:47:13,891 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:47:13,891 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:47:13,891 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:47:13,891 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:47:13,892 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:47:13,892 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:47:13,893 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:47:15,752 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:47:15,752 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:47:15,754 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:47:15 BoogieIcfgContainer
[2020-10-16 13:47:15,755 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:47:15,756 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:47:15,756 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:47:15,760 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:47:15,760 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:47:12" (1/3) ...
[2020-10-16 13:47:15,761 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d8d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:47:15, skipping insertion in model container
[2020-10-16 13:47:15,761 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:47:13" (2/3) ...
[2020-10-16 13:47:15,762 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350d8d4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:47:15, skipping insertion in model container
[2020-10-16 13:47:15,762 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:47:15" (3/3) ...
[2020-10-16 13:47:15,763 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe031_power.oepc.i
[2020-10-16 13:47:15,775 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:47:15,776 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:47:15,783 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:47:15,784 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:47:15,825 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,826 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,826 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,832 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,832 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,832 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,832 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,837 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,838 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,838 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,839 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,839 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,839 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,839 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,839 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,840 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,840 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,840 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,840 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,840 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,841 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,841 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,841 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,841 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,842 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,842 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,842 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,843 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,843 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,843 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,843 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,843 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,844 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,844 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,844 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,844 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,844 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,845 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,845 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,853 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,854 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,854 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,854 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,862 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,862 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,862 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,863 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,863 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,863 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,863 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,863 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,864 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,864 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,864 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,865 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,865 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,865 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,865 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,865 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,866 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,874 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,875 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,875 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,875 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:47:15,877 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:47:15,892 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 13:47:15,914 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:47:15,914 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:47:15,914 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:47:15,914 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:47:15,914 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:47:15,914 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:47:15,915 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:47:15,915 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:47:15,933 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:47:15,934 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow
[2020-10-16 13:47:15,936 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow
[2020-10-16 13:47:15,938 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow
[2020-10-16 13:47:15,999 INFO  L129       PetriNetUnfolder]: 2/88 cut-off events.
[2020-10-16 13:47:15,999 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:47:16,007 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 13:47:16,014 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 13:47:16,438 WARN  L193               SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:47:18,269 WARN  L193               SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85
[2020-10-16 13:47:18,373 WARN  L193               SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83
[2020-10-16 13:47:18,380 INFO  L132        LiptonReduction]: Checked pairs total: 3682
[2020-10-16 13:47:18,380 INFO  L134        LiptonReduction]: Total number of compositions: 73
[2020-10-16 13:47:18,389 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow
[2020-10-16 13:47:18,457 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2020-10-16 13:47:18,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 658 states.
[2020-10-16 13:47:18,476 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:47:18,477 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:18,477 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:47:18,478 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:18,482 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:18,483 INFO  L82        PathProgramCache]: Analyzing trace with hash 907184313, now seen corresponding path program 1 times
[2020-10-16 13:47:18,502 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:18,503 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665639568]
[2020-10-16 13:47:18,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:18,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:18,766 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:47:18,767 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665639568]
[2020-10-16 13:47:18,768 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:18,768 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:47:18,769 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [480247468]
[2020-10-16 13:47:18,770 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:18,773 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:18,787 INFO  L258    McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:47:18,787 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:18,791 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:18,792 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:47:18,792 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:18,807 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:47:18,808 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:47:18,810 INFO  L87              Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2020-10-16 13:47:18,880 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:18,880 INFO  L93              Difference]: Finished difference Result 550 states and 1693 transitions.
[2020-10-16 13:47:18,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:47:18,883 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:47:18,883 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:18,902 INFO  L225             Difference]: With dead ends: 550
[2020-10-16 13:47:18,902 INFO  L226             Difference]: Without dead ends: 450
[2020-10-16 13:47:18,903 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:47:18,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-16 13:47:18,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-16 13:47:18,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-16 13:47:18,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2020-10-16 13:47:18,986 INFO  L78                 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2020-10-16 13:47:18,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:18,987 INFO  L481      AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2020-10-16 13:47:18,990 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:47:18,990 INFO  L276                IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2020-10-16 13:47:18,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:47:18,992 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:18,992 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:18,992 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:47:18,992 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:18,993 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:18,993 INFO  L82        PathProgramCache]: Analyzing trace with hash 1723467439, now seen corresponding path program 1 times
[2020-10-16 13:47:19,003 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:19,003 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954683810]
[2020-10-16 13:47:19,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:19,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:19,097 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:47:19,097 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954683810]
[2020-10-16 13:47:19,097 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:19,098 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:47:19,098 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756568615]
[2020-10-16 13:47:19,098 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:19,099 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:19,101 INFO  L258    McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 13:47:19,101 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:19,102 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:19,103 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:47:19,103 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:19,103 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:47:19,104 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:47:19,104 INFO  L87              Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2020-10-16 13:47:19,116 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:19,116 INFO  L93              Difference]: Finished difference Result 442 states and 1328 transitions.
[2020-10-16 13:47:19,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:47:19,117 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 13:47:19,117 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:19,122 INFO  L225             Difference]: With dead ends: 442
[2020-10-16 13:47:19,122 INFO  L226             Difference]: Without dead ends: 442
[2020-10-16 13:47:19,123 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:47:19,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2020-10-16 13:47:19,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442.
[2020-10-16 13:47:19,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 442 states.
[2020-10-16 13:47:19,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1328 transitions.
[2020-10-16 13:47:19,150 INFO  L78                 Accepts]: Start accepts. Automaton has 442 states and 1328 transitions. Word has length 9
[2020-10-16 13:47:19,151 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:19,151 INFO  L481      AbstractCegarLoop]: Abstraction has 442 states and 1328 transitions.
[2020-10-16 13:47:19,151 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:47:19,152 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states and 1328 transitions.
[2020-10-16 13:47:19,153 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 13:47:19,153 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:19,154 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:19,154 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:47:19,154 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:19,154 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:19,154 INFO  L82        PathProgramCache]: Analyzing trace with hash 1887066754, now seen corresponding path program 1 times
[2020-10-16 13:47:19,157 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:19,157 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647950189]
[2020-10-16 13:47:19,157 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:19,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:19,245 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:47:19,246 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647950189]
[2020-10-16 13:47:19,246 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:19,246 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:47:19,247 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253819832]
[2020-10-16 13:47:19,247 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:19,249 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:19,251 INFO  L258    McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions.
[2020-10-16 13:47:19,251 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:19,298 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:19,298 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:47:19,299 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:19,299 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:47:19,299 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:47:19,299 INFO  L87              Difference]: Start difference. First operand 442 states and 1328 transitions. Second operand 3 states.
[2020-10-16 13:47:19,315 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:19,315 INFO  L93              Difference]: Finished difference Result 434 states and 1298 transitions.
[2020-10-16 13:47:19,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:47:19,316 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-10-16 13:47:19,316 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:19,320 INFO  L225             Difference]: With dead ends: 434
[2020-10-16 13:47:19,320 INFO  L226             Difference]: Without dead ends: 434
[2020-10-16 13:47:19,320 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:47:19,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 434 states.
[2020-10-16 13:47:19,337 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434.
[2020-10-16 13:47:19,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 434 states.
[2020-10-16 13:47:19,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions.
[2020-10-16 13:47:19,340 INFO  L78                 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10
[2020-10-16 13:47:19,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:19,341 INFO  L481      AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions.
[2020-10-16 13:47:19,341 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:47:19,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions.
[2020-10-16 13:47:19,343 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 13:47:19,343 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:19,343 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:19,344 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:47:19,344 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:19,344 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:19,344 INFO  L82        PathProgramCache]: Analyzing trace with hash -1808289269, now seen corresponding path program 1 times
[2020-10-16 13:47:19,346 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:19,346 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61858599]
[2020-10-16 13:47:19,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:19,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:19,417 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:47:19,417 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61858599]
[2020-10-16 13:47:19,417 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:19,418 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:47:19,418 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88469680]
[2020-10-16 13:47:19,418 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:19,419 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:19,422 INFO  L258    McrAutomatonBuilder]: Finished intersection with 23 states and 35 transitions.
[2020-10-16 13:47:19,422 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:19,458 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:19,518 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:19,547 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:19,548 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:47:19,548 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:19,548 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:47:19,548 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:47:19,549 INFO  L87              Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states.
[2020-10-16 13:47:19,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:19,598 INFO  L93              Difference]: Finished difference Result 402 states and 1053 transitions.
[2020-10-16 13:47:19,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:47:19,599 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 13:47:19,599 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:19,601 INFO  L225             Difference]: With dead ends: 402
[2020-10-16 13:47:19,601 INFO  L226             Difference]: Without dead ends: 302
[2020-10-16 13:47:19,602 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 5 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:47:19,603 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2020-10-16 13:47:19,610 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302.
[2020-10-16 13:47:19,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 13:47:19,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 770 transitions.
[2020-10-16 13:47:19,612 INFO  L78                 Accepts]: Start accepts. Automaton has 302 states and 770 transitions. Word has length 11
[2020-10-16 13:47:19,612 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:19,612 INFO  L481      AbstractCegarLoop]: Abstraction has 302 states and 770 transitions.
[2020-10-16 13:47:19,613 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:47:19,613 INFO  L276                IsEmpty]: Start isEmpty. Operand 302 states and 770 transitions.
[2020-10-16 13:47:19,615 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:47:19,615 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:19,615 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:19,615 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:47:19,615 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:19,616 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:19,616 INFO  L82        PathProgramCache]: Analyzing trace with hash 1652630318, now seen corresponding path program 1 times
[2020-10-16 13:47:19,617 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:19,617 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288634297]
[2020-10-16 13:47:19,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:19,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:19,726 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:47:19,727 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288634297]
[2020-10-16 13:47:19,727 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:19,727 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-16 13:47:19,728 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2020165356]
[2020-10-16 13:47:19,728 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:19,730 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:19,736 INFO  L258    McrAutomatonBuilder]: Finished intersection with 31 states and 47 transitions.
[2020-10-16 13:47:19,736 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:19,837 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:19,837 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:47:19,837 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:19,838 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:47:19,838 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:47:19,838 INFO  L87              Difference]: Start difference. First operand 302 states and 770 transitions. Second operand 5 states.
[2020-10-16 13:47:19,885 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:19,885 INFO  L93              Difference]: Finished difference Result 238 states and 553 transitions.
[2020-10-16 13:47:19,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-16 13:47:19,886 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 13
[2020-10-16 13:47:19,886 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:19,887 INFO  L225             Difference]: With dead ends: 238
[2020-10-16 13:47:19,888 INFO  L226             Difference]: Without dead ends: 186
[2020-10-16 13:47:19,888 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:47:19,889 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2020-10-16 13:47:19,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186.
[2020-10-16 13:47:19,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2020-10-16 13:47:19,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 422 transitions.
[2020-10-16 13:47:19,894 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 422 transitions. Word has length 13
[2020-10-16 13:47:19,894 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:19,895 INFO  L481      AbstractCegarLoop]: Abstraction has 186 states and 422 transitions.
[2020-10-16 13:47:19,895 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:47:19,895 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 422 transitions.
[2020-10-16 13:47:19,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:47:19,896 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:19,897 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:47:19,897 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:47:19,897 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:19,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:19,897 INFO  L82        PathProgramCache]: Analyzing trace with hash -1739272992, now seen corresponding path program 1 times
[2020-10-16 13:47:19,899 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:19,899 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093031192]
[2020-10-16 13:47:19,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:19,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:19,978 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:47:19,978 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093031192]
[2020-10-16 13:47:19,979 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:19,979 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:47:19,979 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862584217]
[2020-10-16 13:47:19,979 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:19,983 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:19,997 INFO  L258    McrAutomatonBuilder]: Finished intersection with 48 states and 88 transitions.
[2020-10-16 13:47:19,998 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:20,212 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:20,213 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:47:20,213 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:20,213 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:47:20,213 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:47:20,213 INFO  L87              Difference]: Start difference. First operand 186 states and 422 transitions. Second operand 3 states.
[2020-10-16 13:47:20,222 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:20,223 INFO  L93              Difference]: Finished difference Result 254 states and 560 transitions.
[2020-10-16 13:47:20,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:47:20,223 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2020-10-16 13:47:20,223 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:20,225 INFO  L225             Difference]: With dead ends: 254
[2020-10-16 13:47:20,225 INFO  L226             Difference]: Without dead ends: 188
[2020-10-16 13:47:20,225 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:47:20,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2020-10-16 13:47:20,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185.
[2020-10-16 13:47:20,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 185 states.
[2020-10-16 13:47:20,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 402 transitions.
[2020-10-16 13:47:20,231 INFO  L78                 Accepts]: Start accepts. Automaton has 185 states and 402 transitions. Word has length 16
[2020-10-16 13:47:20,231 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:20,231 INFO  L481      AbstractCegarLoop]: Abstraction has 185 states and 402 transitions.
[2020-10-16 13:47:20,232 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:47:20,232 INFO  L276                IsEmpty]: Start isEmpty. Operand 185 states and 402 transitions.
[2020-10-16 13:47:20,233 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:47:20,233 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:20,233 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:47:20,233 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:47:20,234 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:20,234 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:20,234 INFO  L82        PathProgramCache]: Analyzing trace with hash -1306825536, now seen corresponding path program 1 times
[2020-10-16 13:47:20,235 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:20,236 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709838028]
[2020-10-16 13:47:20,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:20,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:20,283 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:47:20,284 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709838028]
[2020-10-16 13:47:20,284 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:20,284 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:47:20,284 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108151629]
[2020-10-16 13:47:20,285 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:20,288 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:20,297 INFO  L258    McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions.
[2020-10-16 13:47:20,298 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:20,333 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:20,333 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:47:20,333 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:20,334 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:47:20,334 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:47:20,334 INFO  L87              Difference]: Start difference. First operand 185 states and 402 transitions. Second operand 3 states.
[2020-10-16 13:47:20,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:20,345 INFO  L93              Difference]: Finished difference Result 250 states and 521 transitions.
[2020-10-16 13:47:20,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:47:20,346 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2020-10-16 13:47:20,346 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:20,348 INFO  L225             Difference]: With dead ends: 250
[2020-10-16 13:47:20,348 INFO  L226             Difference]: Without dead ends: 181
[2020-10-16 13:47:20,349 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:47:20,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2020-10-16 13:47:20,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178.
[2020-10-16 13:47:20,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 178 states.
[2020-10-16 13:47:20,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 368 transitions.
[2020-10-16 13:47:20,355 INFO  L78                 Accepts]: Start accepts. Automaton has 178 states and 368 transitions. Word has length 16
[2020-10-16 13:47:20,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:20,355 INFO  L481      AbstractCegarLoop]: Abstraction has 178 states and 368 transitions.
[2020-10-16 13:47:20,355 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:47:20,356 INFO  L276                IsEmpty]: Start isEmpty. Operand 178 states and 368 transitions.
[2020-10-16 13:47:20,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2020-10-16 13:47:20,357 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:20,357 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:47:20,357 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:47:20,357 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:20,357 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:20,358 INFO  L82        PathProgramCache]: Analyzing trace with hash 1556762490, now seen corresponding path program 2 times
[2020-10-16 13:47:20,359 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:20,359 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795229623]
[2020-10-16 13:47:20,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:20,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:20,509 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:47:20,509 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795229623]
[2020-10-16 13:47:20,510 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:20,510 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:47:20,510 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297913086]
[2020-10-16 13:47:20,510 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:20,517 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:20,526 INFO  L258    McrAutomatonBuilder]: Finished intersection with 26 states and 33 transitions.
[2020-10-16 13:47:20,527 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:20,553 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:47:20,553 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-16 13:47:20,553 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:20,554 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-16 13:47:20,554 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-16 13:47:20,554 INFO  L87              Difference]: Start difference. First operand 178 states and 368 transitions. Second operand 6 states.
[2020-10-16 13:47:20,626 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:20,626 INFO  L93              Difference]: Finished difference Result 159 states and 330 transitions.
[2020-10-16 13:47:20,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:47:20,627 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2020-10-16 13:47:20,627 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:20,628 INFO  L225             Difference]: With dead ends: 159
[2020-10-16 13:47:20,628 INFO  L226             Difference]: Without dead ends: 61
[2020-10-16 13:47:20,629 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:47:20,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2020-10-16 13:47:20,631 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2020-10-16 13:47:20,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2020-10-16 13:47:20,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2020-10-16 13:47:20,634 INFO  L78                 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 16
[2020-10-16 13:47:20,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:20,635 INFO  L481      AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2020-10-16 13:47:20,635 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-16 13:47:20,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2020-10-16 13:47:20,636 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:47:20,636 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:20,638 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:20,638 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:47:20,638 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:20,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:20,639 INFO  L82        PathProgramCache]: Analyzing trace with hash 812890557, now seen corresponding path program 1 times
[2020-10-16 13:47:20,640 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:20,641 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755733448]
[2020-10-16 13:47:20,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:20,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:47:20,880 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:47:20,881 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755733448]
[2020-10-16 13:47:20,881 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:47:20,882 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:47:20,882 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1320847022]
[2020-10-16 13:47:20,882 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:47:20,888 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:47:20,919 INFO  L258    McrAutomatonBuilder]: Finished intersection with 69 states and 124 transitions.
[2020-10-16 13:47:20,919 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:47:21,005 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:47:21,006 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,007 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:47:21,007 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,008 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:47:21,008 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,009 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:47:21,010 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,011 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:47:21,011 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,012 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:47:21,012 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,014 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,014 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,017 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:47:21,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,019 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:47:21,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,020 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:47:21,021 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,022 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,025 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,031 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,051 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,086 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,110 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,115 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,138 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,139 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,140 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,143 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:47:21,143 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,144 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:47:21,144 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,146 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,146 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,199 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,199 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,203 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,204 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,205 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,216 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,222 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,226 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,227 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,231 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,236 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,240 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,245 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,246 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,253 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,257 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,266 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,270 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,274 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,277 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,279 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,280 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,281 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,290 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,297 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,304 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,305 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,309 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,314 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,319 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,319 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,326 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,330 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:21,330 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,333 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,334 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,339 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,340 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,342 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,343 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,346 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,353 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,357 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,360 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,367 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,370 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,371 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,374 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,377 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,379 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,385 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,389 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts
[2020-10-16 13:47:21,391 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,403 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,404 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,411 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,443 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,444 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,447 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:21,447 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,449 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:47:21,449 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,450 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,450 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,455 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,456 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,457 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,462 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,464 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,469 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,469 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,470 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,471 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,476 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,480 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,480 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,486 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,487 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,492 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,492 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,496 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,496 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,503 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,505 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,508 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,511 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,512 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,512 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,518 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,520 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,523 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,529 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,532 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,534 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,537 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,539 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,542 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,547 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,547 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,550 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,553 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,557 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,561 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:21,561 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,563 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,564 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,569 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,571 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,574 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,575 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,576 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,577 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,580 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,581 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,589 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,596 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,597 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,603 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,608 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,609 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,610 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,613 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,614 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,622 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,628 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,629 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,635 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,640 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,641 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,642 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,643 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,650 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,655 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,656 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,659 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,661 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,668 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,673 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,678 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,679 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,680 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,683 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,686 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,689 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,691 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,692 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,694 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,695 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,700 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,704 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,713 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,714 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,717 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,720 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,727 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,730 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,733 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,734 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,740 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,740 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,743 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,748 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,754 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:21,779 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,781 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,782 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,784 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:21,784 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,786 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:47:21,786 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,787 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,790 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,792 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,793 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,801 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,803 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,805 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,813 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:21,814 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,814 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,816 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,817 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,819 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,826 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,827 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,837 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,838 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:21,845 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,846 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,848 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,854 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,854 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:21,864 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:21,865 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,120 WARN  L193               SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 25
[2020-10-16 13:47:22,128 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,129 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,130 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,132 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:22,133 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,134 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 3, 2, 1] term
[2020-10-16 13:47:22,134 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,135 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,136 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,136 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,142 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,142 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,143 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,144 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,149 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,155 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,158 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,199 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,200 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,201 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,202 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,207 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,213 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,217 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,222 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,224 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,226 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,227 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,232 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,239 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:22,240 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,271 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,278 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:22,279 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,280 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:47:22,280 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,281 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,281 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,283 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,294 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,298 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,299 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,303 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,304 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,306 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,307 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,308 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,308 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,313 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,314 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,321 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,325 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,326 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,330 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,331 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,332 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,336 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,338 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,343 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,348 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:22,349 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,382 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,384 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,384 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,386 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:22,386 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,387 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:47:22,387 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,388 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,388 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,393 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,394 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,397 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,398 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,399 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,400 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,405 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,412 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,413 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,415 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,415 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,417 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,421 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,425 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,430 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,430 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,432 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,435 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,438 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,438 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,441 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,446 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:22,446 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,483 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,485 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,485 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,487 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:47:22,487 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,488 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 3, 2, 1] term
[2020-10-16 13:47:22,489 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,489 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,490 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,490 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,495 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,496 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,497 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,498 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,504 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:47:22,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,505 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,511 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,515 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:47:22,516 INFO  L603       QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,517 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,517 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,522 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,523 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,530 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,531 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,536 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,536 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,545 INFO  L603       QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,545 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,547 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,550 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,553 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,554 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,555 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:47:22,565 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term
[2020-10-16 13:47:22,565 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:47:22,598 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8666#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (and (<= ~x$w_buff0_used~0 0) (= ~x~0 1) (<= 0 ~x$w_buff0_used~0))) (= ~x$w_buff1_used~0 0)), 8667#(or (= ~x$w_buff0_used~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:47:22,598 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 13:47:22,599 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:47:22,599 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 13:47:22,599 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-10-16 13:47:22,599 INFO  L87              Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 9 states.
[2020-10-16 13:47:22,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:47:22,723 INFO  L93              Difference]: Finished difference Result 75 states and 134 transitions.
[2020-10-16 13:47:22,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:47:22,724 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-10-16 13:47:22,724 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:47:22,725 INFO  L225             Difference]: With dead ends: 75
[2020-10-16 13:47:22,725 INFO  L226             Difference]: Without dead ends: 41
[2020-10-16 13:47:22,725 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90
[2020-10-16 13:47:22,726 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-10-16 13:47:22,727 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-10-16 13:47:22,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 13:47:22,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 13:47:22,727 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2020-10-16 13:47:22,727 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:47:22,728 INFO  L481      AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 13:47:22,728 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 13:47:22,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 13:47:22,728 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:47:22,728 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:47:22,728 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:47:22,729 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:47:22,729 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:47:22,729 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:47:22,729 INFO  L82        PathProgramCache]: Analyzing trace with hash 1479075013, now seen corresponding path program 2 times
[2020-10-16 13:47:22,730 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:47:22,731 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678352376]
[2020-10-16 13:47:22,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:47:22,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:47:22,773 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:47:22,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:47:22,816 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:47:22,853 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:47:22,853 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:47:22,854 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:47:22,855 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:47:22,874 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [907] [907] L3-->L834: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1716444878 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In1716444878 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In1716444878 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In1716444878 256) 0))) (let ((.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (or .cse8 .cse9)) (.cse0 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out1716444878 ~x$r_buff1_thd0~0_In1716444878) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1716444878 0)) (= ~x$r_buff0_thd0~0_Out1716444878 ~x$r_buff0_thd0~0_In1716444878) (or (and .cse0 (or (and (= ~x~0_In1716444878 ~x~0_Out1716444878) .cse1) (and .cse2 (= ~x~0_Out1716444878 ~x$w_buff1~0_In1716444878) .cse3))) (and (= ~x$w_buff0~0_In1716444878 ~x~0_Out1716444878) .cse4 .cse5)) (or (and (= ~x$w_buff1_used~0_Out1716444878 0) .cse2 .cse3) (and (= ~x$w_buff1_used~0_In1716444878 ~x$w_buff1_used~0_Out1716444878) .cse1)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1716444878 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1716444878|) (or (and (= ~x$w_buff0_used~0_In1716444878 ~x$w_buff0_used~0_Out1716444878) .cse0) (and (= ~x$w_buff0_used~0_Out1716444878 0) .cse4 .cse5)))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In1716444878, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1716444878, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1716444878|, ~x$w_buff1~0=~x$w_buff1~0_In1716444878, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1716444878, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1716444878, ~x~0=~x~0_In1716444878, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1716444878}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In1716444878, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1716444878, ~x$w_buff1~0=~x$w_buff1~0_In1716444878, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1716444878, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1716444878, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1716444878|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1716444878|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1716444878|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1716444878, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1716444878|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1716444878|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1716444878|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1716444878|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1716444878, ~x~0=~x~0_Out1716444878}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~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~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge
[2020-10-16 13:47:22,880 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,881 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,882 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,882 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,882 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,883 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,883 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,883 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,884 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,884 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,884 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,885 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,885 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,885 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,885 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,885 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,886 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,886 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,886 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,886 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,887 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,887 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,887 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,887 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,888 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,888 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,889 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,889 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,889 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,890 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,890 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,890 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:47:22,890 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:47:22,969 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:47:22 BasicIcfg
[2020-10-16 13:47:22,969 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:47:22,972 INFO  L168              Benchmark]: Toolchain (without parser) took 10012.38 ms. Allocated memory was 147.8 MB in the beginning and 383.3 MB in the end (delta: 235.4 MB). Free memory was 100.9 MB in the beginning and 189.5 MB in the end (delta: -88.7 MB). Peak memory consumption was 146.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,973 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,974 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 726.64 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 100.6 MB in the beginning and 158.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,976 INFO  L168              Benchmark]: Boogie Procedure Inliner took 77.78 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,977 INFO  L168              Benchmark]: Boogie Preprocessor took 42.20 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,977 INFO  L168              Benchmark]: RCFGBuilder took 1945.93 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 152.9 MB in the beginning and 195.8 MB in the end (delta: -42.8 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,980 INFO  L168              Benchmark]: TraceAbstraction took 7213.65 ms. Allocated memory was 249.0 MB in the beginning and 383.3 MB in the end (delta: 134.2 MB). Free memory was 194.0 MB in the beginning and 189.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 138.7 MB. Max. memory is 7.1 GB.
[2020-10-16 13:47:22,991 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 726.64 ms. Allocated memory was 147.8 MB in the beginning and 203.4 MB in the end (delta: 55.6 MB). Free memory was 100.6 MB in the beginning and 158.1 MB in the end (delta: -57.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 77.78 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 42.20 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1945.93 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 152.9 MB in the beginning and 195.8 MB in the end (delta: -42.8 MB). Peak memory consumption was 104.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 7213.65 ms. Allocated memory was 249.0 MB in the beginning and 383.3 MB in the end (delta: 134.2 MB). Free memory was 194.0 MB in the beginning and 189.5 MB in the end (delta: 4.5 MB). Peak memory consumption was 138.7 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    766 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.4s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 73 TotalNumberOfCompositions, 3682 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 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_buff0_thd3;
[L712]               0  _Bool x$r_buff1_thd0;
[L713]               0  _Bool x$r_buff1_thd1;
[L714]               0  _Bool x$r_buff1_thd2;
[L715]               0  _Bool x$r_buff1_thd3;
[L716]               0  _Bool x$read_delayed;
[L717]               0  int *x$read_delayed_var;
[L718]               0  int x$w_buff0;
[L719]               0  _Bool x$w_buff0_used;
[L720]               0  int x$w_buff1;
[L721]               0  _Bool x$w_buff1_used;
[L723]               0  int y = 0;
[L725]               0  int z = 0;
[L726]               0  _Bool weak$$choice0;
[L727]               0  _Bool weak$$choice2;
[L818]               0  pthread_t t2513;
[L819]  FCALL, FORK  0  pthread_create(&t2513, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L820]               0  pthread_t t2514;
[L821]  FCALL, FORK  0  pthread_create(&t2514, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L822]               0  pthread_t t2515;
[L761]               2  x$w_buff1 = x$w_buff0
[L762]               2  x$w_buff0 = 1
[L763]               2  x$w_buff1_used = x$w_buff0_used
[L764]               2  x$w_buff0_used = (_Bool)1
[L8]    COND FALSE   2  !(!expression)
[L766]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L767]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L768]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L769]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L770]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L823]  FCALL, FORK  0  pthread_create(&t2515, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L790]               3  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0]
[L793]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1]
[L731]               1  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2]
[L796]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L796]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L797]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L798]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L799]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L799]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L800]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L800]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L803]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L805]               3  return 0;
[L736]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L737]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L738]               1  x$flush_delayed = weak$$choice2
[L739]               1  x$mem_tmp = x
[L740]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L740]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L741]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L741]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L742]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L742]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L743]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? 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_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L743]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L743]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L744]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L744]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L744]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L744]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L745]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L745]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L746]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L746]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747]               1  __unbuffered_p0_EAX = x
[L748]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L748]               1  x = x$flush_delayed ? x$mem_tmp : x
[L749]               1  x$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2]
[L776]  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)
[L776]               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)
[L777]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L777]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L778]               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
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L779]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L780]               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
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L785]               2  return 0;
[L754]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L756]               1  return 0;
[L825]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L836]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 210 SDtfs, 156 SDslu, 291 SDs, 0 SdLazy, 134 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 13 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 5977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...