/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-New_States.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.0-60729f1
[2020-11-12 11:33:11,495 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-11-12 11:33:11,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-12 11:33:11,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-12 11:33:11,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-12 11:33:11,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-12 11:33:11,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-12 11:33:11,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-12 11:33:11,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-12 11:33:11,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-12 11:33:11,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-11-12 11:33:11,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-12 11:33:11,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-12 11:33:11,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-12 11:33:11,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-12 11:33:11,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-12 11:33:11,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-12 11:33:11,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-12 11:33:11,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-12 11:33:11,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-12 11:33:11,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-12 11:33:11,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-12 11:33:11,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-11-12 11:33:11,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-12 11:33:11,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-12 11:33:11,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-12 11:33:11,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-12 11:33:11,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-12 11:33:11,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-12 11:33:11,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-12 11:33:11,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-12 11:33:11,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-12 11:33:11,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-12 11:33:11,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-12 11:33:11,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-12 11:33:11,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-12 11:33:11,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-12 11:33:11,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-12 11:33:11,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-12 11:33:11,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-12 11:33:11,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-11-12 11:33:11,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-New_States.epf
[2020-11-12 11:33:11,717 INFO L113 SettingsManager]: Loading preferences was successful
[2020-11-12 11:33:11,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-12 11:33:11,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-11-12 11:33:11,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-11-12 11:33:11,723 INFO L138 SettingsManager]: * Use SBE=true
[2020-11-12 11:33:11,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-12 11:33:11,724 INFO L138 SettingsManager]: * sizeof long=4
[2020-11-12 11:33:11,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-11-12 11:33:11,724 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-11-12 11:33:11,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-11-12 11:33:11,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-11-12 11:33:11,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-12 11:33:11,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-11-12 11:33:11,727 INFO L138 SettingsManager]: * sizeof long double=12
[2020-11-12 11:33:11,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-11-12 11:33:11,728 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-11-12 11:33:11,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-11-12 11:33:11,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-12 11:33:11,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-11-12 11:33:11,729 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-11-12 11:33:11,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-11-12 11:33:11,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-12 11:33:11,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-12 11:33:11,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-11-12 11:33:11,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-11-12 11:33:11,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-11-12 11:33:11,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-11-12 11:33:11,731 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2020-11-12 11:33:11,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-12 11:33:11,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-11-12 11:33:11,732 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=NEW_STATES
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2020-11-12 11:33:12,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-12 11:33:12,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-12 11:33:12,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-12 11:33:12,221 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-11-12 11:33:12,222 INFO L275 PluginConnector]: CDTParser initialized
[2020-11-12 11:33:12,223 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i
[2020-11-12 11:33:12,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e2e0d5/d7e386e9370f475f879c0d15dc393d81/FLAGeb95109d1
[2020-11-12 11:33:12,980 INFO L306 CDTParser]: Found 1 translation units.
[2020-11-12 11:33:12,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i
[2020-11-12 11:33:13,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e2e0d5/d7e386e9370f475f879c0d15dc393d81/FLAGeb95109d1
[2020-11-12 11:33:13,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16e2e0d5/d7e386e9370f475f879c0d15dc393d81
[2020-11-12 11:33:13,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-12 11:33:13,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2020-11-12 11:33:13,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-12 11:33:13,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-12 11:33:13,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-12 11:33:13,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:33:13" (1/1) ...
[2020-11-12 11:33:13,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c353b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:13, skipping insertion in model container
[2020-11-12 11:33:13,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:33:13" (1/1) ...
[2020-11-12 11:33:13,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-11-12 11:33:13,404 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-11-12 11:33:13,909 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-12 11:33:13,921 INFO L203 MainTranslator]: Completed pre-run
[2020-11-12 11:33:14,001 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-12 11:33:14,123 INFO L208 MainTranslator]: Completed translation
[2020-11-12 11:33:14,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14 WrapperNode
[2020-11-12 11:33:14,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-12 11:33:14,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-11-12 11:33:14,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-11-12 11:33:14,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2020-11-12 11:33:14,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-11-12 11:33:14,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-12 11:33:14,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-12 11:33:14,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-11-12 11:33:14,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
[2020-11-12 11:33:14,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-12 11:33:14,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-12 11:33:14,279 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-11-12 11:33:14,279 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-11-12 11:33:14,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-12 11:33:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-11-12 11:33:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-11-12 11:33:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-12 11:33:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-12 11:33:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2020-11-12 11:33:14,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2020-11-12 11:33:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2020-11-12 11:33:14,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2020-11-12 11:33:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2020-11-12 11:33:14,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2020-11-12 11:33:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2020-11-12 11:33:14,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2020-11-12 11:33:14,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-12 11:33:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-11-12 11:33:14,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-12 11:33:14,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-12 11:33:14,367 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-11-12 11:33:16,936 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-12 11:33:16,936 INFO L298 CfgBuilder]: Removed 14 assume(true) statements.
[2020-11-12 11:33:16,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:33:16 BoogieIcfgContainer
[2020-11-12 11:33:16,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-12 11:33:16,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-12 11:33:16,941 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-11-12 11:33:16,945 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-11-12 11:33:16,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:33:13" (1/3) ...
[2020-11-12 11:33:16,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d626c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:33:16, skipping insertion in model container
[2020-11-12 11:33:16,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:33:14" (2/3) ...
[2020-11-12 11:33:16,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d626c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:33:16, skipping insertion in model container
[2020-11-12 11:33:16,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:33:16" (3/3) ...
[2020-11-12 11:33:16,949 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_tso.opt.i
[2020-11-12 11:33:16,966 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-11-12 11:33:16,967 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-11-12 11:33:16,971 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-11-12 11:33:16,972 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-11-12 11:33:17,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,014 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,014 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,015 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,015 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,016 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,035 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,035 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,036 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,036 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,036 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,037 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,037 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,039 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,040 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,041 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,042 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,051 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,052 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,052 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,052 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,052 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,052 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,053 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,061 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,062 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,065 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,071 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,072 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-11-12 11:33:17,085 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-11-12 11:33:17,099 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2020-11-12 11:33:17,123 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-11-12 11:33:17,123 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-11-12 11:33:17,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-11-12 11:33:17,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-11-12 11:33:17,124 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-12 11:33:17,124 INFO L382 AbstractCegarLoop]: Difference is false
[2020-11-12 11:33:17,124 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-12 11:33:17,124 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-12 11:33:17,139 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 121 transitions, 262 flow
[2020-11-12 11:34:05,678 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 142955 states, 142951 states have (on average 4.556288518443383) internal successors, (651326), 142954 states have internal predecessors, (651326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:05,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2020-11-12 11:34:05,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:06,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2020-11-12 11:34:06,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:06,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:06,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:06,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:06,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:06,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:06,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:06,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:06,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:06,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:06,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:06,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:07,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:07,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:07,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:07,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:07,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:07,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:07,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:07,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:07,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:07,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:07,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:07,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:07,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:07,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:07,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:08,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:08,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:08,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:08,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:08,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:08,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:08,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:08,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:08,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:08,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:08,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:08,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:08,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:08,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:08,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:08,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:08,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:08,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:08,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:09,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:09,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:09,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term
[2020-11-12 11:34:09,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:09,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:09,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:09,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:09,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2020-11-12 11:34:12,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:12,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:12,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term
[2020-11-12 11:34:12,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:12,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:12,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2020-11-12 11:34:12,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-11-12 11:34:12,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2020-11-12 11:34:12,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:12,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:12,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term
[2020-11-12 11:34:12,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2020-11-12 11:34:12,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term
[2020-11-12 11:34:12,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2020-11-12 11:34:31,607 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 25922ms
[2020-11-12 11:34:31,748 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 142955 states, 142951 states have (on average 4.556288518443383) internal successors, (651326), 142954 states have internal predecessors, (651326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:35,334 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 1353472 states, 1300244 states have (on average 2.289318004928306) internal successors, (2976672), 1353471 states have internal predecessors, (2976672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 1353472 states, 1300244 states have (on average 2.289318004928306) internal successors, (2976672), 1353471 states have internal predecessors, (2976672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2020-11-12 11:34:36,091 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:36,092 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:36,093 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1840944912, now seen corresponding path program 1 times
[2020-11-12 11:34:36,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:36,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468782454]
[2020-11-12 11:34:36,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:38,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468782454]
[2020-11-12 11:34:38,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:38,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-11-12 11:34:38,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637977040]
[2020-11-12 11:34:38,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-11-12 11:34:38,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-11-12 11:34:38,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-12 11:34:39,032 INFO L87 Difference]: Start difference. First operand has 1353472 states, 1300244 states have (on average 2.289318004928306) internal successors, (2976672), 1353471 states have internal predecessors, (2976672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:42,433 INFO L93 Difference]: Finished difference Result 312333 states and 661493 transitions.
[2020-11-12 11:34:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-11-12 11:34:42,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49
[2020-11-12 11:34:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:42,975 INFO L225 Difference]: With dead ends: 312333
[2020-11-12 11:34:42,976 INFO L226 Difference]: Without dead ends: 55981
[2020-11-12 11:34:42,978 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-11-12 11:34:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55981 states.
[2020-11-12 11:34:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55981 to 55981.
[2020-11-12 11:34:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55981 states, 55533 states have (on average 1.4217312228764878) internal successors, (78953), 55980 states have internal predecessors, (78953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55981 states to 55981 states and 78953 transitions.
[2020-11-12 11:34:45,170 INFO L78 Accepts]: Start accepts. Automaton has 55981 states and 78953 transitions. Word has length 49
[2020-11-12 11:34:45,170 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:45,170 INFO L481 AbstractCegarLoop]: Abstraction has 55981 states and 78953 transitions.
[2020-11-12 11:34:45,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 55981 states and 78953 transitions.
[2020-11-12 11:34:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2020-11-12 11:34:45,191 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:45,191 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:45,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-12 11:34:45,191 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:45,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1117153068, now seen corresponding path program 1 times
[2020-11-12 11:34:45,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:45,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15015356]
[2020-11-12 11:34:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:45,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15015356]
[2020-11-12 11:34:45,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:45,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-12 11:34:45,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186487409]
[2020-11-12 11:34:45,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-12 11:34:45,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-12 11:34:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-12 11:34:45,466 INFO L87 Difference]: Start difference. First operand 55981 states and 78953 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:46,495 INFO L93 Difference]: Finished difference Result 50614 states and 70118 transitions.
[2020-11-12 11:34:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-11-12 11:34:46,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70
[2020-11-12 11:34:46,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:46,642 INFO L225 Difference]: With dead ends: 50614
[2020-11-12 11:34:46,642 INFO L226 Difference]: Without dead ends: 46990
[2020-11-12 11:34:46,643 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-11-12 11:34:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46990 states.
[2020-11-12 11:34:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46990 to 46665.
[2020-11-12 11:34:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46665 states, 46217 states have (on average 1.4216413873682845) internal successors, (65704), 46664 states have internal predecessors, (65704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46665 states to 46665 states and 65704 transitions.
[2020-11-12 11:34:47,863 INFO L78 Accepts]: Start accepts. Automaton has 46665 states and 65704 transitions. Word has length 70
[2020-11-12 11:34:47,864 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:47,864 INFO L481 AbstractCegarLoop]: Abstraction has 46665 states and 65704 transitions.
[2020-11-12 11:34:47,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46665 states and 65704 transitions.
[2020-11-12 11:34:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2020-11-12 11:34:47,893 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:47,894 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:47,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-12 11:34:47,894 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1239419674, now seen corresponding path program 1 times
[2020-11-12 11:34:47,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:47,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914075978]
[2020-11-12 11:34:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:48,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914075978]
[2020-11-12 11:34:48,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:48,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-12 11:34:48,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230811272]
[2020-11-12 11:34:48,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-12 11:34:48,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:48,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-12 11:34:48,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-12 11:34:48,153 INFO L87 Difference]: Start difference. First operand 46665 states and 65704 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:48,344 INFO L93 Difference]: Finished difference Result 39505 states and 54551 transitions.
[2020-11-12 11:34:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-12 11:34:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2020-11-12 11:34:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:48,435 INFO L225 Difference]: With dead ends: 39505
[2020-11-12 11:34:48,436 INFO L226 Difference]: Without dead ends: 39501
[2020-11-12 11:34:48,436 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-11-12 11:34:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39501 states.
[2020-11-12 11:34:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39501 to 39501.
[2020-11-12 11:34:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39501 states, 39053 states have (on average 1.39674288787033) internal successors, (54547), 39500 states have internal predecessors, (54547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39501 states to 39501 states and 54547 transitions.
[2020-11-12 11:34:49,965 INFO L78 Accepts]: Start accepts. Automaton has 39501 states and 54547 transitions. Word has length 73
[2020-11-12 11:34:49,966 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:49,966 INFO L481 AbstractCegarLoop]: Abstraction has 39501 states and 54547 transitions.
[2020-11-12 11:34:49,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 39501 states and 54547 transitions.
[2020-11-12 11:34:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2020-11-12 11:34:50,011 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:50,011 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:50,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-12 11:34:50,012 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1966462671, now seen corresponding path program 1 times
[2020-11-12 11:34:50,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:50,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18508913]
[2020-11-12 11:34:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:50,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18508913]
[2020-11-12 11:34:50,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:50,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-12 11:34:50,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468019019]
[2020-11-12 11:34:50,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-11-12 11:34:50,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-11-12 11:34:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-11-12 11:34:50,335 INFO L87 Difference]: Start difference. First operand 39501 states and 54547 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:50,548 INFO L93 Difference]: Finished difference Result 24247 states and 32000 transitions.
[2020-11-12 11:34:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-11-12 11:34:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2020-11-12 11:34:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:50,595 INFO L225 Difference]: With dead ends: 24247
[2020-11-12 11:34:50,595 INFO L226 Difference]: Without dead ends: 22781
[2020-11-12 11:34:50,595 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110
[2020-11-12 11:34:50,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22781 states.
[2020-11-12 11:34:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22781 to 22781.
[2020-11-12 11:34:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22781 states, 22433 states have (on average 1.3510899121829447) internal successors, (30309), 22780 states have internal predecessors, (30309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22781 states to 22781 states and 30309 transitions.
[2020-11-12 11:34:51,163 INFO L78 Accepts]: Start accepts. Automaton has 22781 states and 30309 transitions. Word has length 76
[2020-11-12 11:34:51,164 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:51,164 INFO L481 AbstractCegarLoop]: Abstraction has 22781 states and 30309 transitions.
[2020-11-12 11:34:51,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 22781 states and 30309 transitions.
[2020-11-12 11:34:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2020-11-12 11:34:51,200 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:51,200 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:51,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-12 11:34:51,201 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:51,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash 780551121, now seen corresponding path program 1 times
[2020-11-12 11:34:51,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:51,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876355155]
[2020-11-12 11:34:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:51,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876355155]
[2020-11-12 11:34:51,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:51,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-12 11:34:51,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595157258]
[2020-11-12 11:34:51,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-11-12 11:34:51,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-11-12 11:34:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-11-12 11:34:51,534 INFO L87 Difference]: Start difference. First operand 22781 states and 30309 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:51,733 INFO L93 Difference]: Finished difference Result 29485 states and 37686 transitions.
[2020-11-12 11:34:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-12 11:34:51,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2020-11-12 11:34:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:51,768 INFO L225 Difference]: With dead ends: 29485
[2020-11-12 11:34:51,768 INFO L226 Difference]: Without dead ends: 20419
[2020-11-12 11:34:51,769 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2020-11-12 11:34:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20419 states.
[2020-11-12 11:34:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20419 to 19738.
[2020-11-12 11:34:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19738 states, 19390 states have (on average 1.3105724600309439) internal successors, (25412), 19737 states have internal predecessors, (25412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19738 states to 19738 states and 25412 transitions.
[2020-11-12 11:34:52,524 INFO L78 Accepts]: Start accepts. Automaton has 19738 states and 25412 transitions. Word has length 80
[2020-11-12 11:34:52,525 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:52,526 INFO L481 AbstractCegarLoop]: Abstraction has 19738 states and 25412 transitions.
[2020-11-12 11:34:52,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19738 states and 25412 transitions.
[2020-11-12 11:34:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2020-11-12 11:34:52,549 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:52,549 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:52,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-12 11:34:52,549 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1831814387, now seen corresponding path program 2 times
[2020-11-12 11:34:52,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:52,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008039853]
[2020-11-12 11:34:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:52,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008039853]
[2020-11-12 11:34:52,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:52,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-11-12 11:34:52,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710901420]
[2020-11-12 11:34:52,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-12 11:34:52,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:52,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-12 11:34:52,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-11-12 11:34:52,808 INFO L87 Difference]: Start difference. First operand 19738 states and 25412 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:53,003 INFO L93 Difference]: Finished difference Result 9858 states and 12485 transitions.
[2020-11-12 11:34:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-11-12 11:34:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2020-11-12 11:34:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:53,019 INFO L225 Difference]: With dead ends: 9858
[2020-11-12 11:34:53,019 INFO L226 Difference]: Without dead ends: 6931
[2020-11-12 11:34:53,020 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156
[2020-11-12 11:34:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6931 states.
[2020-11-12 11:34:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6931 to 6931.
[2020-11-12 11:34:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6931 states, 6778 states have (on average 1.2984656240778991) internal successors, (8801), 6930 states have internal predecessors, (8801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6931 states to 6931 states and 8801 transitions.
[2020-11-12 11:34:53,144 INFO L78 Accepts]: Start accepts. Automaton has 6931 states and 8801 transitions. Word has length 80
[2020-11-12 11:34:53,144 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:53,145 INFO L481 AbstractCegarLoop]: Abstraction has 6931 states and 8801 transitions.
[2020-11-12 11:34:53,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 6931 states and 8801 transitions.
[2020-11-12 11:34:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2020-11-12 11:34:53,162 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:53,162 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:53,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-12 11:34:53,162 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -466366667, now seen corresponding path program 1 times
[2020-11-12 11:34:53,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:53,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23351453]
[2020-11-12 11:34:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:53,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23351453]
[2020-11-12 11:34:53,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:53,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2020-11-12 11:34:53,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121494840]
[2020-11-12 11:34:53,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-11-12 11:34:53,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:53,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-11-12 11:34:53,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2020-11-12 11:34:53,461 INFO L87 Difference]: Start difference. First operand 6931 states and 8801 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:53,658 INFO L93 Difference]: Finished difference Result 3960 states and 5353 transitions.
[2020-11-12 11:34:53,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2020-11-12 11:34:53,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85
[2020-11-12 11:34:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:53,661 INFO L225 Difference]: With dead ends: 3960
[2020-11-12 11:34:53,661 INFO L226 Difference]: Without dead ends: 1349
[2020-11-12 11:34:53,661 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210
[2020-11-12 11:34:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states.
[2020-11-12 11:34:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349.
[2020-11-12 11:34:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1322 states have (on average 1.3456883509833586) internal successors, (1779), 1348 states have internal predecessors, (1779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1779 transitions.
[2020-11-12 11:34:53,683 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1779 transitions. Word has length 85
[2020-11-12 11:34:53,683 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:53,683 INFO L481 AbstractCegarLoop]: Abstraction has 1349 states and 1779 transitions.
[2020-11-12 11:34:53,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1779 transitions.
[2020-11-12 11:34:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-11-12 11:34:53,686 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:53,686 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:53,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-12 11:34:53,687 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:53,687 INFO L82 PathProgramCache]: Analyzing trace with hash 3106019, now seen corresponding path program 1 times
[2020-11-12 11:34:53,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:53,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818832134]
[2020-11-12 11:34:53,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:53,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818832134]
[2020-11-12 11:34:53,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:53,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-11-12 11:34:53,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385418308]
[2020-11-12 11:34:53,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-11-12 11:34:53,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-11-12 11:34:53,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-11-12 11:34:53,897 INFO L87 Difference]: Start difference. First operand 1349 states and 1779 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:54,007 INFO L93 Difference]: Finished difference Result 2186 states and 2891 transitions.
[2020-11-12 11:34:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-12 11:34:54,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2020-11-12 11:34:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:54,010 INFO L225 Difference]: With dead ends: 2186
[2020-11-12 11:34:54,011 INFO L226 Difference]: Without dead ends: 1177
[2020-11-12 11:34:54,011 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2020-11-12 11:34:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states.
[2020-11-12 11:34:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1177.
[2020-11-12 11:34:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1150 states have (on average 1.3060869565217392) internal successors, (1502), 1176 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1502 transitions.
[2020-11-12 11:34:54,029 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1502 transitions. Word has length 90
[2020-11-12 11:34:54,029 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:54,030 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1502 transitions.
[2020-11-12 11:34:54,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1502 transitions.
[2020-11-12 11:34:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-11-12 11:34:54,032 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:54,032 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:54,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-12 11:34:54,033 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1794074457, now seen corresponding path program 2 times
[2020-11-12 11:34:54,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:54,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453713358]
[2020-11-12 11:34:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-12 11:34:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-12 11:34:54,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453713358]
[2020-11-12 11:34:54,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-12 11:34:54,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-12 11:34:54,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725040854]
[2020-11-12 11:34:54,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-12 11:34:54,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-11-12 11:34:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-12 11:34:54,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-12 11:34:54,209 INFO L87 Difference]: Start difference. First operand 1177 states and 1502 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-12 11:34:54,301 INFO L93 Difference]: Finished difference Result 1912 states and 2462 transitions.
[2020-11-12 11:34:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-11-12 11:34:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90
[2020-11-12 11:34:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-12 11:34:54,304 INFO L225 Difference]: With dead ends: 1912
[2020-11-12 11:34:54,305 INFO L226 Difference]: Without dead ends: 1021
[2020-11-12 11:34:54,305 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-11-12 11:34:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states.
[2020-11-12 11:34:54,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021.
[2020-11-12 11:34:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 994 states have (on average 1.271629778672032) internal successors, (1264), 1020 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1264 transitions.
[2020-11-12 11:34:54,324 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1264 transitions. Word has length 90
[2020-11-12 11:34:54,324 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-12 11:34:54,324 INFO L481 AbstractCegarLoop]: Abstraction has 1021 states and 1264 transitions.
[2020-11-12 11:34:54,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2020-11-12 11:34:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1264 transitions.
[2020-11-12 11:34:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2020-11-12 11:34:54,327 INFO L486 BasicCegarLoop]: Found error trace
[2020-11-12 11:34:54,327 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-12 11:34:54,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-11-12 11:34:54,327 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-12 11:34:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-12 11:34:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash -977881245, now seen corresponding path program 3 times
[2020-11-12 11:34:54,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-11-12 11:34:54,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164891984]
[2020-11-12 11:34:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-12 11:34:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-12 11:34:54,434 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-12 11:34:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-12 11:34:54,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-12 11:34:54,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-11-12 11:34:54,621 INFO L595 BasicCegarLoop]: Counterexample might be feasible
[2020-11-12 11:34:54,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-11-12 11:34:54,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 11:34:54 BasicIcfg
[2020-11-12 11:34:54,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-12 11:34:54,878 INFO L168 Benchmark]: Toolchain (without parser) took 101586.03 ms. Allocated memory was 302.0 MB in the beginning and 14.6 GB in the end (delta: 14.3 GB). Free memory was 276.3 MB in the beginning and 10.4 GB in the end (delta: -10.1 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,878 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.91 ms. Allocated memory is still 302.0 MB. Free memory was 275.6 MB in the beginning and 269.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.48 ms. Allocated memory is still 302.0 MB. Free memory was 269.4 MB in the beginning and 266.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,880 INFO L168 Benchmark]: Boogie Preprocessor took 72.59 ms. Allocated memory is still 302.0 MB. Free memory was 266.7 MB in the beginning and 264.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,884 INFO L168 Benchmark]: RCFGBuilder took 2660.60 ms. Allocated memory was 302.0 MB in the beginning and 369.1 MB in the end (delta: 67.1 MB). Free memory was 264.0 MB in the beginning and 219.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 111.8 MB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,887 INFO L168 Benchmark]: TraceAbstraction took 97934.46 ms. Allocated memory was 369.1 MB in the beginning and 14.6 GB in the end (delta: 14.2 GB). Free memory was 218.7 MB in the beginning and 10.4 GB in the end (delta: -10.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 16.0 GB.
[2020-11-12 11:34:54,891 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 821.91 ms. Allocated memory is still 302.0 MB. Free memory was 275.6 MB in the beginning and 269.4 MB in the end (delta: 6.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 76.48 ms. Allocated memory is still 302.0 MB. Free memory was 269.4 MB in the beginning and 266.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 72.59 ms. Allocated memory is still 302.0 MB. Free memory was 266.7 MB in the beginning and 264.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 2660.60 ms. Allocated memory was 302.0 MB in the beginning and 369.1 MB in the end (delta: 67.1 MB). Free memory was 264.0 MB in the beginning and 219.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 111.8 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 97934.46 ms. Allocated memory was 369.1 MB in the beginning and 14.6 GB in the end (delta: 14.2 GB). Free memory was 218.7 MB in the beginning and 10.4 GB in the end (delta: -10.2 GB). Peak memory consumption was 4.1 GB. Max. memory is 16.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L711] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L713] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L715] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L717] 0 int __unbuffered_p3_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0]
[L719] 0 int __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L721] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L722] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0]
[L723] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L725] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L726] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L727] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L728] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L729] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L730] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L731] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L732] 0 _Bool x$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0]
[L733] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0]
[L734] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L735] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L736] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L737] 0 _Bool x$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L738] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L739] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L740] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L741] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L742] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L743] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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]
[L745] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L747] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L748] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L749] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L862] 0 pthread_t t709;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L863] FCALL, FORK 0 pthread_create(&t709, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L864] 0 pthread_t t710;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L865] FCALL, FORK 0 pthread_create(&t710, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L866] 0 pthread_t t711;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L867] FCALL, FORK 0 pthread_create(&t711, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L868] 0 pthread_t t712;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L869] FCALL, FORK 0 pthread_create(&t712, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L781] 2 x$w_buff1 = x$w_buff0
[L782] 2 x$w_buff0 = 1
[L783] 2 x$w_buff1_used = x$w_buff0_used
[L784] 2 x$w_buff0_used = (_Bool)1
[L19] COND FALSE 2 !(!expression)
[L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L791] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L794] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L811] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L814] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L817] 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)
[L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L817] 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)
[L817] 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)
[L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L819] 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
[L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L821] 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
[L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L831] 4 z = 2
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L834] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L837] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L753] 1 a = 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L756] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L757] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L758] 1 x$flush_delayed = weak$$choice2
[L759] 1 x$mem_tmp = x
[L760] 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)
[L760] 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)
[L761] 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))
[L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L761] 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))
[L761] 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))
[L762] 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))
[L762] 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)
[L762] 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))
[L762] 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))
[L763] 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))
[L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L763] 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))
[L763] 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))
[L764] 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))
[L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L764] 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))
[L764] 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))
[L765] 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))
[L765] EXPR 1 !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)
[L765] 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))
[L765] 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))
[L766] 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))
[L766] 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)
[L766] 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))
[L766] 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))
[L767] 1 __unbuffered_p0_EAX = x
[L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L768] 1 x = x$flush_delayed ? x$mem_tmp : x
[L769] 1 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L840] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L841] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L842] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L843] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L844] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L797] 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)
[L797] 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)
[L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L799] 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
[L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L801] 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
[L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L4] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L875] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L876] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L878] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L19] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L18] COND FALSE 0 !(0)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
[L18] 0 __assert_fail ("0", "mix026_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=1, z=2]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 97.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 78.2s, HoareTripleCheckerStatistics: 935 SDtfs, 1186 SDslu, 3166 SDs, 0 SdLazy, 243 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1353472occurred 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: 6.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 125332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...