/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i


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


This is Ultimate 0.2.0-aa1e80b
[2020-12-17 17:12:27,047 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-12-17 17:12:27,052 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-12-17 17:12:27,105 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-12-17 17:12:27,106 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-12-17 17:12:27,109 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-12-17 17:12:27,113 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-12-17 17:12:27,121 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-12-17 17:12:27,125 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-12-17 17:12:27,132 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-12-17 17:12:27,133 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-12-17 17:12:27,134 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-12-17 17:12:27,136 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-12-17 17:12:27,139 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-12-17 17:12:27,140 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-12-17 17:12:27,143 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-12-17 17:12:27,145 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-12-17 17:12:27,149 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-12-17 17:12:27,156 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-12-17 17:12:27,163 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-12-17 17:12:27,167 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-12-17 17:12:27,169 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-12-17 17:12:27,170 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-12-17 17:12:27,171 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-12-17 17:12:27,179 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-12-17 17:12:27,179 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-12-17 17:12:27,180 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-12-17 17:12:27,183 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-12-17 17:12:27,183 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-12-17 17:12:27,185 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-12-17 17:12:27,185 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-12-17 17:12:27,187 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-12-17 17:12:27,189 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-12-17 17:12:27,190 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-12-17 17:12:27,191 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-12-17 17:12:27,192 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-12-17 17:12:27,193 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-12-17 17:12:27,193 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-12-17 17:12:27,193 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-12-17 17:12:27,194 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-12-17 17:12:27,195 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-12-17 17:12:27,196 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.epf
[2020-12-17 17:12:27,248 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-12-17 17:12:27,248 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-12-17 17:12:27,253 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-12-17 17:12:27,254 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-12-17 17:12:27,254 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-12-17 17:12:27,254 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-12-17 17:12:27,254 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-12-17 17:12:27,255 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-12-17 17:12:27,255 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-12-17 17:12:27,256 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-12-17 17:12:27,257 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-12-17 17:12:27,257 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-12-17 17:12:27,257 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-12-17 17:12:27,257 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-12-17 17:12:27,258 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-12-17 17:12:27,258 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-12-17 17:12:27,258 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-12-17 17:12:27,258 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-12-17 17:12:27,259 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-12-17 17:12:27,259 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-12-17 17:12:27,259 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-12-17 17:12:27,259 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-12-17 17:12:27,260 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-12-17 17:12:27,260 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-12-17 17:12:27,260 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-12-17 17:12:27,260 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-12-17 17:12:27,261 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-12-17 17:12:27,261 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2020-12-17 17:12:27,261 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-12-17 17:12:27,261 INFO  L138        SettingsManager]:  * Minimization of abstraction=NONE
[2020-12-17 17:12:27,261 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
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-12-17 17:12:27,643 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-12-17 17:12:27,681 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-12-17 17:12:27,684 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-12-17 17:12:27,685 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-12-17 17:12:27,686 INFO  L275        PluginConnector]: CDTParser initialized
[2020-12-17 17:12:27,687 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i
[2020-12-17 17:12:27,765 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e0d6a8c/5b9ed5ef25834d288a2078c85056bfc1/FLAG96ab38dd4
[2020-12-17 17:12:28,506 INFO  L306              CDTParser]: Found 1 translation units.
[2020-12-17 17:12:28,507 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i
[2020-12-17 17:12:28,524 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e0d6a8c/5b9ed5ef25834d288a2078c85056bfc1/FLAG96ab38dd4
[2020-12-17 17:12:28,746 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e0d6a8c/5b9ed5ef25834d288a2078c85056bfc1
[2020-12-17 17:12:28,752 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-12-17 17:12:28,755 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2020-12-17 17:12:28,758 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-12-17 17:12:28,758 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-12-17 17:12:28,762 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-12-17 17:12:28,763 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:12:28" (1/1) ...
[2020-12-17 17:12:28,769 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:28, skipping insertion in model container
[2020-12-17 17:12:28,769 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 05:12:28" (1/1) ...
[2020-12-17 17:12:28,778 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-12-17 17:12:28,860 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-12-17 17:12:29,304 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-12-17 17:12:29,315 INFO  L203         MainTranslator]: Completed pre-run
[2020-12-17 17:12:29,395 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-12-17 17:12:29,500 INFO  L208         MainTranslator]: Completed translation
[2020-12-17 17:12:29,513 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29 WrapperNode
[2020-12-17 17:12:29,514 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-12-17 17:12:29,515 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2020-12-17 17:12:29,515 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2020-12-17 17:12:29,515 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2020-12-17 17:12:29,531 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,583 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,624 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2020-12-17 17:12:29,625 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-12-17 17:12:29,626 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-12-17 17:12:29,626 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-12-17 17:12:29,642 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,642 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,649 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,652 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,664 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,668 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,673 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (1/1) ...
[2020-12-17 17:12:29,680 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-12-17 17:12:29,681 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-12-17 17:12:29,681 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-12-17 17:12:29,681 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-12-17 17:12:29,682 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (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-12-17 17:12:29,781 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-12-17 17:12:29,782 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2020-12-17 17:12:29,782 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-12-17 17:12:29,782 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-12-17 17:12:29,783 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2020-12-17 17:12:29,784 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2020-12-17 17:12:29,784 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2020-12-17 17:12:29,785 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2020-12-17 17:12:29,785 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2020-12-17 17:12:29,785 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2020-12-17 17:12:29,786 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-12-17 17:12:29,786 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2020-12-17 17:12:29,786 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-12-17 17:12:29,786 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-12-17 17:12:29,788 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2020-12-17 17:12:32,234 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-12-17 17:12:32,234 INFO  L298             CfgBuilder]: Removed 14 assume(true) statements.
[2020-12-17 17:12:32,237 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:12:32 BoogieIcfgContainer
[2020-12-17 17:12:32,237 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-12-17 17:12:32,239 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-12-17 17:12:32,239 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-12-17 17:12:32,242 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-12-17 17:12:32,243 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 05:12:28" (1/3) ...
[2020-12-17 17:12:32,244 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a96d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:12:32, skipping insertion in model container
[2020-12-17 17:12:32,244 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 05:12:29" (2/3) ...
[2020-12-17 17:12:32,244 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a96d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 05:12:32, skipping insertion in model container
[2020-12-17 17:12:32,244 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 05:12:32" (3/3) ...
[2020-12-17 17:12:32,246 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i
[2020-12-17 17:12:32,263 WARN  L168   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2020-12-17 17:12:32,264 INFO  L179   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-12-17 17:12:32,268 INFO  L191   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2020-12-17 17:12:32,269 INFO  L351   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2020-12-17 17:12:32,305 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,305 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,306 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,307 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,308 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,308 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,308 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,309 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,310 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,310 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,310 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,311 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,311 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,311 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,312 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,312 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,312 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,312 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,312 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,313 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,313 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,313 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,313 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,313 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,314 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,314 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,314 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,314 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,314 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,315 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,316 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,316 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,316 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,316 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,316 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,317 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,317 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,317 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,317 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,317 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,318 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,318 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,318 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,318 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,319 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,320 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,320 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,320 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,321 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,321 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,321 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,321 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,322 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,322 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,322 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,322 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,322 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,323 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,323 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,323 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,323 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,323 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,324 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,324 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,324 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,325 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,326 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,326 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,326 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,327 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,329 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,329 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,330 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,330 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,330 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,330 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,331 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,331 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,331 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,331 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,334 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,334 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,334 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,334 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,335 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,336 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,336 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,336 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,336 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,341 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,342 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,342 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,342 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,342 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,343 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,343 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,343 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,343 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,343 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2020-12-17 17:12:32,345 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2020-12-17 17:12:32,359 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2020-12-17 17:12:32,384 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-12-17 17:12:32,384 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-12-17 17:12:32,384 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-12-17 17:12:32,384 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-12-17 17:12:32,384 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-12-17 17:12:32,385 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-12-17 17:12:32,385 INFO  L383      AbstractCegarLoop]: Minimize is NONE
[2020-12-17 17:12:32,385 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-12-17 17:12:32,398 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 101 transitions, 217 flow
[2020-12-17 17:12:33,885 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 17061 states, 17057 states have (on average 3.683473060913408) internal successors, (62829), 17060 states have internal predecessors, (62829), 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-12-17 17:12:33,931 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 17061 states, 17057 states have (on average 3.683473060913408) internal successors, (62829), 17060 states have internal predecessors, (62829), 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-12-17 17:12:33,941 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2020-12-17 17:12:33,941 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:33,942 INFO  L504         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]
[2020-12-17 17:12:33,943 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:33,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:33,964 INFO  L82        PathProgramCache]: Analyzing trace with hash 985243206, now seen corresponding path program 1 times
[2020-12-17 17:12:33,975 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:33,976 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949418441]
[2020-12-17 17:12:33,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:34,276 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:34,530 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:34,531 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949418441]
[2020-12-17 17:12:34,532 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:34,532 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-12-17 17:12:34,534 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077032672]
[2020-12-17 17:12:34,540 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-12-17 17:12:34,540 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:34,559 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-12-17 17:12:34,560 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-12-17 17:12:34,595 INFO  L87              Difference]: Start difference. First operand  has 17061 states, 17057 states have (on average 3.683473060913408) internal successors, (62829), 17060 states have internal predecessors, (62829), 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 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-12-17 17:12:35,015 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:35,016 INFO  L93              Difference]: Finished difference Result 14149 states and 50401 transitions.
[2020-12-17 17:12:35,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2020-12-17 17:12:35,018 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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 43
[2020-12-17 17:12:35,019 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:35,140 INFO  L225             Difference]: With dead ends: 14149
[2020-12-17 17:12:35,140 INFO  L226             Difference]: Without dead ends: 8517
[2020-12-17 17:12:35,142 INFO  L763         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-12-17 17:12:35,143 INFO  L78                 Accepts]: Start accepts. Automaton has 8517 states. Word has length 43
[2020-12-17 17:12:35,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:35,144 INFO  L481      AbstractCegarLoop]: Abstraction has 8517 states.
[2020-12-17 17:12:35,145 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 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-12-17 17:12:35,145 INFO  L276                IsEmpty]: Start isEmpty. Operand 8517 states.
[2020-12-17 17:12:35,179 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2020-12-17 17:12:35,180 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:35,180 INFO  L504         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]
[2020-12-17 17:12:35,180 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-12-17 17:12:35,182 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:35,185 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:35,185 INFO  L82        PathProgramCache]: Analyzing trace with hash -507928393, now seen corresponding path program 1 times
[2020-12-17 17:12:35,185 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:35,186 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450532561]
[2020-12-17 17:12:35,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:35,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:35,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:35,500 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450532561]
[2020-12-17 17:12:35,500 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:35,501 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 17:12:35,501 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330231351]
[2020-12-17 17:12:35,503 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 17:12:35,503 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:35,506 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 17:12:35,507 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 17:12:35,507 INFO  L87              Difference]: Start difference. First operand 8517 states. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12-17 17:12:35,916 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:35,916 INFO  L93              Difference]: Finished difference Result 9541 states and 33185 transitions.
[2020-12-17 17:12:35,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 17:12:35,917 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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 60
[2020-12-17 17:12:35,918 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:36,108 INFO  L225             Difference]: With dead ends: 9541
[2020-12-17 17:12:36,108 INFO  L226             Difference]: Without dead ends: 7493
[2020-12-17 17:12:36,109 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 17:12:36,110 INFO  L78                 Accepts]: Start accepts. Automaton has 7493 states. Word has length 60
[2020-12-17 17:12:36,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:36,112 INFO  L481      AbstractCegarLoop]: Abstraction has 7493 states.
[2020-12-17 17:12:36,113 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-12-17 17:12:36,113 INFO  L276                IsEmpty]: Start isEmpty. Operand 7493 states.
[2020-12-17 17:12:36,132 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 63
[2020-12-17 17:12:36,132 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:36,132 INFO  L504         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]
[2020-12-17 17:12:36,133 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-12-17 17:12:36,133 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:36,135 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:36,135 INFO  L82        PathProgramCache]: Analyzing trace with hash -2131194250, now seen corresponding path program 1 times
[2020-12-17 17:12:36,135 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:36,136 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581423987]
[2020-12-17 17:12:36,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:36,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:36,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:36,413 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581423987]
[2020-12-17 17:12:36,414 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:36,414 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-12-17 17:12:36,414 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867597860]
[2020-12-17 17:12:36,415 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-12-17 17:12:36,415 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:36,416 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-12-17 17:12:36,416 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-12-17 17:12:36,416 INFO  L87              Difference]: Start difference. First operand 7493 states. Second operand  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-12-17 17:12:36,719 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:36,719 INFO  L93              Difference]: Finished difference Result 9797 states and 33873 transitions.
[2020-12-17 17:12:36,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-12-17 17:12:36,720 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 62
[2020-12-17 17:12:36,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:36,746 INFO  L225             Difference]: With dead ends: 9797
[2020-12-17 17:12:36,746 INFO  L226             Difference]: Without dead ends: 5189
[2020-12-17 17:12:36,748 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2020-12-17 17:12:36,748 INFO  L78                 Accepts]: Start accepts. Automaton has 5189 states. Word has length 62
[2020-12-17 17:12:36,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:36,749 INFO  L481      AbstractCegarLoop]: Abstraction has 5189 states.
[2020-12-17 17:12:36,750 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-12-17 17:12:36,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 5189 states.
[2020-12-17 17:12:36,764 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2020-12-17 17:12:36,765 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:36,765 INFO  L504         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]
[2020-12-17 17:12:36,765 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-12-17 17:12:36,766 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:36,766 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:36,767 INFO  L82        PathProgramCache]: Analyzing trace with hash -1518188004, now seen corresponding path program 1 times
[2020-12-17 17:12:36,767 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:36,768 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834515211]
[2020-12-17 17:12:36,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:36,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:36,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:36,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834515211]
[2020-12-17 17:12:36,992 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:36,992 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 17:12:36,992 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138055934]
[2020-12-17 17:12:36,993 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 17:12:36,993 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:36,994 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 17:12:36,994 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 17:12:36,994 INFO  L87              Difference]: Start difference. First operand 5189 states. Second operand  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-12-17 17:12:37,160 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:37,160 INFO  L93              Difference]: Finished difference Result 6069 states and 20387 transitions.
[2020-12-17 17:12:37,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 17:12:37,161 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 65
[2020-12-17 17:12:37,161 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:37,185 INFO  L225             Difference]: With dead ends: 6069
[2020-12-17 17:12:37,185 INFO  L226             Difference]: Without dead ends: 5109
[2020-12-17 17:12:37,186 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 17:12:37,186 INFO  L78                 Accepts]: Start accepts. Automaton has 5109 states. Word has length 65
[2020-12-17 17:12:37,186 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:37,186 INFO  L481      AbstractCegarLoop]: Abstraction has 5109 states.
[2020-12-17 17:12:37,187 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-12-17 17:12:37,187 INFO  L276                IsEmpty]: Start isEmpty. Operand 5109 states.
[2020-12-17 17:12:37,202 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-12-17 17:12:37,202 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:37,202 INFO  L504         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]
[2020-12-17 17:12:37,203 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-12-17 17:12:37,203 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:37,203 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:37,204 INFO  L82        PathProgramCache]: Analyzing trace with hash -567597327, now seen corresponding path program 1 times
[2020-12-17 17:12:37,204 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:37,204 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610200088]
[2020-12-17 17:12:37,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:37,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:37,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:37,417 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610200088]
[2020-12-17 17:12:37,418 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:37,418 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 17:12:37,418 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974092698]
[2020-12-17 17:12:37,420 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 17:12:37,420 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:37,421 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 17:12:37,421 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 17:12:37,421 INFO  L87              Difference]: Start difference. First operand 5109 states. Second operand  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-17 17:12:37,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:37,643 INFO  L93              Difference]: Finished difference Result 8509 states and 28439 transitions.
[2020-12-17 17:12:37,644 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 17:12:37,644 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66
[2020-12-17 17:12:37,644 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:37,672 INFO  L225             Difference]: With dead ends: 8509
[2020-12-17 17:12:37,672 INFO  L226             Difference]: Without dead ends: 5909
[2020-12-17 17:12:37,673 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 17:12:37,673 INFO  L78                 Accepts]: Start accepts. Automaton has 5909 states. Word has length 66
[2020-12-17 17:12:37,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:37,676 INFO  L481      AbstractCegarLoop]: Abstraction has 5909 states.
[2020-12-17 17:12:37,676 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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-12-17 17:12:37,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 5909 states.
[2020-12-17 17:12:37,699 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2020-12-17 17:12:37,699 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:37,700 INFO  L504         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]
[2020-12-17 17:12:37,700 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-12-17 17:12:37,700 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:37,701 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:37,701 INFO  L82        PathProgramCache]: Analyzing trace with hash -324946565, now seen corresponding path program 1 times
[2020-12-17 17:12:37,701 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:37,701 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112309667]
[2020-12-17 17:12:37,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:37,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:38,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:38,131 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112309667]
[2020-12-17 17:12:38,132 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:38,132 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-12-17 17:12:38,133 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344976917]
[2020-12-17 17:12:38,133 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-12-17 17:12:38,133 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:38,134 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-12-17 17:12:38,134 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2020-12-17 17:12:38,135 INFO  L87              Difference]: Start difference. First operand 5909 states. Second operand  has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-12-17 17:12:38,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:38,520 INFO  L93              Difference]: Finished difference Result 7173 states and 23556 transitions.
[2020-12-17 17:12:38,521 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-12-17 17:12:38,522 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 67
[2020-12-17 17:12:38,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:38,542 INFO  L225             Difference]: With dead ends: 7173
[2020-12-17 17:12:38,542 INFO  L226             Difference]: Without dead ends: 5853
[2020-12-17 17:12:38,543 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240
[2020-12-17 17:12:38,543 INFO  L78                 Accepts]: Start accepts. Automaton has 5853 states. Word has length 67
[2020-12-17 17:12:38,543 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:38,543 INFO  L481      AbstractCegarLoop]: Abstraction has 5853 states.
[2020-12-17 17:12:38,544 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-12-17 17:12:38,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 5853 states.
[2020-12-17 17:12:38,557 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2020-12-17 17:12:38,557 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:38,557 INFO  L504         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]
[2020-12-17 17:12:38,557 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-12-17 17:12:38,558 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:38,559 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:38,559 INFO  L82        PathProgramCache]: Analyzing trace with hash -1901802373, now seen corresponding path program 1 times
[2020-12-17 17:12:38,559 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:38,562 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595449402]
[2020-12-17 17:12:38,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:38,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:38,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:38,841 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595449402]
[2020-12-17 17:12:38,841 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:38,841 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-12-17 17:12:38,841 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584259472]
[2020-12-17 17:12:38,842 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-12-17 17:12:38,843 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:38,843 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-12-17 17:12:38,844 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2020-12-17 17:12:38,844 INFO  L87              Difference]: Start difference. First operand 5853 states. Second operand  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-12-17 17:12:39,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:39,318 INFO  L93              Difference]: Finished difference Result 6505 states and 21412 transitions.
[2020-12-17 17:12:39,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-12-17 17:12:39,319 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68
[2020-12-17 17:12:39,319 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:39,340 INFO  L225             Difference]: With dead ends: 6505
[2020-12-17 17:12:39,340 INFO  L226             Difference]: Without dead ends: 5905
[2020-12-17 17:12:39,341 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2020-12-17 17:12:39,341 INFO  L78                 Accepts]: Start accepts. Automaton has 5905 states. Word has length 68
[2020-12-17 17:12:39,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:39,341 INFO  L481      AbstractCegarLoop]: Abstraction has 5905 states.
[2020-12-17 17:12:39,342 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-12-17 17:12:39,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 5905 states.
[2020-12-17 17:12:39,353 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2020-12-17 17:12:39,353 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:39,353 INFO  L504         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]
[2020-12-17 17:12:39,354 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-12-17 17:12:39,354 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:39,355 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:39,355 INFO  L82        PathProgramCache]: Analyzing trace with hash -1904827031, now seen corresponding path program 2 times
[2020-12-17 17:12:39,355 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:39,356 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370269510]
[2020-12-17 17:12:39,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:39,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:39,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:39,664 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370269510]
[2020-12-17 17:12:39,664 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:39,664 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-12-17 17:12:39,664 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643357457]
[2020-12-17 17:12:39,665 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-12-17 17:12:39,665 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:39,666 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-12-17 17:12:39,666 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2020-12-17 17:12:39,666 INFO  L87              Difference]: Start difference. First operand 5905 states. Second operand  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-12-17 17:12:40,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:40,311 INFO  L93              Difference]: Finished difference Result 7204 states and 23823 transitions.
[2020-12-17 17:12:40,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-12-17 17:12:40,311 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68
[2020-12-17 17:12:40,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:40,387 INFO  L225             Difference]: With dead ends: 7204
[2020-12-17 17:12:40,387 INFO  L226             Difference]: Without dead ends: 6604
[2020-12-17 17:12:40,388 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272
[2020-12-17 17:12:40,388 INFO  L78                 Accepts]: Start accepts. Automaton has 6604 states. Word has length 68
[2020-12-17 17:12:40,388 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:40,388 INFO  L481      AbstractCegarLoop]: Abstraction has 6604 states.
[2020-12-17 17:12:40,388 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-12-17 17:12:40,389 INFO  L276                IsEmpty]: Start isEmpty. Operand 6604 states.
[2020-12-17 17:12:40,406 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2020-12-17 17:12:40,407 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:40,407 INFO  L504         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]
[2020-12-17 17:12:40,407 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-12-17 17:12:40,407 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:40,408 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:40,408 INFO  L82        PathProgramCache]: Analyzing trace with hash 365861782, now seen corresponding path program 1 times
[2020-12-17 17:12:40,408 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:40,409 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118896424]
[2020-12-17 17:12:40,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:40,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:40,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:40,566 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118896424]
[2020-12-17 17:12:40,566 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:40,566 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-12-17 17:12:40,567 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860587203]
[2020-12-17 17:12:40,568 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-12-17 17:12:40,572 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:40,573 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-12-17 17:12:40,573 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-12-17 17:12:40,574 INFO  L87              Difference]: Start difference. First operand 6604 states. Second operand  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12-17 17:12:40,730 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:40,730 INFO  L93              Difference]: Finished difference Result 7279 states and 23643 transitions.
[2020-12-17 17:12:40,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-12-17 17:12:40,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68
[2020-12-17 17:12:40,731 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:40,748 INFO  L225             Difference]: With dead ends: 7279
[2020-12-17 17:12:40,749 INFO  L226             Difference]: Without dead ends: 5643
[2020-12-17 17:12:40,749 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2020-12-17 17:12:40,749 INFO  L78                 Accepts]: Start accepts. Automaton has 5643 states. Word has length 68
[2020-12-17 17:12:40,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:40,750 INFO  L481      AbstractCegarLoop]: Abstraction has 5643 states.
[2020-12-17 17:12:40,750 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-12-17 17:12:40,750 INFO  L276                IsEmpty]: Start isEmpty. Operand 5643 states.
[2020-12-17 17:12:40,761 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2020-12-17 17:12:40,761 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:40,761 INFO  L504         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]
[2020-12-17 17:12:40,762 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-12-17 17:12:40,762 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:40,762 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:40,762 INFO  L82        PathProgramCache]: Analyzing trace with hash 517434972, now seen corresponding path program 1 times
[2020-12-17 17:12:40,762 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:40,763 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793825776]
[2020-12-17 17:12:40,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:40,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:40,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:40,927 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793825776]
[2020-12-17 17:12:40,927 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:40,927 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-12-17 17:12:40,928 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904320858]
[2020-12-17 17:12:40,928 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-12-17 17:12:40,928 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:40,929 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-12-17 17:12:40,929 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-12-17 17:12:40,929 INFO  L87              Difference]: Start difference. First operand 5643 states. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12-17 17:12:41,112 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:41,112 INFO  L93              Difference]: Finished difference Result 4527 states and 14097 transitions.
[2020-12-17 17:12:41,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-12-17 17:12:41,113 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 69
[2020-12-17 17:12:41,113 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:41,124 INFO  L225             Difference]: With dead ends: 4527
[2020-12-17 17:12:41,125 INFO  L226             Difference]: Without dead ends: 3255
[2020-12-17 17:12:41,125 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2020-12-17 17:12:41,125 INFO  L78                 Accepts]: Start accepts. Automaton has 3255 states. Word has length 69
[2020-12-17 17:12:41,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:41,126 INFO  L481      AbstractCegarLoop]: Abstraction has 3255 states.
[2020-12-17 17:12:41,126 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-12-17 17:12:41,128 INFO  L276                IsEmpty]: Start isEmpty. Operand 3255 states.
[2020-12-17 17:12:41,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2020-12-17 17:12:41,136 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:41,136 INFO  L504         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]
[2020-12-17 17:12:41,138 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-12-17 17:12:41,138 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:41,138 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:41,139 INFO  L82        PathProgramCache]: Analyzing trace with hash 2042366077, now seen corresponding path program 1 times
[2020-12-17 17:12:41,139 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:41,139 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497213763]
[2020-12-17 17:12:41,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:41,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:41,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:41,341 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497213763]
[2020-12-17 17:12:41,341 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:41,341 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-12-17 17:12:41,342 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370389835]
[2020-12-17 17:12:41,342 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-12-17 17:12:41,342 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:41,343 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-12-17 17:12:41,343 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2020-12-17 17:12:41,343 INFO  L87              Difference]: Start difference. First operand 3255 states. Second operand  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-12-17 17:12:41,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:41,622 INFO  L93              Difference]: Finished difference Result 2121 states and 6241 transitions.
[2020-12-17 17:12:41,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-12-17 17:12:41,623 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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 72
[2020-12-17 17:12:41,623 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:41,627 INFO  L225             Difference]: With dead ends: 2121
[2020-12-17 17:12:41,627 INFO  L226             Difference]: Without dead ends: 1019
[2020-12-17 17:12:41,627 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2020-12-17 17:12:41,628 INFO  L78                 Accepts]: Start accepts. Automaton has 1019 states. Word has length 72
[2020-12-17 17:12:41,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:41,628 INFO  L481      AbstractCegarLoop]: Abstraction has 1019 states.
[2020-12-17 17:12:41,628 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-12-17 17:12:41,628 INFO  L276                IsEmpty]: Start isEmpty. Operand 1019 states.
[2020-12-17 17:12:41,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2020-12-17 17:12:41,632 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:41,632 INFO  L504         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]
[2020-12-17 17:12:41,632 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-12-17 17:12:41,632 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:41,633 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:41,633 INFO  L82        PathProgramCache]: Analyzing trace with hash 1994106961, now seen corresponding path program 1 times
[2020-12-17 17:12:41,633 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:41,633 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100001600]
[2020-12-17 17:12:41,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:41,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:41,982 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:41,983 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100001600]
[2020-12-17 17:12:41,983 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:41,983 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-12-17 17:12:41,983 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017691892]
[2020-12-17 17:12:41,984 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-12-17 17:12:41,984 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:41,984 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-12-17 17:12:41,984 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2020-12-17 17:12:41,985 INFO  L87              Difference]: Start difference. First operand 1019 states. Second operand  has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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-12-17 17:12:42,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:42,280 INFO  L93              Difference]: Finished difference Result 1481 states and 4255 transitions.
[2020-12-17 17:12:42,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-12-17 17:12:42,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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 75
[2020-12-17 17:12:42,281 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:42,284 INFO  L225             Difference]: With dead ends: 1481
[2020-12-17 17:12:42,284 INFO  L226             Difference]: Without dead ends: 955
[2020-12-17 17:12:42,285 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240
[2020-12-17 17:12:42,285 INFO  L78                 Accepts]: Start accepts. Automaton has 955 states. Word has length 75
[2020-12-17 17:12:42,285 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:42,286 INFO  L481      AbstractCegarLoop]: Abstraction has 955 states.
[2020-12-17 17:12:42,286 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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-12-17 17:12:42,286 INFO  L276                IsEmpty]: Start isEmpty. Operand 955 states.
[2020-12-17 17:12:42,289 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2020-12-17 17:12:42,290 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:42,290 INFO  L504         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]
[2020-12-17 17:12:42,290 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-12-17 17:12:42,290 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:42,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:42,291 INFO  L82        PathProgramCache]: Analyzing trace with hash -447500751, now seen corresponding path program 2 times
[2020-12-17 17:12:42,291 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:42,291 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039982945]
[2020-12-17 17:12:42,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:42,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-12-17 17:12:42,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-12-17 17:12:42,794 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039982945]
[2020-12-17 17:12:42,794 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-12-17 17:12:42,795 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2020-12-17 17:12:42,795 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478149615]
[2020-12-17 17:12:42,795 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-12-17 17:12:42,796 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-12-17 17:12:42,797 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-12-17 17:12:42,797 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2020-12-17 17:12:42,797 INFO  L87              Difference]: Start difference. First operand 955 states. Second operand  has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-12-17 17:12:43,218 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-12-17 17:12:43,218 INFO  L93              Difference]: Finished difference Result 1385 states and 3919 transitions.
[2020-12-17 17:12:43,219 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-12-17 17:12:43,219 INFO  L78                 Accepts]: Start accepts. Automaton has  has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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 75
[2020-12-17 17:12:43,219 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-12-17 17:12:43,222 INFO  L225             Difference]: With dead ends: 1385
[2020-12-17 17:12:43,222 INFO  L226             Difference]: Without dead ends: 811
[2020-12-17 17:12:43,222 INFO  L763         BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380
[2020-12-17 17:12:43,222 INFO  L78                 Accepts]: Start accepts. Automaton has 811 states. Word has length 75
[2020-12-17 17:12:43,223 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-12-17 17:12:43,223 INFO  L481      AbstractCegarLoop]: Abstraction has 811 states.
[2020-12-17 17:12:43,223 INFO  L482      AbstractCegarLoop]: Interpolant automaton has  has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 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-12-17 17:12:43,223 INFO  L276                IsEmpty]: Start isEmpty. Operand 811 states.
[2020-12-17 17:12:43,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2020-12-17 17:12:43,225 INFO  L496         BasicCegarLoop]: Found error trace
[2020-12-17 17:12:43,225 INFO  L504         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]
[2020-12-17 17:12:43,226 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-12-17 17:12:43,226 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-12-17 17:12:43,226 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-12-17 17:12:43,226 INFO  L82        PathProgramCache]: Analyzing trace with hash 782794833, now seen corresponding path program 3 times
[2020-12-17 17:12:43,227 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-12-17 17:12:43,232 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695224406]
[2020-12-17 17:12:43,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-12-17 17:12:43,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-12-17 17:12:43,304 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-12-17 17:12:43,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-12-17 17:12:43,379 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-12-17 17:12:43,453 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-12-17 17:12:43,454 INFO  L605         BasicCegarLoop]: Counterexample might be feasible
[2020-12-17 17:12:43,454 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-12-17 17:12:43,663 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 05:12:43 BasicIcfg
[2020-12-17 17:12:43,663 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-12-17 17:12:43,668 INFO  L168              Benchmark]: Toolchain (without parser) took 14910.42 ms. Allocated memory was 302.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 277.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 301.9 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,668 INFO  L168              Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,669 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 756.53 ms. Allocated memory is still 302.0 MB. Free memory was 277.3 MB in the beginning and 285.2 MB in the end (delta: -8.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,670 INFO  L168              Benchmark]: Boogie Procedure Inliner took 109.66 ms. Allocated memory is still 302.0 MB. Free memory was 285.2 MB in the beginning and 282.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,671 INFO  L168              Benchmark]: Boogie Preprocessor took 54.43 ms. Allocated memory is still 302.0 MB. Free memory was 282.3 MB in the beginning and 280.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,675 INFO  L168              Benchmark]: RCFGBuilder took 2556.22 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.2 MB in the beginning and 278.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 177.4 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,676 INFO  L168              Benchmark]: TraceAbstraction took 11424.63 ms. Allocated memory was 362.8 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 278.0 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 239.2 MB. Max. memory is 16.0 GB.
[2020-12-17 17:12:43,682 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.65 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 756.53 ms. Allocated memory is still 302.0 MB. Free memory was 277.3 MB in the beginning and 285.2 MB in the end (delta: -8.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 109.66 ms. Allocated memory is still 302.0 MB. Free memory was 285.2 MB in the beginning and 282.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 54.43 ms. Allocated memory is still 302.0 MB. Free memory was 282.3 MB in the beginning and 280.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2556.22 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.2 MB in the beginning and 278.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 177.4 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 11424.63 ms. Allocated memory was 362.8 MB in the beginning and 2.1 GB in the end (delta: 1.7 GB). Free memory was 278.0 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 239.2 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L712]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0]
[L713]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L715]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L716]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L717]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L718]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L719]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L720]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L721]               0  _Bool x$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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]
[L722]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0]
[L723]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0]
[L724]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L725]               0  _Bool x$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L726]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0]
[L727]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L728]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L729]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L730]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L731]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L733]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L735]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L736]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L737]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L818]               0  pthread_t t2028;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L819]  FCALL, FORK  0  pthread_create(&t2028, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L820]               0  pthread_t t2029;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L821]  FCALL, FORK  0  pthread_create(&t2029, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L761]               2  x$w_buff1 = x$w_buff0
[L762]               2  x$w_buff0 = 2
[L763]               2  x$w_buff1_used = x$w_buff0_used
[L764]               2  x$w_buff0_used = (_Bool)1
[L18]   COND FALSE   2  !(!expression)
[L766]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L767]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L768]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L769]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L770]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L822]               0  pthread_t t2030;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L823]  FCALL, FORK  0  pthread_create(&t2030, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L790]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L793]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L741]               1  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L796]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L796]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L796]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L796]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L797]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L797]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L798]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L798]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L799]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L799]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L800]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L800]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L744]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L776]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L776]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L777]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L777]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L778]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L778]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L779]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L779]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L780]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L780]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L747]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747]  EXPR         1  x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L747]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L747]               1  x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L748]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L748]               1  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L749]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L749]               1  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L750]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L750]               1  x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L751]  EXPR         1  x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L751]               1  x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L754]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L803]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L825]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L829]  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)
[L829]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L829]  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)
[L829]               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)
[L830]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L830]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L831]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L831]               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
[L832]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L832]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L833]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L833]               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
[L836]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L837]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L838]               0  x$flush_delayed = weak$$choice2
[L839]               0  x$mem_tmp = x
[L840]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L840]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L841]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L841]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L842]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L842]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L843]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L843]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L844]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L844]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L845]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L845]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L846]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L846]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L847]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1)
[L848]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L848]               0  x = x$flush_delayed ? x$mem_tmp : x
[L849]               0  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L18]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L17]   COND FALSE   0  !(0)
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L17]                0  __assert_fail ("0", "safe011_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, 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 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 1570 SDtfs, 2312 SDslu, 5751 SDs, 0 SdLazy, 798 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17061occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 933 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 286838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...