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


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


This is Ultimate 0.1.25-7bb8cbd
[2020-10-15 18:12:35,993 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-15 18:12:35,996 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-15 18:12:36,035 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-15 18:12:36,035 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-15 18:12:36,043 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-15 18:12:36,046 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-15 18:12:36,050 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-15 18:12:36,053 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-15 18:12:36,056 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-15 18:12:36,057 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-15 18:12:36,058 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-15 18:12:36,058 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-15 18:12:36,061 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-15 18:12:36,063 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-15 18:12:36,065 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-15 18:12:36,066 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-15 18:12:36,067 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-15 18:12:36,068 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-15 18:12:36,076 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-15 18:12:36,079 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-15 18:12:36,080 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-15 18:12:36,081 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-15 18:12:36,081 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-15 18:12:36,099 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-15 18:12:36,100 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-15 18:12:36,100 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-15 18:12:36,101 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-15 18:12:36,101 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-15 18:12:36,102 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-15 18:12:36,102 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-15 18:12:36,103 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-15 18:12:36,109 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-15 18:12:36,110 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-15 18:12:36,110 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-15 18:12:36,111 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-15 18:12:36,111 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-15 18:12:36,112 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-15 18:12:36,112 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-15 18:12:36,113 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-15 18:12:36,113 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-15 18:12:36,114 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-15 18:12:36,135 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-15 18:12:36,135 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-15 18:12:36,136 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-15 18:12:36,137 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-15 18:12:36,137 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-15 18:12:36,137 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-15 18:12:36,137 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-15 18:12:36,137 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-15 18:12:36,138 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-15 18:12:36,139 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-15 18:12:36,139 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-15 18:12:36,139 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-15 18:12:36,139 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-15 18:12:36,139 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-15 18:12:36,140 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-15 18:12:36,140 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-15 18:12:36,140 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:12:36,140 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-15 18:12:36,140 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-15 18:12:36,141 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-10-15 18:12:36,429 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-15 18:12:36,439 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-15 18:12:36,443 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-15 18:12:36,444 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-15 18:12:36,444 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-15 18:12:36,445 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i
[2020-10-15 18:12:36,519 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4ed060a/bd34a418c62c405bb64490f0c3736c69/FLAG0b5b43d6d
[2020-10-15 18:12:37,066 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-15 18:12:37,070 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_tso.oepc.i
[2020-10-15 18:12:37,104 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4ed060a/bd34a418c62c405bb64490f0c3736c69/FLAG0b5b43d6d
[2020-10-15 18:12:37,354 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4ed060a/bd34a418c62c405bb64490f0c3736c69
[2020-10-15 18:12:37,362 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-15 18:12:37,364 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-15 18:12:37,365 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-15 18:12:37,366 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-15 18:12:37,369 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-15 18:12:37,370 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:12:37" (1/1) ...
[2020-10-15 18:12:37,373 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d21f09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:37, skipping insertion in model container
[2020-10-15 18:12:37,373 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:12:37" (1/1) ...
[2020-10-15 18:12:37,381 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-15 18:12:37,447 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-15 18:12:37,958 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:12:37,975 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-15 18:12:38,091 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-15 18:12:38,167 INFO  L208         MainTranslator]: Completed translation
[2020-10-15 18:12:38,167 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38 WrapperNode
[2020-10-15 18:12:38,168 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-15 18:12:38,168 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-15 18:12:38,169 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-15 18:12:38,169 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-15 18:12:38,178 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,199 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,231 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-15 18:12:38,232 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-15 18:12:38,232 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-15 18:12:38,232 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-15 18:12:38,242 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,243 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,248 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,248 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,260 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,265 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,268 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
[2020-10-15 18:12:38,274 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-15 18:12:38,274 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-15 18:12:38,274 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-15 18:12:38,275 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-15 18:12:38,275 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-15 18:12:38,339 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-15 18:12:38,339 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-15 18:12:38,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-15 18:12:38,339 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-15 18:12:38,339 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-15 18:12:38,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-15 18:12:38,340 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-15 18:12:38,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-15 18:12:38,340 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-15 18:12:38,340 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-15 18:12:38,340 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-15 18:12:38,341 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-15 18:12:38,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-15 18:12:38,343 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-15 18:12:40,462 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-15 18:12:40,462 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-15 18:12:40,465 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:12:40 BoogieIcfgContainer
[2020-10-15 18:12:40,465 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-15 18:12:40,466 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-15 18:12:40,466 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-15 18:12:40,470 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-15 18:12:40,470 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:12:37" (1/3) ...
[2020-10-15 18:12:40,471 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5c52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:12:40, skipping insertion in model container
[2020-10-15 18:12:40,471 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:12:38" (2/3) ...
[2020-10-15 18:12:40,471 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d5c52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:12:40, skipping insertion in model container
[2020-10-15 18:12:40,472 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:12:40" (3/3) ...
[2020-10-15 18:12:40,473 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix016_tso.oepc.i
[2020-10-15 18:12:40,485 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-15 18:12:40,486 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-15 18:12:40,493 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-15 18:12:40,494 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-15 18:12:40,528 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,529 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,529 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,530 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,530 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,533 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,534 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,534 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,534 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,534 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,535 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,535 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,535 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,535 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,536 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,536 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,536 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,537 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,537 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,537 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,537 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,538 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,538 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,538 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,538 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,539 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,539 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,539 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,539 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,539 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,540 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,540 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,540 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,540 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,540 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,541 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,541 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,541 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,541 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,547 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,548 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,549 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,554 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,555 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,555 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,556 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,557 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,558 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,558 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,559 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,560 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,561 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,562 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,566 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,566 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,566 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,568 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,568 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,568 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,573 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,574 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,574 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,574 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,574 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,574 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,575 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,575 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,575 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,575 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-15 18:12:40,591 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-15 18:12:40,613 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-15 18:12:40,613 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-15 18:12:40,613 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-15 18:12:40,613 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-15 18:12:40,614 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-15 18:12:40,614 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-15 18:12:40,614 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-15 18:12:40,614 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-15 18:12:40,629 INFO  L129   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2020-10-15 18:12:40,631 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow
[2020-10-15 18:12:40,634 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow
[2020-10-15 18:12:40,636 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow
[2020-10-15 18:12:40,686 INFO  L129       PetriNetUnfolder]: 2/93 cut-off events.
[2020-10-15 18:12:40,686 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-15 18:12:40,691 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. 
[2020-10-15 18:12:40,695 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1732
[2020-10-15 18:12:40,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:40,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:12:40,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:40,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,034 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,034 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,037 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,037 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,039 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,039 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,042 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,042 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,044 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:41,045 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,049 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,050 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,169 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:12:41,170 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,276 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,277 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,278 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,278 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,281 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,281 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,283 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,304 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,305 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,306 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,306 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,308 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,517 WARN  L193               SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41
[2020-10-15 18:12:41,623 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,624 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,626 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,626 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,630 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,631 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:41,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:41,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,635 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,637 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,637 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,683 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:41,683 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:12:41,686 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:41,687 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:41,715 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,715 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,716 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,716 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,718 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,719 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,721 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,721 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,737 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,738 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,738 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,739 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,741 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,741 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,743 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,743 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,823 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,823 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,824 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,825 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,826 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,827 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,829 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,829 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,846 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,847 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,848 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,849 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:41,851 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:41,851 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:41,853 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:41,854 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,259 WARN  L193               SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-15 18:12:42,374 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,374 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,375 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,375 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,377 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,378 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,380 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,380 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,398 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,399 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,399 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,400 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,401 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,402 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,403 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,404 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,435 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,436 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,436 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,437 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,438 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,439 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,440 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,441 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,455 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,455 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,456 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,456 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,458 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,458 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,460 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,460 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,612 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,612 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,613 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,614 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,615 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,616 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,617 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,618 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,631 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,632 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:42,634 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:42,635 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,636 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:42,637 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:42,875 WARN  L193               SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-15 18:12:42,989 WARN  L193               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55
[2020-10-15 18:12:43,110 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:12:43,111 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,189 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,190 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,194 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,194 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,195 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,196 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,197 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,197 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,199 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:43,199 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,201 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,201 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,202 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,203 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,243 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,243 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:12:43,246 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:43,246 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,284 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,284 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,285 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,286 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,287 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,288 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,290 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,291 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,307 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,307 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,308 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,308 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,310 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,311 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,312 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,313 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,402 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,402 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-10-15 18:12:43,405 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:43,405 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,484 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,484 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,488 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,488 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,490 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,490 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,491 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,491 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-10-15 18:12:43,492 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-10-15 18:12:43,493 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,494 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,494 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,495 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-10-15 18:12:43,495 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,535 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,536 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,537 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,537 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,538 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,539 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,540 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,540 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,556 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,557 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,557 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,558 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,559 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,559 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,561 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,563 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,601 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,601 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,604 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,605 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,606 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,607 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,610 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,611 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,627 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,628 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,628 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,629 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,630 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,631 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,632 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,633 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,665 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,666 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,667 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,667 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,669 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,669 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,671 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,671 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,687 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,688 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,688 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,689 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,690 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,691 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,693 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,693 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,726 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-10-15 18:12:43,726 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,744 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,745 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,745 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,746 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,747 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,748 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,749 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,749 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,763 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,764 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,764 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,765 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,766 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,767 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,768 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,769 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,791 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,791 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,792 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,792 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,794 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,794 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,795 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,795 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,808 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,808 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,809 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,809 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,811 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,811 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,812 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,813 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,951 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,951 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,952 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,952 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,953 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,954 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,956 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,957 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:43,976 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,977 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,977 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,978 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:43,979 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:43,981 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:43,982 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:43,982 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:44,026 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:44,026 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:44,027 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:44,027 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:44,029 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:44,029 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:44,030 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:44,030 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-10-15 18:12:44,043 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:44,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:44,044 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:44,044 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-10-15 18:12:44,046 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-10-15 18:12:44,046 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:44,047 INFO  L375       QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-10-15 18:12:44,048 INFO  L603       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-10-15 18:12:44,936 WARN  L193               SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91
[2020-10-15 18:12:45,052 WARN  L193               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89
[2020-10-15 18:12:45,062 INFO  L132        LiptonReduction]: Checked pairs total: 5314
[2020-10-15 18:12:45,062 INFO  L134        LiptonReduction]: Total number of compositions: 81
[2020-10-15 18:12:45,069 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow
[2020-10-15 18:12:45,130 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states.
[2020-10-15 18:12:45,132 INFO  L276                IsEmpty]: Start isEmpty. Operand 974 states.
[2020-10-15 18:12:45,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2020-10-15 18:12:45,138 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:45,139 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1]
[2020-10-15 18:12:45,139 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:45,145 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:45,145 INFO  L82        PathProgramCache]: Analyzing trace with hash 1054917, now seen corresponding path program 1 times
[2020-10-15 18:12:45,155 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:45,156 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503849920]
[2020-10-15 18:12:45,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:45,290 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:45,378 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-15 18:12:45,379 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503849920]
[2020-10-15 18:12:45,380 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:45,380 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:12:45,381 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719277534]
[2020-10-15 18:12:45,386 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:12:45,387 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:45,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:12:45,402 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:12:45,404 INFO  L87              Difference]: Start difference. First operand 974 states. Second operand 3 states.
[2020-10-15 18:12:45,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:45,550 INFO  L93              Difference]: Finished difference Result 812 states and 2575 transitions.
[2020-10-15 18:12:45,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:12:45,562 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2020-10-15 18:12:45,562 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:45,589 INFO  L225             Difference]: With dead ends: 812
[2020-10-15 18:12:45,589 INFO  L226             Difference]: Without dead ends: 662
[2020-10-15 18:12:45,590 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-15 18:12:45,615 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2020-10-15 18:12:45,709 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662.
[2020-10-15 18:12:45,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 662 states.
[2020-10-15 18:12:45,721 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions.
[2020-10-15 18:12:45,724 INFO  L78                 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 3
[2020-10-15 18:12:45,725 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:45,725 INFO  L481      AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions.
[2020-10-15 18:12:45,725 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:12:45,725 INFO  L276                IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions.
[2020-10-15 18:12:45,726 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-15 18:12:45,727 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:45,727 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:12:45,727 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-15 18:12:45,727 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:45,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:45,728 INFO  L82        PathProgramCache]: Analyzing trace with hash -70804366, now seen corresponding path program 1 times
[2020-10-15 18:12:45,728 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:45,728 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894141514]
[2020-10-15 18:12:45,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:45,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:45,848 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-15 18:12:45,849 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894141514]
[2020-10-15 18:12:45,849 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:45,849 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-15 18:12:45,850 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859293432]
[2020-10-15 18:12:45,851 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-15 18:12:45,851 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:45,852 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-15 18:12:45,852 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-15 18:12:45,852 INFO  L87              Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states.
[2020-10-15 18:12:45,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:45,863 INFO  L93              Difference]: Finished difference Result 612 states and 1880 transitions.
[2020-10-15 18:12:45,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-15 18:12:45,864 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-15 18:12:45,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:45,870 INFO  L225             Difference]: With dead ends: 612
[2020-10-15 18:12:45,870 INFO  L226             Difference]: Without dead ends: 612
[2020-10-15 18:12:45,871 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-15 18:12:45,874 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 612 states.
[2020-10-15 18:12:45,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612.
[2020-10-15 18:12:45,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 612 states.
[2020-10-15 18:12:45,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions.
[2020-10-15 18:12:45,904 INFO  L78                 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 9
[2020-10-15 18:12:45,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:45,905 INFO  L481      AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions.
[2020-10-15 18:12:45,905 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-15 18:12:45,905 INFO  L276                IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions.
[2020-10-15 18:12:45,908 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-15 18:12:45,908 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:45,908 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:12:45,908 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-15 18:12:45,908 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:45,909 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:45,909 INFO  L82        PathProgramCache]: Analyzing trace with hash 675523361, now seen corresponding path program 1 times
[2020-10-15 18:12:45,909 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:45,910 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183486727]
[2020-10-15 18:12:45,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:45,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:46,038 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-15 18:12:46,038 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183486727]
[2020-10-15 18:12:46,038 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:46,039 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-15 18:12:46,039 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682561907]
[2020-10-15 18:12:46,039 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-15 18:12:46,039 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:46,040 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-15 18:12:46,040 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-15 18:12:46,040 INFO  L87              Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states.
[2020-10-15 18:12:46,091 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:46,092 INFO  L93              Difference]: Finished difference Result 554 states and 1493 transitions.
[2020-10-15 18:12:46,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-15 18:12:46,092 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-15 18:12:46,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:46,095 INFO  L225             Difference]: With dead ends: 554
[2020-10-15 18:12:46,095 INFO  L226             Difference]: Without dead ends: 404
[2020-10-15 18:12:46,096 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:12:46,098 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 404 states.
[2020-10-15 18:12:46,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404.
[2020-10-15 18:12:46,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 404 states.
[2020-10-15 18:12:46,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1048 transitions.
[2020-10-15 18:12:46,112 INFO  L78                 Accepts]: Start accepts. Automaton has 404 states and 1048 transitions. Word has length 11
[2020-10-15 18:12:46,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:46,112 INFO  L481      AbstractCegarLoop]: Abstraction has 404 states and 1048 transitions.
[2020-10-15 18:12:46,112 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-15 18:12:46,112 INFO  L276                IsEmpty]: Start isEmpty. Operand 404 states and 1048 transitions.
[2020-10-15 18:12:46,115 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-15 18:12:46,115 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:46,115 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:12:46,115 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-15 18:12:46,115 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:46,116 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:46,116 INFO  L82        PathProgramCache]: Analyzing trace with hash 479877717, now seen corresponding path program 1 times
[2020-10-15 18:12:46,116 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:46,116 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223456992]
[2020-10-15 18:12:46,116 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:46,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:46,298 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-15 18:12:46,298 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223456992]
[2020-10-15 18:12:46,298 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:46,299 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:12:46,299 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434691852]
[2020-10-15 18:12:46,299 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:12:46,299 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:46,300 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:12:46,300 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:12:46,300 INFO  L87              Difference]: Start difference. First operand 404 states and 1048 transitions. Second operand 5 states.
[2020-10-15 18:12:46,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:46,355 INFO  L93              Difference]: Finished difference Result 322 states and 773 transitions.
[2020-10-15 18:12:46,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:12:46,356 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-15 18:12:46,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:46,358 INFO  L225             Difference]: With dead ends: 322
[2020-10-15 18:12:46,358 INFO  L226             Difference]: Without dead ends: 252
[2020-10-15 18:12:46,359 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:12:46,360 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2020-10-15 18:12:46,365 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252.
[2020-10-15 18:12:46,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 252 states.
[2020-10-15 18:12:46,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 592 transitions.
[2020-10-15 18:12:46,366 INFO  L78                 Accepts]: Start accepts. Automaton has 252 states and 592 transitions. Word has length 14
[2020-10-15 18:12:46,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:46,367 INFO  L481      AbstractCegarLoop]: Abstraction has 252 states and 592 transitions.
[2020-10-15 18:12:46,367 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:12:46,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 252 states and 592 transitions.
[2020-10-15 18:12:46,369 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-15 18:12:46,369 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:46,369 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:12:46,370 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-15 18:12:46,370 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:46,370 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:46,370 INFO  L82        PathProgramCache]: Analyzing trace with hash 697884256, now seen corresponding path program 1 times
[2020-10-15 18:12:46,370 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:46,371 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592668443]
[2020-10-15 18:12:46,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:46,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:46,513 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-15 18:12:46,513 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592668443]
[2020-10-15 18:12:46,514 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:46,514 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-10-15 18:12:46,514 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225702221]
[2020-10-15 18:12:46,514 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-15 18:12:46,515 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:46,515 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-15 18:12:46,515 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2020-10-15 18:12:46,515 INFO  L87              Difference]: Start difference. First operand 252 states and 592 transitions. Second operand 5 states.
[2020-10-15 18:12:46,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:46,674 INFO  L93              Difference]: Finished difference Result 424 states and 963 transitions.
[2020-10-15 18:12:46,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-10-15 18:12:46,674 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2020-10-15 18:12:46,675 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:46,677 INFO  L225             Difference]: With dead ends: 424
[2020-10-15 18:12:46,677 INFO  L226             Difference]: Without dead ends: 373
[2020-10-15 18:12:46,678 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:12:46,679 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2020-10-15 18:12:46,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 295.
[2020-10-15 18:12:46,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 295 states.
[2020-10-15 18:12:46,689 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 680 transitions.
[2020-10-15 18:12:46,689 INFO  L78                 Accepts]: Start accepts. Automaton has 295 states and 680 transitions. Word has length 18
[2020-10-15 18:12:46,690 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:46,690 INFO  L481      AbstractCegarLoop]: Abstraction has 295 states and 680 transitions.
[2020-10-15 18:12:46,690 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-15 18:12:46,690 INFO  L276                IsEmpty]: Start isEmpty. Operand 295 states and 680 transitions.
[2020-10-15 18:12:46,691 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-15 18:12:46,691 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:46,691 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-15 18:12:46,692 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-15 18:12:46,692 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:46,692 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:46,692 INFO  L82        PathProgramCache]: Analyzing trace with hash -1290552596, now seen corresponding path program 2 times
[2020-10-15 18:12:46,692 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:46,693 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820548284]
[2020-10-15 18:12:46,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:46,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:46,922 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-15 18:12:46,923 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820548284]
[2020-10-15 18:12:46,923 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:46,923 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 18:12:46,923 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518052573]
[2020-10-15 18:12:46,924 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-10-15 18:12:46,925 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:46,925 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-10-15 18:12:46,925 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-10-15 18:12:46,926 INFO  L87              Difference]: Start difference. First operand 295 states and 680 transitions. Second operand 6 states.
[2020-10-15 18:12:46,991 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:46,991 INFO  L93              Difference]: Finished difference Result 272 states and 629 transitions.
[2020-10-15 18:12:46,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 18:12:46,992 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 18
[2020-10-15 18:12:46,992 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:46,993 INFO  L225             Difference]: With dead ends: 272
[2020-10-15 18:12:46,994 INFO  L226             Difference]: Without dead ends: 235
[2020-10-15 18:12:46,994 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:12:46,995 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 235 states.
[2020-10-15 18:12:47,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235.
[2020-10-15 18:12:47,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 235 states.
[2020-10-15 18:12:47,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 552 transitions.
[2020-10-15 18:12:47,003 INFO  L78                 Accepts]: Start accepts. Automaton has 235 states and 552 transitions. Word has length 18
[2020-10-15 18:12:47,004 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:47,004 INFO  L481      AbstractCegarLoop]: Abstraction has 235 states and 552 transitions.
[2020-10-15 18:12:47,004 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-10-15 18:12:47,004 INFO  L276                IsEmpty]: Start isEmpty. Operand 235 states and 552 transitions.
[2020-10-15 18:12:47,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-15 18:12:47,006 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:47,006 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, 1, 1]
[2020-10-15 18:12:47,006 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-15 18:12:47,006 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:47,006 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:47,006 INFO  L82        PathProgramCache]: Analyzing trace with hash 1571400200, now seen corresponding path program 1 times
[2020-10-15 18:12:47,007 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:47,007 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475290504]
[2020-10-15 18:12:47,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:47,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-15 18:12:47,234 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-15 18:12:47,235 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475290504]
[2020-10-15 18:12:47,235 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-15 18:12:47,235 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-15 18:12:47,236 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952610906]
[2020-10-15 18:12:47,237 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-15 18:12:47,237 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-15 18:12:47,237 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-15 18:12:47,238 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2020-10-15 18:12:47,238 INFO  L87              Difference]: Start difference. First operand 235 states and 552 transitions. Second operand 7 states.
[2020-10-15 18:12:47,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-15 18:12:47,407 INFO  L93              Difference]: Finished difference Result 249 states and 574 transitions.
[2020-10-15 18:12:47,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-15 18:12:47,408 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 22
[2020-10-15 18:12:47,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-15 18:12:47,410 INFO  L225             Difference]: With dead ends: 249
[2020-10-15 18:12:47,410 INFO  L226             Difference]: Without dead ends: 181
[2020-10-15 18:12:47,410 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2020-10-15 18:12:47,412 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2020-10-15 18:12:47,416 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161.
[2020-10-15 18:12:47,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2020-10-15 18:12:47,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 370 transitions.
[2020-10-15 18:12:47,417 INFO  L78                 Accepts]: Start accepts. Automaton has 161 states and 370 transitions. Word has length 22
[2020-10-15 18:12:47,418 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-15 18:12:47,418 INFO  L481      AbstractCegarLoop]: Abstraction has 161 states and 370 transitions.
[2020-10-15 18:12:47,418 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-15 18:12:47,418 INFO  L276                IsEmpty]: Start isEmpty. Operand 161 states and 370 transitions.
[2020-10-15 18:12:47,419 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2020-10-15 18:12:47,419 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-15 18:12:47,419 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, 1, 1]
[2020-10-15 18:12:47,420 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-15 18:12:47,420 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-15 18:12:47,420 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-15 18:12:47,420 INFO  L82        PathProgramCache]: Analyzing trace with hash 1370212756, now seen corresponding path program 2 times
[2020-10-15 18:12:47,421 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-15 18:12:47,421 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499013675]
[2020-10-15 18:12:47,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-15 18:12:47,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:12:47,491 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:12:47,598 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-15 18:12:47,599 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-15 18:12:47,663 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-15 18:12:47,663 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-15 18:12:47,664 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-15 18:12:47,665 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-15 18:12:47,685 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L838-->L845: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In463827486 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In463827486 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In463827486 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In463827486 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and (= ~z$w_buff0_used~0_Out463827486 ~z$w_buff0_used~0_In463827486) .cse0) (and .cse1 .cse2 (= ~z$w_buff0_used~0_Out463827486 0))) (= ~z$r_buff0_thd0~0_In463827486 ~z$r_buff0_thd0~0_Out463827486) (= ~z$r_buff1_thd0~0_In463827486 ~z$r_buff1_thd0~0_Out463827486) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In463827486| ULTIMATE.start_assume_abort_if_not_~cond_Out463827486) (or (and (or (and .cse3 (= ~z$w_buff1~0_In463827486 ~z~0_Out463827486) .cse4) (and (= ~z~0_In463827486 ~z~0_Out463827486) .cse5)) .cse0) (and (= ~z$w_buff0~0_In463827486 ~z~0_Out463827486) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out463827486 0)) (or (and (= ~z$w_buff1_used~0_Out463827486 ~z$w_buff1_used~0_In463827486) .cse5) (and .cse3 (= ~z$w_buff1_used~0_Out463827486 0) .cse4)))))  InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In463827486|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In463827486, ~z$w_buff0_used~0=~z$w_buff0_used~0_In463827486, ~z$w_buff0~0=~z$w_buff0~0_In463827486, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In463827486, ~z$w_buff1_used~0=~z$w_buff1_used~0_In463827486, ~z$w_buff1~0=~z$w_buff1~0_In463827486, ~z~0=~z~0_In463827486}  OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out463827486, ~z$w_buff0~0=~z$w_buff0~0_In463827486, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out463827486, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out463827486|, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out463827486|, ~z$w_buff1~0=~z$w_buff1~0_In463827486, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out463827486|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out463827486|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out463827486|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In463827486|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out463827486, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out463827486|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out463827486, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out463827486, ~z~0=~z~0_Out463827486}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#t~ite50, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge
[2020-10-15 18:12:47,692 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-15 18:12:47,692 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,698 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-15 18:12:47,698 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,699 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-15 18:12:47,700 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,700 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-15 18:12:47,700 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,700 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-15 18:12:47,701 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,701 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-15 18:12:47,701 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,703 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-15 18:12:47,703 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,703 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-15 18:12:47,703 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,704 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-15 18:12:47,704 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,704 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-15 18:12:47,704 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,705 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-15 18:12:47,705 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,705 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-15 18:12:47,705 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,705 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-15 18:12:47,706 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,706 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-15 18:12:47,706 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,706 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-15 18:12:47,706 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,707 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-15 18:12:47,707 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,707 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-15 18:12:47,707 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,711 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-15 18:12:47,712 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,712 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-15 18:12:47,712 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,712 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-15 18:12:47,713 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,713 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-15 18:12:47,713 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,713 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-15 18:12:47,739 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,739 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-15 18:12:47,740 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,740 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-15 18:12:47,740 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,740 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-15 18:12:47,740 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,740 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-15 18:12:47,740 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,740 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-15 18:12:47,740 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-15 18:12:47,842 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:12:47 BasicIcfg
[2020-10-15 18:12:47,842 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-15 18:12:47,844 INFO  L168              Benchmark]: Toolchain (without parser) took 10480.28 ms. Allocated memory was 251.1 MB in the beginning and 531.6 MB in the end (delta: 280.5 MB). Free memory was 205.9 MB in the beginning and 490.2 MB in the end (delta: -284.3 MB). Peak memory consumption was 325.6 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,845 INFO  L168              Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,846 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 205.0 MB in the beginning and 265.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,847 INFO  L168              Benchmark]: Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 314.0 MB. Free memory was 265.9 MB in the beginning and 262.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,847 INFO  L168              Benchmark]: Boogie Preprocessor took 42.01 ms. Allocated memory is still 314.0 MB. Free memory was 262.6 MB in the beginning and 260.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,848 INFO  L168              Benchmark]: RCFGBuilder took 2190.57 ms. Allocated memory was 314.0 MB in the beginning and 359.7 MB in the end (delta: 45.6 MB). Free memory was 260.0 MB in the beginning and 191.2 MB in the end (delta: 68.8 MB). Peak memory consumption was 114.4 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,849 INFO  L168              Benchmark]: TraceAbstraction took 7376.35 ms. Allocated memory was 359.7 MB in the beginning and 531.6 MB in the end (delta: 172.0 MB). Free memory was 191.2 MB in the beginning and 490.2 MB in the end (delta: -299.0 MB). Peak memory consumption was 202.5 MB. Max. memory is 14.2 GB.
[2020-10-15 18:12:47,854 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.47 ms. Allocated memory is still 251.1 MB. Free memory was 229.2 MB in the beginning and 228.3 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB.
 * CACSL2BoogieTranslator took 802.61 ms. Allocated memory was 251.1 MB in the beginning and 314.0 MB in the end (delta: 62.9 MB). Free memory was 205.0 MB in the beginning and 265.9 MB in the end (delta: -60.9 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB.
 * Boogie Procedure Inliner took 63.33 ms. Allocated memory is still 314.0 MB. Free memory was 265.9 MB in the beginning and 262.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB.
 * Boogie Preprocessor took 42.01 ms. Allocated memory is still 314.0 MB. Free memory was 262.6 MB in the beginning and 260.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB.
 * RCFGBuilder took 2190.57 ms. Allocated memory was 314.0 MB in the beginning and 359.7 MB in the end (delta: 45.6 MB). Free memory was 260.0 MB in the beginning and 191.2 MB in the end (delta: 68.8 MB). Peak memory consumption was 114.4 MB. Max. memory is 14.2 GB.
 * TraceAbstraction took 7376.35 ms. Allocated memory was 359.7 MB in the beginning and 531.6 MB in the end (delta: 172.0 MB). Free memory was 191.2 MB in the beginning and 490.2 MB in the end (delta: -299.0 MB). Peak memory consumption was 202.5 MB. Max. memory is 14.2 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    1250 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 151 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.4s, 104 PlacesBefore, 37 PlacesAfterwards, 96 TransitionsBefore, 27 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 5314 MoverChecksTotal
  - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L698]               0  int __unbuffered_cnt = 0;
[L700]               0  int __unbuffered_p0_EAX = 0;
[L702]               0  int __unbuffered_p1_EAX = 0;
[L704]               0  int __unbuffered_p2_EAX = 0;
[L706]               0  int __unbuffered_p2_EBX = 0;
[L707]               0  _Bool main$tmp_guard0;
[L708]               0  _Bool main$tmp_guard1;
[L710]               0  int x = 0;
[L712]               0  int y = 0;
[L714]               0  int z = 0;
[L715]               0  _Bool z$flush_delayed;
[L716]               0  int z$mem_tmp;
[L717]               0  _Bool z$r_buff0_thd0;
[L718]               0  _Bool z$r_buff0_thd1;
[L719]               0  _Bool z$r_buff0_thd2;
[L720]               0  _Bool z$r_buff0_thd3;
[L721]               0  _Bool z$r_buff1_thd0;
[L722]               0  _Bool z$r_buff1_thd1;
[L723]               0  _Bool z$r_buff1_thd2;
[L724]               0  _Bool z$r_buff1_thd3;
[L725]               0  _Bool z$read_delayed;
[L726]               0  int *z$read_delayed_var;
[L727]               0  int z$w_buff0;
[L728]               0  _Bool z$w_buff0_used;
[L729]               0  int z$w_buff1;
[L730]               0  _Bool z$w_buff1_used;
[L731]               0  _Bool weak$$choice0;
[L732]               0  _Bool weak$$choice2;
[L829]               0  pthread_t t427;
[L830]  FCALL, FORK  0  pthread_create(&t427, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L831]               0  pthread_t t428;
[L736]               1  z$w_buff1 = z$w_buff0
[L737]               1  z$w_buff0 = 1
[L738]               1  z$w_buff1_used = z$w_buff0_used
[L739]               1  z$w_buff0_used = (_Bool)1
[L7]    COND TRUE    1  !expression
[L7]                 1  __VERIFIER_error()
[L741]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L742]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L743]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L744]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L745]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L748]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L832]  FCALL, FORK  0  pthread_create(&t428, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L765]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L768]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L771]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L772]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L772]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L773]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L773]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L774]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L774]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L775]  EXPR         2  z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L775]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
[L778]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L780]               2  return 0;
[L833]               0  pthread_t t429;
[L834]  FCALL, FORK  0  pthread_create(&t429, ((void *)0), P2, ((void *)0))
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L785]               3  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L788]               3  __unbuffered_p2_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L791]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L792]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L793]               3  z$flush_delayed = weak$$choice2
[L794]               3  z$mem_tmp = z
[L795]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L795]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1
[L795]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L795]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L796]  EXPR         3  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L796]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L797]  EXPR         3  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L797]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L798]  EXPR         3  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L798]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L799]  EXPR         3  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L800]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)
[L800]  EXPR         3  weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L800]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L801]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]  EXPR         3  !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L801]  EXPR         3  weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L802]               3  __unbuffered_p2_EBX = z
[L803]  EXPR         3  z$flush_delayed ? z$mem_tmp : z
[L803]               3  z = z$flush_delayed ? z$mem_tmp : z
[L804]               3  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L807]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L807]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L808]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L808]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L809]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L809]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L810]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L810]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L811]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L811]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L751]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L751]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L752]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L752]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L753]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L753]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L754]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L754]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L755]  EXPR         1  z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L755]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
[L758]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L760]               1  return 0;
[L814]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L816]               3  return 0;
[L836]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L847]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L7]    COND TRUE    0  !expression
[L7]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 217 SDtfs, 226 SDslu, 422 SDs, 0 SdLazy, 203 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 98 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 8833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...