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


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


This is Ultimate 0.1.25-b09bf87
[2020-10-16 13:35:41,895 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-16 13:35:41,898 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-16 13:35:41,922 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-16 13:35:41,923 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-16 13:35:41,924 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-16 13:35:41,925 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-16 13:35:41,927 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-16 13:35:41,928 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-16 13:35:41,929 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-16 13:35:41,930 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-16 13:35:41,931 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-16 13:35:41,932 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-16 13:35:41,933 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-16 13:35:41,934 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-16 13:35:41,935 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-16 13:35:41,936 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-16 13:35:41,937 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-16 13:35:41,938 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-16 13:35:41,940 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-16 13:35:41,942 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-16 13:35:41,943 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-16 13:35:41,944 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-16 13:35:41,945 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-16 13:35:41,948 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-16 13:35:41,948 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-16 13:35:41,948 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-16 13:35:41,949 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-16 13:35:41,950 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-16 13:35:41,950 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-16 13:35:41,951 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-16 13:35:41,951 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-16 13:35:41,952 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-16 13:35:41,953 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-16 13:35:41,954 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-16 13:35:41,954 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-16 13:35:41,955 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-16 13:35:41,955 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-16 13:35:41,955 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-16 13:35:41,956 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-16 13:35:41,957 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-16 13:35:41,958 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf
[2020-10-16 13:35:42,004 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-16 13:35:42,005 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-16 13:35:42,010 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-16 13:35:42,010 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-16 13:35:42,011 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-16 13:35:42,011 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-16 13:35:42,011 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-16 13:35:42,011 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-16 13:35:42,011 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-16 13:35:42,012 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-16 13:35:42,012 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-16 13:35:42,012 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-16 13:35:42,012 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-16 13:35:42,012 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-16 13:35:42,013 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-16 13:35:42,013 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-16 13:35:42,013 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-16 13:35:42,013 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-16 13:35:42,013 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-16 13:35:42,014 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-16 13:35:42,014 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-16 13:35:42,019 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:35:42,020 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-16 13:35:42,020 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2020-10-16 13:35:42,020 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-16 13:35:42,020 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-16 13:35:42,021 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-16 13:35:42,021 INFO  L138        SettingsManager]:  * Override the interpolant automaton setting of the refinement strategy=true
[2020-10-16 13:35:42,021 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK
[2020-10-16 13:35:42,021 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-16 13:35:42,021 INFO  L138        SettingsManager]:  * Interpolant automaton=MCR
[2020-10-16 13:35:42,357 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-16 13:35:42,374 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-16 13:35:42,379 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-16 13:35:42,382 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-16 13:35:42,384 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-16 13:35:42,386 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i
[2020-10-16 13:35:42,472 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6dbdef60/d78f7b1598af4984b768d1f818d50b1e/FLAG0f999833a
[2020-10-16 13:35:43,013 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-16 13:35:43,014 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i
[2020-10-16 13:35:43,032 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6dbdef60/d78f7b1598af4984b768d1f818d50b1e/FLAG0f999833a
[2020-10-16 13:35:43,318 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a6dbdef60/d78f7b1598af4984b768d1f818d50b1e
[2020-10-16 13:35:43,329 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-16 13:35:43,331 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-10-16 13:35:43,332 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-16 13:35:43,333 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-16 13:35:43,336 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-16 13:35:43,337 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:43" (1/1) ...
[2020-10-16 13:35:43,340 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:43, skipping insertion in model container
[2020-10-16 13:35:43,340 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:43" (1/1) ...
[2020-10-16 13:35:43,348 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-16 13:35:43,399 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-16 13:35:44,052 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:35:44,066 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-16 13:35:44,123 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-16 13:35:44,211 INFO  L208         MainTranslator]: Completed translation
[2020-10-16 13:35:44,212 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44 WrapperNode
[2020-10-16 13:35:44,212 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-16 13:35:44,213 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-10-16 13:35:44,214 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-10-16 13:35:44,214 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-10-16 13:35:44,222 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,246 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,282 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-10-16 13:35:44,283 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-16 13:35:44,283 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-16 13:35:44,283 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-16 13:35:44,292 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,292 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,297 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,297 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,308 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,311 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,315 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
[2020-10-16 13:35:44,320 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-16 13:35:44,321 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-16 13:35:44,321 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-16 13:35:44,321 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-16 13:35:44,322 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-16 13:35:44,389 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-16 13:35:44,390 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-10-16 13:35:44,390 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-16 13:35:44,390 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-16 13:35:44,390 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-10-16 13:35:44,391 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-10-16 13:35:44,391 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-10-16 13:35:44,391 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-10-16 13:35:44,391 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-10-16 13:35:44,391 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-10-16 13:35:44,392 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-10-16 13:35:44,392 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-16 13:35:44,392 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-16 13:35:44,394 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-10-16 13:35:46,409 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-16 13:35:46,410 INFO  L298             CfgBuilder]: Removed 10 assume(true) statements.
[2020-10-16 13:35:46,413 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:46 BoogieIcfgContainer
[2020-10-16 13:35:46,413 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-16 13:35:46,414 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-16 13:35:46,415 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-16 13:35:46,419 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-16 13:35:46,419 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:35:43" (1/3) ...
[2020-10-16 13:35:46,420 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6562c647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:46, skipping insertion in model container
[2020-10-16 13:35:46,422 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44" (2/3) ...
[2020-10-16 13:35:46,423 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6562c647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:46, skipping insertion in model container
[2020-10-16 13:35:46,423 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:46" (3/3) ...
[2020-10-16 13:35:46,427 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i
[2020-10-16 13:35:46,444 WARN  L153   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-10-16 13:35:46,444 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-10-16 13:35:46,456 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-10-16 13:35:46,457 INFO  L348   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-10-16 13:35:46,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,524 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,525 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,525 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,525 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,525 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,526 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,526 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,526 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,526 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,526 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,527 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,527 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,527 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,528 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,528 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,528 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,528 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,529 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,530 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,531 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,532 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,533 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,534 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,535 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,537 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,538 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,538 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,538 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,539 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,539 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,539 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,539 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,539 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,540 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,542 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,542 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,544 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,545 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,550 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,550 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,551 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,552 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,552 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,553 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,556 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,557 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,564 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,565 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,566 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-10-16 13:35:46,568 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-10-16 13:35:46,581 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-10-16 13:35:46,604 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-16 13:35:46,604 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-16 13:35:46,604 INFO  L379      AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-10-16 13:35:46,604 INFO  L380      AbstractCegarLoop]: Backedges is MCR
[2020-10-16 13:35:46,605 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-16 13:35:46,605 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-16 13:35:46,605 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-16 13:35:46,605 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-16 13:35:46,618 INFO  L137   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2020-10-16 13:35:46,619 INFO  L144   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 13:35:46,622 INFO  L111        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow
[2020-10-16 13:35:46,624 INFO  L71            FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow
[2020-10-16 13:35:46,671 INFO  L129       PetriNetUnfolder]: 2/89 cut-off events.
[2020-10-16 13:35:46,671 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2020-10-16 13:35:46,677 INFO  L80            FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. 
[2020-10-16 13:35:46,680 INFO  L117        LiptonReduction]: Number of co-enabled transitions 1544
[2020-10-16 13:35:47,134 WARN  L193               SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2020-10-16 13:35:49,136 WARN  L193               SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87
[2020-10-16 13:35:49,255 WARN  L193               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85
[2020-10-16 13:35:49,264 INFO  L132        LiptonReduction]: Checked pairs total: 4006
[2020-10-16 13:35:49,264 INFO  L134        LiptonReduction]: Total number of compositions: 79
[2020-10-16 13:35:49,271 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow
[2020-10-16 13:35:49,311 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states.
[2020-10-16 13:35:49,314 INFO  L276                IsEmpty]: Start isEmpty. Operand 658 states.
[2020-10-16 13:35:49,320 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2020-10-16 13:35:49,321 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:49,321 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2020-10-16 13:35:49,322 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:49,327 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:49,328 INFO  L82        PathProgramCache]: Analyzing trace with hash 914642709, now seen corresponding path program 1 times
[2020-10-16 13:35:49,353 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:49,354 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523200187]
[2020-10-16 13:35:49,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:49,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:49,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:49,575 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523200187]
[2020-10-16 13:35:49,576 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:49,577 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:35:49,580 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778341987]
[2020-10-16 13:35:49,581 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:49,584 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:49,599 INFO  L258    McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions.
[2020-10-16 13:35:49,599 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:49,606 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:49,607 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:35:49,609 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:49,621 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:35:49,622 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:49,624 INFO  L87              Difference]: Start difference. First operand 658 states. Second operand 3 states.
[2020-10-16 13:35:49,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:49,698 INFO  L93              Difference]: Finished difference Result 550 states and 1693 transitions.
[2020-10-16 13:35:49,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:35:49,701 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 5
[2020-10-16 13:35:49,701 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:49,719 INFO  L225             Difference]: With dead ends: 550
[2020-10-16 13:35:49,719 INFO  L226             Difference]: Without dead ends: 450
[2020-10-16 13:35:49,721 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:49,740 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2020-10-16 13:35:49,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2020-10-16 13:35:49,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2020-10-16 13:35:49,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2020-10-16 13:35:49,821 INFO  L78                 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5
[2020-10-16 13:35:49,822 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:49,822 INFO  L481      AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2020-10-16 13:35:49,822 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:35:49,822 INFO  L276                IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2020-10-16 13:35:49,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2020-10-16 13:35:49,824 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:49,824 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:49,824 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-16 13:35:49,825 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:49,825 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:49,825 INFO  L82        PathProgramCache]: Analyzing trace with hash 577618716, now seen corresponding path program 1 times
[2020-10-16 13:35:49,828 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:49,828 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950852103]
[2020-10-16 13:35:49,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:49,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:49,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:49,916 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950852103]
[2020-10-16 13:35:49,917 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:49,917 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:35:49,917 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1336459854]
[2020-10-16 13:35:49,918 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:49,919 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:49,921 INFO  L258    McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions.
[2020-10-16 13:35:49,921 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:49,921 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:49,923 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:35:49,923 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:49,923 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:35:49,924 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:49,924 INFO  L87              Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states.
[2020-10-16 13:35:49,936 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:49,936 INFO  L93              Difference]: Finished difference Result 430 states and 1287 transitions.
[2020-10-16 13:35:49,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:35:49,937 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2020-10-16 13:35:49,937 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:49,942 INFO  L225             Difference]: With dead ends: 430
[2020-10-16 13:35:49,942 INFO  L226             Difference]: Without dead ends: 430
[2020-10-16 13:35:49,943 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:49,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 430 states.
[2020-10-16 13:35:49,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430.
[2020-10-16 13:35:49,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 430 states.
[2020-10-16 13:35:50,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1287 transitions.
[2020-10-16 13:35:50,011 INFO  L78                 Accepts]: Start accepts. Automaton has 430 states and 1287 transitions. Word has length 9
[2020-10-16 13:35:50,012 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,012 INFO  L481      AbstractCegarLoop]: Abstraction has 430 states and 1287 transitions.
[2020-10-16 13:35:50,013 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:35:50,013 INFO  L276                IsEmpty]: Start isEmpty. Operand 430 states and 1287 transitions.
[2020-10-16 13:35:50,014 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-10-16 13:35:50,015 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,015 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,015 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-10-16 13:35:50,015 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,016 INFO  L82        PathProgramCache]: Analyzing trace with hash 726263662, now seen corresponding path program 1 times
[2020-10-16 13:35:50,017 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,018 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473407916]
[2020-10-16 13:35:50,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,047 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,090 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473407916]
[2020-10-16 13:35:50,091 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,091 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:35:50,091 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305661319]
[2020-10-16 13:35:50,091 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,093 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,096 INFO  L258    McrAutomatonBuilder]: Finished intersection with 13 states and 14 transitions.
[2020-10-16 13:35:50,096 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,118 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:50,118 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:35:50,118 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,119 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:35:50,119 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:35:50,119 INFO  L87              Difference]: Start difference. First operand 430 states and 1287 transitions. Second operand 4 states.
[2020-10-16 13:35:50,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,155 INFO  L93              Difference]: Finished difference Result 638 states and 1887 transitions.
[2020-10-16 13:35:50,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 13:35:50,156 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2020-10-16 13:35:50,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,159 INFO  L225             Difference]: With dead ends: 638
[2020-10-16 13:35:50,160 INFO  L226             Difference]: Without dead ends: 398
[2020-10-16 13:35:50,160 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:35:50,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 398 states.
[2020-10-16 13:35:50,176 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398.
[2020-10-16 13:35:50,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 398 states.
[2020-10-16 13:35:50,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1169 transitions.
[2020-10-16 13:35:50,180 INFO  L78                 Accepts]: Start accepts. Automaton has 398 states and 1169 transitions. Word has length 10
[2020-10-16 13:35:50,180 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,180 INFO  L481      AbstractCegarLoop]: Abstraction has 398 states and 1169 transitions.
[2020-10-16 13:35:50,180 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:35:50,180 INFO  L276                IsEmpty]: Start isEmpty. Operand 398 states and 1169 transitions.
[2020-10-16 13:35:50,182 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-10-16 13:35:50,182 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,183 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,183 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-16 13:35:50,183 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,183 INFO  L82        PathProgramCache]: Analyzing trace with hash -1491369423, now seen corresponding path program 1 times
[2020-10-16 13:35:50,185 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,185 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159529519]
[2020-10-16 13:35:50,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,299 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159529519]
[2020-10-16 13:35:50,300 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,300 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:35:50,300 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760328337]
[2020-10-16 13:35:50,300 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,302 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,305 INFO  L258    McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions.
[2020-10-16 13:35:50,305 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,336 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:50,337 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:35:50,337 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,337 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:35:50,338 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:35:50,338 INFO  L87              Difference]: Start difference. First operand 398 states and 1169 transitions. Second operand 4 states.
[2020-10-16 13:35:50,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,372 INFO  L93              Difference]: Finished difference Result 743 states and 2137 transitions.
[2020-10-16 13:35:50,373 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-10-16 13:35:50,373 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-10-16 13:35:50,373 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,376 INFO  L225             Difference]: With dead ends: 743
[2020-10-16 13:35:50,377 INFO  L226             Difference]: Without dead ends: 410
[2020-10-16 13:35:50,377 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:35:50,379 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 410 states.
[2020-10-16 13:35:50,388 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 302.
[2020-10-16 13:35:50,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 302 states.
[2020-10-16 13:35:50,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 832 transitions.
[2020-10-16 13:35:50,390 INFO  L78                 Accepts]: Start accepts. Automaton has 302 states and 832 transitions. Word has length 11
[2020-10-16 13:35:50,390 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,390 INFO  L481      AbstractCegarLoop]: Abstraction has 302 states and 832 transitions.
[2020-10-16 13:35:50,391 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:35:50,391 INFO  L276                IsEmpty]: Start isEmpty. Operand 302 states and 832 transitions.
[2020-10-16 13:35:50,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-10-16 13:35:50,392 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,393 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,393 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-10-16 13:35:50,393 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,393 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,393 INFO  L82        PathProgramCache]: Analyzing trace with hash -1776505378, now seen corresponding path program 1 times
[2020-10-16 13:35:50,396 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,396 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949965463]
[2020-10-16 13:35:50,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,444 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949965463]
[2020-10-16 13:35:50,444 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,444 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-10-16 13:35:50,445 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021811622]
[2020-10-16 13:35:50,445 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,447 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,450 INFO  L258    McrAutomatonBuilder]: Finished intersection with 22 states and 30 transitions.
[2020-10-16 13:35:50,451 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,466 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:50,467 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:35:50,467 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,467 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:35:50,468 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:50,468 INFO  L87              Difference]: Start difference. First operand 302 states and 832 transitions. Second operand 3 states.
[2020-10-16 13:35:50,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,484 INFO  L93              Difference]: Finished difference Result 398 states and 1088 transitions.
[2020-10-16 13:35:50,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:35:50,485 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 12
[2020-10-16 13:35:50,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,487 INFO  L225             Difference]: With dead ends: 398
[2020-10-16 13:35:50,487 INFO  L226             Difference]: Without dead ends: 209
[2020-10-16 13:35:50,488 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:50,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2020-10-16 13:35:50,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2020-10-16 13:35:50,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 209 states.
[2020-10-16 13:35:50,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 572 transitions.
[2020-10-16 13:35:50,496 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 572 transitions. Word has length 12
[2020-10-16 13:35:50,497 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,497 INFO  L481      AbstractCegarLoop]: Abstraction has 209 states and 572 transitions.
[2020-10-16 13:35:50,499 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:35:50,499 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 572 transitions.
[2020-10-16 13:35:50,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-10-16 13:35:50,501 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,501 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,502 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-16 13:35:50,502 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,502 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,502 INFO  L82        PathProgramCache]: Analyzing trace with hash 762867507, now seen corresponding path program 1 times
[2020-10-16 13:35:50,503 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,504 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120669605]
[2020-10-16 13:35:50,504 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,553 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120669605]
[2020-10-16 13:35:50,553 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,553 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2020-10-16 13:35:50,553 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081745179]
[2020-10-16 13:35:50,553 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,555 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,562 INFO  L258    McrAutomatonBuilder]: Finished intersection with 36 states and 59 transitions.
[2020-10-16 13:35:50,562 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,618 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:50,619 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-10-16 13:35:50,619 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,619 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-10-16 13:35:50,619 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:50,619 INFO  L87              Difference]: Start difference. First operand 209 states and 572 transitions. Second operand 3 states.
[2020-10-16 13:35:50,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,626 INFO  L93              Difference]: Finished difference Result 200 states and 542 transitions.
[2020-10-16 13:35:50,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-10-16 13:35:50,626 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 13
[2020-10-16 13:35:50,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,628 INFO  L225             Difference]: With dead ends: 200
[2020-10-16 13:35:50,628 INFO  L226             Difference]: Without dead ends: 200
[2020-10-16 13:35:50,628 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-10-16 13:35:50,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2020-10-16 13:35:50,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200.
[2020-10-16 13:35:50,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 200 states.
[2020-10-16 13:35:50,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 542 transitions.
[2020-10-16 13:35:50,636 INFO  L78                 Accepts]: Start accepts. Automaton has 200 states and 542 transitions. Word has length 13
[2020-10-16 13:35:50,636 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,636 INFO  L481      AbstractCegarLoop]: Abstraction has 200 states and 542 transitions.
[2020-10-16 13:35:50,636 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-10-16 13:35:50,636 INFO  L276                IsEmpty]: Start isEmpty. Operand 200 states and 542 transitions.
[2020-10-16 13:35:50,637 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 13:35:50,637 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,637 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,637 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-10-16 13:35:50,637 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,638 INFO  L82        PathProgramCache]: Analyzing trace with hash -2120975707, now seen corresponding path program 1 times
[2020-10-16 13:35:50,639 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,639 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964088229]
[2020-10-16 13:35:50,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,673 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964088229]
[2020-10-16 13:35:50,674 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,674 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:35:50,674 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [173030030]
[2020-10-16 13:35:50,674 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,676 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,683 INFO  L258    McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions.
[2020-10-16 13:35:50,684 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,694 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: []
[2020-10-16 13:35:50,695 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-10-16 13:35:50,695 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,695 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-10-16 13:35:50,695 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-10-16 13:35:50,696 INFO  L87              Difference]: Start difference. First operand 200 states and 542 transitions. Second operand 4 states.
[2020-10-16 13:35:50,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,716 INFO  L93              Difference]: Finished difference Result 281 states and 758 transitions.
[2020-10-16 13:35:50,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-10-16 13:35:50,716 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-10-16 13:35:50,717 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,718 INFO  L225             Difference]: With dead ends: 281
[2020-10-16 13:35:50,718 INFO  L226             Difference]: Without dead ends: 173
[2020-10-16 13:35:50,719 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:35:50,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2020-10-16 13:35:50,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173.
[2020-10-16 13:35:50,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 173 states.
[2020-10-16 13:35:50,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 452 transitions.
[2020-10-16 13:35:50,725 INFO  L78                 Accepts]: Start accepts. Automaton has 173 states and 452 transitions. Word has length 14
[2020-10-16 13:35:50,726 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,726 INFO  L481      AbstractCegarLoop]: Abstraction has 173 states and 452 transitions.
[2020-10-16 13:35:50,726 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-10-16 13:35:50,726 INFO  L276                IsEmpty]: Start isEmpty. Operand 173 states and 452 transitions.
[2020-10-16 13:35:50,727 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-10-16 13:35:50,727 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,727 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:50,727 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-10-16 13:35:50,727 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,728 INFO  L82        PathProgramCache]: Analyzing trace with hash -2121696457, now seen corresponding path program 2 times
[2020-10-16 13:35:50,729 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,729 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900649272]
[2020-10-16 13:35:50,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:50,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:50,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:50,805 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900649272]
[2020-10-16 13:35:50,805 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:50,805 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-10-16 13:35:50,805 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142366364]
[2020-10-16 13:35:50,806 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:50,807 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:50,815 INFO  L258    McrAutomatonBuilder]: Finished intersection with 39 states and 64 transitions.
[2020-10-16 13:35:50,816 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:50,834 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:50,873 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:50,887 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:50,917 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:50,925 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:50,929 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9019#(not (= 3 ~__unbuffered_cnt~0))]
[2020-10-16 13:35:50,929 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-10-16 13:35:50,929 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:50,930 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-10-16 13:35:50,930 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-10-16 13:35:50,930 INFO  L87              Difference]: Start difference. First operand 173 states and 452 transitions. Second operand 5 states.
[2020-10-16 13:35:50,985 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:50,985 INFO  L93              Difference]: Finished difference Result 125 states and 275 transitions.
[2020-10-16 13:35:50,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:35:50,986 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2020-10-16 13:35:50,986 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:50,987 INFO  L225             Difference]: With dead ends: 125
[2020-10-16 13:35:50,987 INFO  L226             Difference]: Without dead ends: 81
[2020-10-16 13:35:50,988 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:35:50,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2020-10-16 13:35:50,990 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2020-10-16 13:35:50,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2020-10-16 13:35:50,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 152 transitions.
[2020-10-16 13:35:50,991 INFO  L78                 Accepts]: Start accepts. Automaton has 81 states and 152 transitions. Word has length 14
[2020-10-16 13:35:50,991 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:50,991 INFO  L481      AbstractCegarLoop]: Abstraction has 81 states and 152 transitions.
[2020-10-16 13:35:50,991 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-10-16 13:35:50,991 INFO  L276                IsEmpty]: Start isEmpty. Operand 81 states and 152 transitions.
[2020-10-16 13:35:50,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2020-10-16 13:35:50,992 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:50,992 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-16 13:35:50,992 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-10-16 13:35:50,992 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:50,993 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:50,993 INFO  L82        PathProgramCache]: Analyzing trace with hash -2141011581, now seen corresponding path program 1 times
[2020-10-16 13:35:50,994 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:50,994 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622357262]
[2020-10-16 13:35:50,994 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:51,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:51,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:51,121 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622357262]
[2020-10-16 13:35:51,121 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:51,121 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:35:51,122 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574067427]
[2020-10-16 13:35:51,122 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:51,127 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:51,137 INFO  L258    McrAutomatonBuilder]: Finished intersection with 47 states and 76 transitions.
[2020-10-16 13:35:51,137 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:51,155 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,347 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9317#(<= ~__unbuffered_cnt~0 0)]
[2020-10-16 13:35:51,348 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-10-16 13:35:51,348 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:51,348 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-10-16 13:35:51,349 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-10-16 13:35:51,349 INFO  L87              Difference]: Start difference. First operand 81 states and 152 transitions. Second operand 7 states.
[2020-10-16 13:35:51,405 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:51,405 INFO  L93              Difference]: Finished difference Result 69 states and 126 transitions.
[2020-10-16 13:35:51,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:35:51,406 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 18
[2020-10-16 13:35:51,406 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:51,407 INFO  L225             Difference]: With dead ends: 69
[2020-10-16 13:35:51,407 INFO  L226             Difference]: Without dead ends: 61
[2020-10-16 13:35:51,407 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2020-10-16 13:35:51,408 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2020-10-16 13:35:51,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61.
[2020-10-16 13:35:51,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2020-10-16 13:35:51,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions.
[2020-10-16 13:35:51,410 INFO  L78                 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 18
[2020-10-16 13:35:51,410 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:51,410 INFO  L481      AbstractCegarLoop]: Abstraction has 61 states and 112 transitions.
[2020-10-16 13:35:51,411 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-10-16 13:35:51,411 INFO  L276                IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions.
[2020-10-16 13:35:51,411 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:35:51,411 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:51,411 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:51,412 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-10-16 13:35:51,412 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:51,412 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:51,412 INFO  L82        PathProgramCache]: Analyzing trace with hash -280198634, now seen corresponding path program 1 times
[2020-10-16 13:35:51,413 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:51,414 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607540113]
[2020-10-16 13:35:51,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:51,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-16 13:35:51,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-16 13:35:51,597 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607540113]
[2020-10-16 13:35:51,598 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-16 13:35:51,598 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-10-16 13:35:51,598 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035084786]
[2020-10-16 13:35:51,598 INFO  L200    McrAutomatonBuilder]: Constructing automaton for MCR equivalence class.
[2020-10-16 13:35:51,603 INFO  L255    McrAutomatonBuilder]: Started intersection.
[2020-10-16 13:35:51,634 INFO  L258    McrAutomatonBuilder]: Finished intersection with 49 states and 78 transitions.
[2020-10-16 13:35:51,635 INFO  L282    McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider
[2020-10-16 13:35:51,707 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term
[2020-10-16 13:35:51,708 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,709 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,709 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,710 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,710 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,712 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,712 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,713 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,714 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,715 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,715 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,717 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,717 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,718 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,719 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,720 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term
[2020-10-16 13:35:51,720 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,723 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,726 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,735 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,752 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,777 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,857 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:35:51,858 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,859 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 13:35:51,859 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,861 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:51,861 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,863 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:51,863 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,864 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,866 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,869 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,874 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,876 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,881 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,883 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,884 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,885 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,894 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,901 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,908 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,909 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,913 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,917 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,933 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:51,942 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,943 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,947 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,948 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,954 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,956 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,962 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,965 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:51,970 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:51,971 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,992 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term
[2020-10-16 13:35:51,993 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,993 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term
[2020-10-16 13:35:51,993 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:51,999 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:35:51,999 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,001 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,001 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,003 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,003 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,018 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,019 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,020 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,026 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,028 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,032 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,033 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,037 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,050 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,051 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,052 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,058 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,068 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,071 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,072 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,208 WARN  L193               SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22
[2020-10-16 13:35:52,222 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 2, 1] term
[2020-10-16 13:35:52,222 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,222 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 2, 1] term
[2020-10-16 13:35:52,223 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,226 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:35:52,226 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,227 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,228 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,229 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,230 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,232 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,233 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,236 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,237 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,243 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,248 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,251 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,252 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,258 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,259 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,260 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,264 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,265 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,271 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,276 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,278 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,280 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,284 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,285 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,287 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,288 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,297 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,297 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,319 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,319 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,320 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term
[2020-10-16 13:35:52,320 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,322 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,322 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,323 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,324 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,325 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,325 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,335 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,336 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,336 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,342 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,343 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,347 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,350 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,353 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,354 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,355 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,360 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,366 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,366 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,369 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,378 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,380 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,381 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,387 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,388 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,393 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,394 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,430 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term
[2020-10-16 13:35:52,430 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,431 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term
[2020-10-16 13:35:52,431 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,433 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,434 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,435 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,435 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,437 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,438 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,447 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,449 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,450 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,456 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,497 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,506 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,510 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,513 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,514 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,515 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,520 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,526 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,527 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,528 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,528 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,533 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,536 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,541 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,544 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,544 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,569 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term
[2020-10-16 13:35:52,570 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,570 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term
[2020-10-16 13:35:52,570 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,572 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,572 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,574 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,574 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,575 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,576 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,580 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,580 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,581 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,587 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,588 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,592 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,596 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,598 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,599 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,600 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,605 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,616 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,617 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,617 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,622 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,623 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts
[2020-10-16 13:35:52,624 INFO  L603       QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,625 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,632 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,635 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,638 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,641 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,645 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,646 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,670 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,670 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,671 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term
[2020-10-16 13:35:52,671 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,674 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term
[2020-10-16 13:35:52,675 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,676 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term
[2020-10-16 13:35:52,676 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,677 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,677 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts
[2020-10-16 13:35:52,680 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,688 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,689 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,690 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,695 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,696 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts
[2020-10-16 13:35:52,701 INFO  L375       QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term
[2020-10-16 13:35:52,701 INFO  L603       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-10-16 13:35:52,744 INFO  L313    McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [9518#(and (= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (not (= 0 ~x$w_buff0~0)) (not (= (mod ~x$w_buff0_used~0 256) 0))), 9519#(or (and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))]
[2020-10-16 13:35:52,745 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-10-16 13:35:52,745 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-16 13:35:52,745 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-10-16 13:35:52,746 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2020-10-16 13:35:52,746 INFO  L87              Difference]: Start difference. First operand 61 states and 112 transitions. Second operand 9 states.
[2020-10-16 13:35:52,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-16 13:35:52,889 INFO  L93              Difference]: Finished difference Result 75 states and 134 transitions.
[2020-10-16 13:35:52,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-10-16 13:35:52,890 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-10-16 13:35:52,890 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-16 13:35:52,891 INFO  L225             Difference]: With dead ends: 75
[2020-10-16 13:35:52,891 INFO  L226             Difference]: Without dead ends: 41
[2020-10-16 13:35:52,891 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156
[2020-10-16 13:35:52,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-10-16 13:35:52,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-10-16 13:35:52,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-10-16 13:35:52,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions.
[2020-10-16 13:35:52,893 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20
[2020-10-16 13:35:52,894 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-16 13:35:52,894 INFO  L481      AbstractCegarLoop]: Abstraction has 41 states and 64 transitions.
[2020-10-16 13:35:52,894 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-10-16 13:35:52,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions.
[2020-10-16 13:35:52,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-10-16 13:35:52,895 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-16 13:35:52,895 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-16 13:35:52,895 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-10-16 13:35:52,895 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-16 13:35:52,895 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-16 13:35:52,895 INFO  L82        PathProgramCache]: Analyzing trace with hash -1827958826, now seen corresponding path program 2 times
[2020-10-16 13:35:52,897 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-16 13:35:52,897 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426957504]
[2020-10-16 13:35:52,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-16 13:35:52,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:35:52,949 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:35:52,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-16 13:35:52,997 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-16 13:35:53,042 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-16 13:35:53,043 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-16 13:35:53,043 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-10-16 13:35:53,044 WARN  L264   etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available.
[2020-10-16 13:35:53,066 WARN  L124   codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L3-->L836: Formula: (let ((.cse7 (= (mod ~x$r_buff0_thd0~0_In-321282578 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In-321282578 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-321282578 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-321282578 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff1_used~0_Out-321282578 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_In-321282578 ~x$w_buff1_used~0_Out-321282578))) (or (and .cse3 (= ~x$w_buff0_used~0_Out-321282578 0) .cse4) (and (= ~x$w_buff0_used~0_In-321282578 ~x$w_buff0_used~0_Out-321282578) .cse5)) (or (and (or (and .cse2 (= ~x~0_In-321282578 ~x~0_Out-321282578)) (and .cse0 (= ~x$w_buff1~0_In-321282578 ~x~0_Out-321282578) .cse1)) .cse5) (and (= ~x$w_buff0~0_In-321282578 ~x~0_Out-321282578) .cse3 .cse4)) (= ~x$r_buff0_thd0~0_Out-321282578 ~x$r_buff0_thd0~0_In-321282578) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-321282578 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-321282578|) (= ~x$r_buff1_thd0~0_Out-321282578 ~x$r_buff1_thd0~0_In-321282578) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-321282578 0)))))  InVars {~x$w_buff0~0=~x$w_buff0~0_In-321282578, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-321282578, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-321282578|, ~x$w_buff1~0=~x$w_buff1~0_In-321282578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-321282578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-321282578, ~x~0=~x~0_In-321282578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-321282578}  OutVars{~x$w_buff0~0=~x$w_buff0~0_In-321282578, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-321282578, ~x$w_buff1~0=~x$w_buff1~0_In-321282578, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-321282578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-321282578, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-321282578|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-321282578|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-321282578|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-321282578, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-321282578|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-321282578|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-321282578|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-321282578|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-321282578, ~x~0=~x~0_Out-321282578}  AuxVars[]  AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ~x~0, ULTIMATE.start_main_#t~ite45, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite44] because there is no mapped edge
[2020-10-16 13:35:53,074 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,075 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,079 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,079 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,079 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,080 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,081 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,081 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,081 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,081 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,081 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,082 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,082 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,082 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,083 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,083 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,083 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,083 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,084 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,084 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,084 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,084 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,085 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,085 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,085 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,085 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,085 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,085 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,086 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,086 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,086 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,086 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,086 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,086 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,086 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,087 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,091 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,091 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,091 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,091 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,091 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,092 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,092 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,092 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,092 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,092 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,092 WARN  L219     RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented.
[2020-10-16 13:35:53,092 ERROR L222     RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location
[2020-10-16 13:35:53,178 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:35:53 BasicIcfg
[2020-10-16 13:35:53,178 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-16 13:35:53,180 INFO  L168              Benchmark]: Toolchain (without parser) took 9849.44 ms. Allocated memory was 137.9 MB in the beginning and 353.9 MB in the end (delta: 216.0 MB). Free memory was 99.5 MB in the beginning and 194.2 MB in the end (delta: -94.7 MB). Peak memory consumption was 121.3 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,181 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,181 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 880.41 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,182 INFO  L168              Benchmark]: Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,183 INFO  L168              Benchmark]: Boogie Preprocessor took 38.00 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 147.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,184 INFO  L168              Benchmark]: RCFGBuilder took 2092.09 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 147.2 MB in the beginning and 200.3 MB in the end (delta: -53.1 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,184 INFO  L168              Benchmark]: TraceAbstraction took 6763.85 ms. Allocated memory was 252.7 MB in the beginning and 353.9 MB in the end (delta: 101.2 MB). Free memory was 198.3 MB in the beginning and 194.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB.
[2020-10-16 13:35:53,188 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 880.41 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.3 MB in the beginning and 152.2 MB in the end (delta: -52.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 200.8 MB. Free memory was 152.2 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 38.00 ms. Allocated memory is still 200.8 MB. Free memory was 149.3 MB in the beginning and 147.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 2092.09 ms. Allocated memory was 200.8 MB in the beginning and 252.7 MB in the end (delta: 51.9 MB). Free memory was 147.2 MB in the beginning and 200.3 MB in the end (delta: -53.1 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 6763.85 ms. Allocated memory was 252.7 MB in the beginning and 353.9 MB in the end (delta: 101.2 MB). Free memory was 198.3 MB in the beginning and 194.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 105.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    789 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.6s, 100 PlacesBefore, 35 PlacesAfterwards, 92 TransitionsBefore, 25 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4006 MoverChecksTotal
  - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L699]               0  int __unbuffered_cnt = 0;
[L701]               0  int __unbuffered_p0_EAX = 0;
[L703]               0  int __unbuffered_p2_EAX = 0;
[L705]               0  int __unbuffered_p2_EBX = 0;
[L706]               0  _Bool main$tmp_guard0;
[L707]               0  _Bool main$tmp_guard1;
[L709]               0  int x = 0;
[L710]               0  _Bool x$flush_delayed;
[L711]               0  int x$mem_tmp;
[L712]               0  _Bool x$r_buff0_thd0;
[L713]               0  _Bool x$r_buff0_thd1;
[L714]               0  _Bool x$r_buff0_thd2;
[L715]               0  _Bool x$r_buff0_thd3;
[L716]               0  _Bool x$r_buff1_thd0;
[L717]               0  _Bool x$r_buff1_thd1;
[L718]               0  _Bool x$r_buff1_thd2;
[L719]               0  _Bool x$r_buff1_thd3;
[L720]               0  _Bool x$read_delayed;
[L721]               0  int *x$read_delayed_var;
[L722]               0  int x$w_buff0;
[L723]               0  _Bool x$w_buff0_used;
[L724]               0  int x$w_buff1;
[L725]               0  _Bool x$w_buff1_used;
[L727]               0  int y = 0;
[L728]               0  _Bool weak$$choice0;
[L729]               0  _Bool weak$$choice2;
[L820]               0  pthread_t t1906;
[L821]  FCALL, FORK  0  pthread_create(&t1906, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L822]               0  pthread_t t1907;
[L823]  FCALL, FORK  0  pthread_create(&t1907, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L763]               2  x$w_buff1 = x$w_buff0
[L764]               2  x$w_buff0 = 1
[L765]               2  x$w_buff1_used = x$w_buff0_used
[L766]               2  x$w_buff0_used = (_Bool)1
[L8]    COND FALSE   2  !(!expression)
[L768]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L769]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L770]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L771]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L772]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L775]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L824]               0  pthread_t t1908;
[L825]  FCALL, FORK  0  pthread_create(&t1908, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L792]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L795]               3  __unbuffered_p2_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L733]               1  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L798]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L799]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L799]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L800]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L800]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L801]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L801]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L802]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L802]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L805]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L807]               3  return 0;
[L738]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L739]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L740]               1  x$flush_delayed = weak$$choice2
[L741]               1  x$mem_tmp = x
[L742]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1
[L742]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L742]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L743]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L743]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L744]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L744]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1
[L744]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L744]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L744]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L745]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L745]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L746]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L746]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L747]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L747]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L748]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L748]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L748]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L749]               1  __unbuffered_p0_EAX = x
[L750]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L750]               1  x = x$flush_delayed ? x$mem_tmp : x
[L751]               1  x$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2]
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L778]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L779]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L780]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L781]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L781]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L782]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L782]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L785]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L787]               2  return 0;
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L758]               1  return 0;
[L827]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L838]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L8]    COND TRUE    0  !expression
[L8]                 0  __VERIFIER_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 240 SDtfs, 200 SDslu, 335 SDs, 0 SdLazy, 154 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 108 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 7737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...