./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe014_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe014_power.oepc_false-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e0235ba6f2f02d75d267a66616cbc315de64158 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 04:38:22,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 04:38:22,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 04:38:22,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 04:38:22,547 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 04:38:22,548 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 04:38:22,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 04:38:22,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 04:38:22,553 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 04:38:22,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 04:38:22,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 04:38:22,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 04:38:22,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 04:38:22,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 04:38:22,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 04:38:22,559 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 04:38:22,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 04:38:22,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 04:38:22,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 04:38:22,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 04:38:22,567 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 04:38:22,568 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 04:38:22,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 04:38:22,571 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 04:38:22,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 04:38:22,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 04:38:22,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 04:38:22,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 04:38:22,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 04:38:22,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 04:38:22,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 04:38:22,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 04:38:22,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 04:38:22,584 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 04:38:22,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 04:38:22,586 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 04:38:22,586 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 04:38:22,601 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 04:38:22,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 04:38:22,603 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 04:38:22,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 04:38:22,603 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 04:38:22,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 04:38:22,604 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 04:38:22,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 04:38:22,604 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 04:38:22,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 04:38:22,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 04:38:22,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 04:38:22,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 04:38:22,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 04:38:22,606 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 04:38:22,606 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 04:38:22,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 04:38:22,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 04:38:22,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e0235ba6f2f02d75d267a66616cbc315de64158 [2019-01-13 04:38:22,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 04:38:22,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 04:38:22,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 04:38:22,661 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 04:38:22,661 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 04:38:22,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe014_power.oepc_false-unreach-call.i [2019-01-13 04:38:22,725 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9495695/584a8f4361e347498e9b3acdf69774d1/FLAG1a228bb6e [2019-01-13 04:38:23,221 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 04:38:23,223 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe014_power.oepc_false-unreach-call.i [2019-01-13 04:38:23,243 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9495695/584a8f4361e347498e9b3acdf69774d1/FLAG1a228bb6e [2019-01-13 04:38:23,502 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d9495695/584a8f4361e347498e9b3acdf69774d1 [2019-01-13 04:38:23,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 04:38:23,508 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 04:38:23,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 04:38:23,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 04:38:23,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 04:38:23,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:38:23" (1/1) ... [2019-01-13 04:38:23,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c23ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:23, skipping insertion in model container [2019-01-13 04:38:23,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 04:38:23" (1/1) ... [2019-01-13 04:38:23,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 04:38:23,608 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 04:38:24,164 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:38:24,179 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 04:38:24,382 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 04:38:24,480 INFO L195 MainTranslator]: Completed translation [2019-01-13 04:38:24,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24 WrapperNode [2019-01-13 04:38:24,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 04:38:24,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 04:38:24,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 04:38:24,484 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 04:38:24,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 04:38:24,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 04:38:24,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 04:38:24,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 04:38:24,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (1/1) ... [2019-01-13 04:38:24,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 04:38:24,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 04:38:24,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 04:38:24,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 04:38:24,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (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 [2019-01-13 04:38:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 04:38:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 04:38:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 04:38:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 04:38:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 04:38:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 04:38:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 04:38:24,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 04:38:24,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 04:38:24,700 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 04:38:24,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 04:38:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-13 04:38:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 04:38:24,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 04:38:24,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 04:38:24,707 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 04:38:26,256 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 04:38:26,257 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 04:38:26,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:38:26 BoogieIcfgContainer [2019-01-13 04:38:26,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 04:38:26,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 04:38:26,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 04:38:26,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 04:38:26,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 04:38:23" (1/3) ... [2019-01-13 04:38:26,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54239829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:38:26, skipping insertion in model container [2019-01-13 04:38:26,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 04:38:24" (2/3) ... [2019-01-13 04:38:26,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54239829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 04:38:26, skipping insertion in model container [2019-01-13 04:38:26,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:38:26" (3/3) ... [2019-01-13 04:38:26,267 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_power.oepc_false-unreach-call.i [2019-01-13 04:38:26,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,322 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,326 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,327 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,328 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,330 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,331 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,334 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,339 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,340 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,341 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,345 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,346 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,347 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,348 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,350 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,357 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,358 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,360 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,361 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,363 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,369 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,370 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,371 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,372 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,373 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,377 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,378 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,379 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,380 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,381 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,382 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,390 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,391 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,392 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,393 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,397 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,398 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,400 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,401 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,403 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,405 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,405 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,405 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet52.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,406 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet52.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,406 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,407 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,408 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet52.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,410 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet52.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,411 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,412 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,413 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,413 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,413 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,414 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet53.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet53.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,418 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,419 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet53.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,420 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet53.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,421 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,422 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,422 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,422 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,423 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,424 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,426 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,427 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,428 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,429 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,433 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,434 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,434 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,434 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,434 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet61.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,434 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet61.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,435 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,436 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,436 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet61.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,436 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet61.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 04:38:26,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 04:38:26,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 04:38:26,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 04:38:26,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 04:38:26,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 04:38:26,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 04:38:26,530 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 04:38:26,530 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 04:38:26,530 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 04:38:26,530 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 04:38:26,530 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 04:38:26,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 04:38:26,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 04:38:26,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 200places, 251 transitions [2019-01-13 04:39:24,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 247741 states. [2019-01-13 04:39:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 247741 states. [2019-01-13 04:39:24,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-13 04:39:24,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:39:24,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:39:24,797 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:39:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:39:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1633541048, now seen corresponding path program 1 times [2019-01-13 04:39:24,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:39:24,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:39:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:39:24,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:39:24,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:39:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:39:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:39:25,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:39:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:39:25,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:39:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:39:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:39:25,371 INFO L87 Difference]: Start difference. First operand 247741 states. Second operand 4 states. [2019-01-13 04:39:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:39:29,570 INFO L93 Difference]: Finished difference Result 359553 states and 1600673 transitions. [2019-01-13 04:39:29,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:39:29,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-01-13 04:39:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:39:30,982 INFO L225 Difference]: With dead ends: 359553 [2019-01-13 04:39:30,982 INFO L226 Difference]: Without dead ends: 242703 [2019-01-13 04:39:30,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:39:33,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242703 states. [2019-01-13 04:39:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242703 to 233668. [2019-01-13 04:39:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233668 states. [2019-01-13 04:39:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233668 states to 233668 states and 1066250 transitions. [2019-01-13 04:39:49,967 INFO L78 Accepts]: Start accepts. Automaton has 233668 states and 1066250 transitions. Word has length 78 [2019-01-13 04:39:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:39:49,968 INFO L480 AbstractCegarLoop]: Abstraction has 233668 states and 1066250 transitions. [2019-01-13 04:39:49,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:39:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 233668 states and 1066250 transitions. [2019-01-13 04:39:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-13 04:39:50,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:39:50,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:39:50,105 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:39:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:39:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -30848508, now seen corresponding path program 1 times [2019-01-13 04:39:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:39:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:39:50,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:39:50,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:39:50,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:39:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:39:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:39:50,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:39:50,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:39:50,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:39:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:39:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:39:50,275 INFO L87 Difference]: Start difference. First operand 233668 states and 1066250 transitions. Second operand 4 states. [2019-01-13 04:39:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:39:52,110 INFO L93 Difference]: Finished difference Result 209061 states and 934762 transitions. [2019-01-13 04:39:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:39:52,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-01-13 04:39:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:04,949 INFO L225 Difference]: With dead ends: 209061 [2019-01-13 04:40:04,949 INFO L226 Difference]: Without dead ends: 202956 [2019-01-13 04:40:04,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202956 states. [2019-01-13 04:40:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202956 to 202956. [2019-01-13 04:40:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202956 states. [2019-01-13 04:40:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202956 states to 202956 states and 912729 transitions. [2019-01-13 04:40:11,320 INFO L78 Accepts]: Start accepts. Automaton has 202956 states and 912729 transitions. Word has length 80 [2019-01-13 04:40:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:11,321 INFO L480 AbstractCegarLoop]: Abstraction has 202956 states and 912729 transitions. [2019-01-13 04:40:11,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:40:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 202956 states and 912729 transitions. [2019-01-13 04:40:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-13 04:40:11,384 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:11,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:11,384 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1416574188, now seen corresponding path program 1 times [2019-01-13 04:40:11,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:11,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:11,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:11,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:40:11,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:40:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:40:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:11,548 INFO L87 Difference]: Start difference. First operand 202956 states and 912729 transitions. Second operand 5 states. [2019-01-13 04:40:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:12,053 INFO L93 Difference]: Finished difference Result 71280 states and 288924 transitions. [2019-01-13 04:40:12,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 04:40:12,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-01-13 04:40:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:12,240 INFO L225 Difference]: With dead ends: 71280 [2019-01-13 04:40:12,240 INFO L226 Difference]: Without dead ends: 66004 [2019-01-13 04:40:12,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:40:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66004 states. [2019-01-13 04:40:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66004 to 66004. [2019-01-13 04:40:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66004 states. [2019-01-13 04:40:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66004 states to 66004 states and 267255 transitions. [2019-01-13 04:40:15,765 INFO L78 Accepts]: Start accepts. Automaton has 66004 states and 267255 transitions. Word has length 81 [2019-01-13 04:40:15,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:15,765 INFO L480 AbstractCegarLoop]: Abstraction has 66004 states and 267255 transitions. [2019-01-13 04:40:15,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:40:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 66004 states and 267255 transitions. [2019-01-13 04:40:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 04:40:15,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:15,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:15,828 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash -81613990, now seen corresponding path program 1 times [2019-01-13 04:40:15,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:15,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:15,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:16,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:16,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:40:16,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:40:16,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:40:16,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:40:16,016 INFO L87 Difference]: Start difference. First operand 66004 states and 267255 transitions. Second operand 4 states. [2019-01-13 04:40:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:16,753 INFO L93 Difference]: Finished difference Result 59358 states and 236710 transitions. [2019-01-13 04:40:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:40:16,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-13 04:40:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:16,918 INFO L225 Difference]: With dead ends: 59358 [2019-01-13 04:40:16,918 INFO L226 Difference]: Without dead ends: 59358 [2019-01-13 04:40:16,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59358 states. [2019-01-13 04:40:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59358 to 56414. [2019-01-13 04:40:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56414 states. [2019-01-13 04:40:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56414 states to 56414 states and 225638 transitions. [2019-01-13 04:40:18,127 INFO L78 Accepts]: Start accepts. Automaton has 56414 states and 225638 transitions. Word has length 92 [2019-01-13 04:40:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:18,128 INFO L480 AbstractCegarLoop]: Abstraction has 56414 states and 225638 transitions. [2019-01-13 04:40:18,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:40:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56414 states and 225638 transitions. [2019-01-13 04:40:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:18,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:18,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:18,190 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:18,191 INFO L82 PathProgramCache]: Analyzing trace with hash 985746661, now seen corresponding path program 1 times [2019-01-13 04:40:18,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:18,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:18,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:18,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:18,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:40:18,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:40:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:40:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:40:18,463 INFO L87 Difference]: Start difference. First operand 56414 states and 225638 transitions. Second operand 4 states. [2019-01-13 04:40:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:19,966 INFO L93 Difference]: Finished difference Result 71414 states and 281303 transitions. [2019-01-13 04:40:19,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:40:19,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-13 04:40:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:20,245 INFO L225 Difference]: With dead ends: 71414 [2019-01-13 04:40:20,245 INFO L226 Difference]: Without dead ends: 71414 [2019-01-13 04:40:20,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71414 states. [2019-01-13 04:40:21,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71414 to 64614. [2019-01-13 04:40:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64614 states. [2019-01-13 04:40:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64614 states to 64614 states and 255071 transitions. [2019-01-13 04:40:21,708 INFO L78 Accepts]: Start accepts. Automaton has 64614 states and 255071 transitions. Word has length 94 [2019-01-13 04:40:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:21,708 INFO L480 AbstractCegarLoop]: Abstraction has 64614 states and 255071 transitions. [2019-01-13 04:40:21,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:40:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 64614 states and 255071 transitions. [2019-01-13 04:40:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:21,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:21,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:21,778 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:21,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2021429533, now seen corresponding path program 1 times [2019-01-13 04:40:21,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:22,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:22,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:40:22,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:40:22,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:40:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:40:22,129 INFO L87 Difference]: Start difference. First operand 64614 states and 255071 transitions. Second operand 6 states. [2019-01-13 04:40:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:23,791 INFO L93 Difference]: Finished difference Result 125153 states and 482180 transitions. [2019-01-13 04:40:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 04:40:23,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 04:40:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:24,197 INFO L225 Difference]: With dead ends: 125153 [2019-01-13 04:40:24,197 INFO L226 Difference]: Without dead ends: 125153 [2019-01-13 04:40:24,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:40:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125153 states. [2019-01-13 04:40:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125153 to 72051. [2019-01-13 04:40:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72051 states. [2019-01-13 04:40:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72051 states to 72051 states and 278354 transitions. [2019-01-13 04:40:27,061 INFO L78 Accepts]: Start accepts. Automaton has 72051 states and 278354 transitions. Word has length 94 [2019-01-13 04:40:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:27,062 INFO L480 AbstractCegarLoop]: Abstraction has 72051 states and 278354 transitions. [2019-01-13 04:40:27,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:40:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 72051 states and 278354 transitions. [2019-01-13 04:40:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:27,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:27,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:27,138 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash 476586404, now seen corresponding path program 1 times [2019-01-13 04:40:27,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:27,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:27,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:27,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:27,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:40:27,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:40:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:40:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:40:27,360 INFO L87 Difference]: Start difference. First operand 72051 states and 278354 transitions. Second operand 4 states. [2019-01-13 04:40:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:28,256 INFO L93 Difference]: Finished difference Result 76735 states and 295914 transitions. [2019-01-13 04:40:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:40:28,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-13 04:40:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:28,469 INFO L225 Difference]: With dead ends: 76735 [2019-01-13 04:40:28,470 INFO L226 Difference]: Without dead ends: 76635 [2019-01-13 04:40:28,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76635 states. [2019-01-13 04:40:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76635 to 72636. [2019-01-13 04:40:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72636 states. [2019-01-13 04:40:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72636 states to 72636 states and 281799 transitions. [2019-01-13 04:40:30,617 INFO L78 Accepts]: Start accepts. Automaton has 72636 states and 281799 transitions. Word has length 94 [2019-01-13 04:40:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:30,617 INFO L480 AbstractCegarLoop]: Abstraction has 72636 states and 281799 transitions. [2019-01-13 04:40:30,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:40:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 72636 states and 281799 transitions. [2019-01-13 04:40:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:30,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:30,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:30,689 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1438200421, now seen corresponding path program 1 times [2019-01-13 04:40:30,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:30,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:30,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:30,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 04:40:30,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 04:40:30,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 04:40:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 04:40:30,871 INFO L87 Difference]: Start difference. First operand 72636 states and 281799 transitions. Second operand 4 states. [2019-01-13 04:40:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:31,956 INFO L93 Difference]: Finished difference Result 88220 states and 340231 transitions. [2019-01-13 04:40:31,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 04:40:31,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-13 04:40:31,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:32,187 INFO L225 Difference]: With dead ends: 88220 [2019-01-13 04:40:32,187 INFO L226 Difference]: Without dead ends: 84924 [2019-01-13 04:40:32,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84924 states. [2019-01-13 04:40:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84924 to 81084. [2019-01-13 04:40:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81084 states. [2019-01-13 04:40:34,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81084 states to 81084 states and 312615 transitions. [2019-01-13 04:40:34,828 INFO L78 Accepts]: Start accepts. Automaton has 81084 states and 312615 transitions. Word has length 94 [2019-01-13 04:40:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:34,828 INFO L480 AbstractCegarLoop]: Abstraction has 81084 states and 312615 transitions. [2019-01-13 04:40:34,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 04:40:34,829 INFO L276 IsEmpty]: Start isEmpty. Operand 81084 states and 312615 transitions. [2019-01-13 04:40:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:34,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:34,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:34,917 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:34,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1144797414, now seen corresponding path program 1 times [2019-01-13 04:40:34,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:34,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:34,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:34,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:35,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:35,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:40:35,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:40:35,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:40:35,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:40:35,432 INFO L87 Difference]: Start difference. First operand 81084 states and 312615 transitions. Second operand 8 states. [2019-01-13 04:40:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:37,660 INFO L93 Difference]: Finished difference Result 121105 states and 458698 transitions. [2019-01-13 04:40:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:40:37,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-13 04:40:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:37,993 INFO L225 Difference]: With dead ends: 121105 [2019-01-13 04:40:37,993 INFO L226 Difference]: Without dead ends: 121105 [2019-01-13 04:40:37,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-13 04:40:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121105 states. [2019-01-13 04:40:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121105 to 103541. [2019-01-13 04:40:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103541 states. [2019-01-13 04:40:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103541 states to 103541 states and 395020 transitions. [2019-01-13 04:40:41,461 INFO L78 Accepts]: Start accepts. Automaton has 103541 states and 395020 transitions. Word has length 94 [2019-01-13 04:40:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:41,462 INFO L480 AbstractCegarLoop]: Abstraction has 103541 states and 395020 transitions. [2019-01-13 04:40:41,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:40:41,462 INFO L276 IsEmpty]: Start isEmpty. Operand 103541 states and 395020 transitions. [2019-01-13 04:40:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:41,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:41,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:41,567 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -662657049, now seen corresponding path program 1 times [2019-01-13 04:40:41,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:41,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:41,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:41,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:40:41,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:40:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:40:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:40:41,830 INFO L87 Difference]: Start difference. First operand 103541 states and 395020 transitions. Second operand 6 states. [2019-01-13 04:40:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:42,799 INFO L93 Difference]: Finished difference Result 109676 states and 416644 transitions. [2019-01-13 04:40:42,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 04:40:42,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 04:40:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:43,119 INFO L225 Difference]: With dead ends: 109676 [2019-01-13 04:40:43,119 INFO L226 Difference]: Without dead ends: 109676 [2019-01-13 04:40:43,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:40:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109676 states. [2019-01-13 04:40:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109676 to 99408. [2019-01-13 04:40:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99408 states. [2019-01-13 04:40:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99408 states to 99408 states and 379195 transitions. [2019-01-13 04:40:46,677 INFO L78 Accepts]: Start accepts. Automaton has 99408 states and 379195 transitions. Word has length 94 [2019-01-13 04:40:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:46,677 INFO L480 AbstractCegarLoop]: Abstraction has 99408 states and 379195 transitions. [2019-01-13 04:40:46,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:40:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 99408 states and 379195 transitions. [2019-01-13 04:40:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:46,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:46,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:46,771 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1905405401, now seen corresponding path program 1 times [2019-01-13 04:40:46,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:46,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:46,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:46,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:46,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:40:46,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:40:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:40:46,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:40:46,980 INFO L87 Difference]: Start difference. First operand 99408 states and 379195 transitions. Second operand 8 states. [2019-01-13 04:40:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:48,254 INFO L93 Difference]: Finished difference Result 108988 states and 409036 transitions. [2019-01-13 04:40:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 04:40:48,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-01-13 04:40:48,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:48,535 INFO L225 Difference]: With dead ends: 108988 [2019-01-13 04:40:48,536 INFO L226 Difference]: Without dead ends: 108988 [2019-01-13 04:40:48,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:40:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108988 states. [2019-01-13 04:40:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108988 to 90778. [2019-01-13 04:40:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90778 states. [2019-01-13 04:40:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90778 states to 90778 states and 342054 transitions. [2019-01-13 04:40:51,879 INFO L78 Accepts]: Start accepts. Automaton has 90778 states and 342054 transitions. Word has length 94 [2019-01-13 04:40:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:51,879 INFO L480 AbstractCegarLoop]: Abstraction has 90778 states and 342054 transitions. [2019-01-13 04:40:51,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:40:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 90778 states and 342054 transitions. [2019-01-13 04:40:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-13 04:40:51,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:51,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:51,970 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:51,971 INFO L82 PathProgramCache]: Analyzing trace with hash 582107432, now seen corresponding path program 1 times [2019-01-13 04:40:51,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:51,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:51,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:40:52,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:40:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:40:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:40:52,139 INFO L87 Difference]: Start difference. First operand 90778 states and 342054 transitions. Second operand 6 states. [2019-01-13 04:40:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:52,295 INFO L93 Difference]: Finished difference Result 24570 states and 80038 transitions. [2019-01-13 04:40:52,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:40:52,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-01-13 04:40:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:52,330 INFO L225 Difference]: With dead ends: 24570 [2019-01-13 04:40:52,330 INFO L226 Difference]: Without dead ends: 19544 [2019-01-13 04:40:52,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:40:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19544 states. [2019-01-13 04:40:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19544 to 18904. [2019-01-13 04:40:52,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18904 states. [2019-01-13 04:40:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18904 states to 18904 states and 60336 transitions. [2019-01-13 04:40:52,598 INFO L78 Accepts]: Start accepts. Automaton has 18904 states and 60336 transitions. Word has length 94 [2019-01-13 04:40:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 18904 states and 60336 transitions. [2019-01-13 04:40:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:40:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18904 states and 60336 transitions. [2019-01-13 04:40:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-13 04:40:52,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:52,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:52,624 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1317083561, now seen corresponding path program 1 times [2019-01-13 04:40:52,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:52,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:52,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 04:40:53,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 04:40:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 04:40:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 04:40:53,209 INFO L87 Difference]: Start difference. First operand 18904 states and 60336 transitions. Second operand 6 states. [2019-01-13 04:40:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:53,850 INFO L93 Difference]: Finished difference Result 24932 states and 78664 transitions. [2019-01-13 04:40:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:40:53,851 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-01-13 04:40:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:53,892 INFO L225 Difference]: With dead ends: 24932 [2019-01-13 04:40:53,892 INFO L226 Difference]: Without dead ends: 24622 [2019-01-13 04:40:53,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-13 04:40:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24622 states. [2019-01-13 04:40:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24622 to 19554. [2019-01-13 04:40:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19554 states. [2019-01-13 04:40:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19554 states to 19554 states and 62266 transitions. [2019-01-13 04:40:54,185 INFO L78 Accepts]: Start accepts. Automaton has 19554 states and 62266 transitions. Word has length 109 [2019-01-13 04:40:54,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:54,186 INFO L480 AbstractCegarLoop]: Abstraction has 19554 states and 62266 transitions. [2019-01-13 04:40:54,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 04:40:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 19554 states and 62266 transitions. [2019-01-13 04:40:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-13 04:40:54,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:54,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:54,212 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1081660105, now seen corresponding path program 1 times [2019-01-13 04:40:54,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:54,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:54,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:54,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:54,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:54,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:40:54,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:40:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:40:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:54,375 INFO L87 Difference]: Start difference. First operand 19554 states and 62266 transitions. Second operand 5 states. [2019-01-13 04:40:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:54,653 INFO L93 Difference]: Finished difference Result 28440 states and 90227 transitions. [2019-01-13 04:40:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:40:54,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-01-13 04:40:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:54,705 INFO L225 Difference]: With dead ends: 28440 [2019-01-13 04:40:54,705 INFO L226 Difference]: Without dead ends: 28440 [2019-01-13 04:40:54,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:40:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28440 states. [2019-01-13 04:40:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28440 to 23448. [2019-01-13 04:40:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23448 states. [2019-01-13 04:40:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23448 states to 23448 states and 74883 transitions. [2019-01-13 04:40:55,099 INFO L78 Accepts]: Start accepts. Automaton has 23448 states and 74883 transitions. Word has length 109 [2019-01-13 04:40:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:55,099 INFO L480 AbstractCegarLoop]: Abstraction has 23448 states and 74883 transitions. [2019-01-13 04:40:55,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:40:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23448 states and 74883 transitions. [2019-01-13 04:40:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-13 04:40:55,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:55,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:55,130 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:55,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2016269718, now seen corresponding path program 1 times [2019-01-13 04:40:55,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:55,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:55,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:55,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:55,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:40:55,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:40:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:40:55,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:40:55,315 INFO L87 Difference]: Start difference. First operand 23448 states and 74883 transitions. Second operand 7 states. [2019-01-13 04:40:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:56,083 INFO L93 Difference]: Finished difference Result 33212 states and 104228 transitions. [2019-01-13 04:40:56,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 04:40:56,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2019-01-13 04:40:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:56,139 INFO L225 Difference]: With dead ends: 33212 [2019-01-13 04:40:56,139 INFO L226 Difference]: Without dead ends: 33212 [2019-01-13 04:40:56,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:40:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33212 states. [2019-01-13 04:40:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33212 to 24388. [2019-01-13 04:40:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24388 states. [2019-01-13 04:40:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24388 states to 24388 states and 77655 transitions. [2019-01-13 04:40:56,529 INFO L78 Accepts]: Start accepts. Automaton has 24388 states and 77655 transitions. Word has length 109 [2019-01-13 04:40:56,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:56,530 INFO L480 AbstractCegarLoop]: Abstraction has 24388 states and 77655 transitions. [2019-01-13 04:40:56,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:40:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 24388 states and 77655 transitions. [2019-01-13 04:40:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-13 04:40:56,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:56,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:56,560 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1035949226, now seen corresponding path program 1 times [2019-01-13 04:40:56,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:56,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:56,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:56,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:56,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-13 04:40:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 04:40:56,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 04:40:56,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-13 04:40:56,877 INFO L87 Difference]: Start difference. First operand 24388 states and 77655 transitions. Second operand 9 states. [2019-01-13 04:40:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:57,441 INFO L93 Difference]: Finished difference Result 27795 states and 87960 transitions. [2019-01-13 04:40:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:40:57,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-01-13 04:40:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:57,487 INFO L225 Difference]: With dead ends: 27795 [2019-01-13 04:40:57,487 INFO L226 Difference]: Without dead ends: 27795 [2019-01-13 04:40:57,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:40:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27795 states. [2019-01-13 04:40:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27795 to 24843. [2019-01-13 04:40:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24843 states. [2019-01-13 04:40:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 78959 transitions. [2019-01-13 04:40:58,177 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 78959 transitions. Word has length 109 [2019-01-13 04:40:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:58,177 INFO L480 AbstractCegarLoop]: Abstraction has 24843 states and 78959 transitions. [2019-01-13 04:40:58,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 04:40:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 78959 transitions. [2019-01-13 04:40:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-13 04:40:58,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:58,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:58,209 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:58,210 INFO L82 PathProgramCache]: Analyzing trace with hash -771505237, now seen corresponding path program 1 times [2019-01-13 04:40:58,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:58,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:58,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:58,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:58,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:40:58,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:40:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:40:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:40:58,329 INFO L87 Difference]: Start difference. First operand 24843 states and 78959 transitions. Second operand 3 states. [2019-01-13 04:40:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:58,576 INFO L93 Difference]: Finished difference Result 22113 states and 68995 transitions. [2019-01-13 04:40:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:40:58,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-13 04:40:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:58,623 INFO L225 Difference]: With dead ends: 22113 [2019-01-13 04:40:58,623 INFO L226 Difference]: Without dead ends: 21508 [2019-01-13 04:40:58,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:40:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21508 states. [2019-01-13 04:40:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21508 to 21508. [2019-01-13 04:40:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21508 states. [2019-01-13 04:40:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21508 states to 21508 states and 67016 transitions. [2019-01-13 04:40:58,933 INFO L78 Accepts]: Start accepts. Automaton has 21508 states and 67016 transitions. Word has length 109 [2019-01-13 04:40:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:58,934 INFO L480 AbstractCegarLoop]: Abstraction has 21508 states and 67016 transitions. [2019-01-13 04:40:58,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:40:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21508 states and 67016 transitions. [2019-01-13 04:40:58,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 04:40:58,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:58,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:58,961 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:58,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:58,961 INFO L82 PathProgramCache]: Analyzing trace with hash -197721459, now seen corresponding path program 1 times [2019-01-13 04:40:58,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:58,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:58,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:58,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:40:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:40:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:40:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 04:40:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 04:40:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 04:40:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 04:40:59,160 INFO L87 Difference]: Start difference. First operand 21508 states and 67016 transitions. Second operand 5 states. [2019-01-13 04:40:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:40:59,484 INFO L93 Difference]: Finished difference Result 26863 states and 82922 transitions. [2019-01-13 04:40:59,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:40:59,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-01-13 04:40:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:40:59,527 INFO L225 Difference]: With dead ends: 26863 [2019-01-13 04:40:59,527 INFO L226 Difference]: Without dead ends: 26053 [2019-01-13 04:40:59,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:40:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2019-01-13 04:40:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 20968. [2019-01-13 04:40:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20968 states. [2019-01-13 04:40:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20968 states to 20968 states and 65059 transitions. [2019-01-13 04:40:59,839 INFO L78 Accepts]: Start accepts. Automaton has 20968 states and 65059 transitions. Word has length 111 [2019-01-13 04:40:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:40:59,840 INFO L480 AbstractCegarLoop]: Abstraction has 20968 states and 65059 transitions. [2019-01-13 04:40:59,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 04:40:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20968 states and 65059 transitions. [2019-01-13 04:40:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 04:40:59,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:40:59,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:40:59,867 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:40:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:40:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash 763892558, now seen corresponding path program 1 times [2019-01-13 04:40:59,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:40:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:40:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:59,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:40:59,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:40:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:00,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:00,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:41:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:41:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:41:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:41:00,720 INFO L87 Difference]: Start difference. First operand 20968 states and 65059 transitions. Second operand 7 states. [2019-01-13 04:41:01,580 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-13 04:41:02,065 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-13 04:41:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:02,947 INFO L93 Difference]: Finished difference Result 25591 states and 79949 transitions. [2019-01-13 04:41:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 04:41:02,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2019-01-13 04:41:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:02,989 INFO L225 Difference]: With dead ends: 25591 [2019-01-13 04:41:02,989 INFO L226 Difference]: Without dead ends: 25591 [2019-01-13 04:41:02,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:41:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25591 states. [2019-01-13 04:41:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25591 to 19113. [2019-01-13 04:41:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19113 states. [2019-01-13 04:41:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19113 states to 19113 states and 59120 transitions. [2019-01-13 04:41:03,287 INFO L78 Accepts]: Start accepts. Automaton has 19113 states and 59120 transitions. Word has length 111 [2019-01-13 04:41:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:03,287 INFO L480 AbstractCegarLoop]: Abstraction has 19113 states and 59120 transitions. [2019-01-13 04:41:03,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:41:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 19113 states and 59120 transitions. [2019-01-13 04:41:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 04:41:03,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:03,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:03,312 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2008657039, now seen corresponding path program 1 times [2019-01-13 04:41:03,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:03,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:41:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:03,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:03,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 04:41:03,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 04:41:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 04:41:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 04:41:03,570 INFO L87 Difference]: Start difference. First operand 19113 states and 59120 transitions. Second operand 8 states. [2019-01-13 04:41:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:04,026 INFO L93 Difference]: Finished difference Result 21233 states and 66004 transitions. [2019-01-13 04:41:04,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:41:04,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2019-01-13 04:41:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:04,070 INFO L225 Difference]: With dead ends: 21233 [2019-01-13 04:41:04,070 INFO L226 Difference]: Without dead ends: 21233 [2019-01-13 04:41:04,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-13 04:41:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21233 states. [2019-01-13 04:41:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21233 to 18221. [2019-01-13 04:41:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18221 states. [2019-01-13 04:41:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18221 states to 18221 states and 56372 transitions. [2019-01-13 04:41:04,340 INFO L78 Accepts]: Start accepts. Automaton has 18221 states and 56372 transitions. Word has length 111 [2019-01-13 04:41:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:04,340 INFO L480 AbstractCegarLoop]: Abstraction has 18221 states and 56372 transitions. [2019-01-13 04:41:04,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 04:41:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18221 states and 56372 transitions. [2019-01-13 04:41:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-13 04:41:04,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:04,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:04,362 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 201202576, now seen corresponding path program 1 times [2019-01-13 04:41:04,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:04,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:41:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:04,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 04:41:04,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 04:41:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 04:41:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:41:04,461 INFO L87 Difference]: Start difference. First operand 18221 states and 56372 transitions. Second operand 3 states. [2019-01-13 04:41:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:04,563 INFO L93 Difference]: Finished difference Result 18221 states and 56308 transitions. [2019-01-13 04:41:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 04:41:04,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-01-13 04:41:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:04,593 INFO L225 Difference]: With dead ends: 18221 [2019-01-13 04:41:04,593 INFO L226 Difference]: Without dead ends: 18221 [2019-01-13 04:41:04,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 04:41:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18221 states. [2019-01-13 04:41:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18221 to 18221. [2019-01-13 04:41:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18221 states. [2019-01-13 04:41:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18221 states to 18221 states and 56308 transitions. [2019-01-13 04:41:04,823 INFO L78 Accepts]: Start accepts. Automaton has 18221 states and 56308 transitions. Word has length 111 [2019-01-13 04:41:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:04,824 INFO L480 AbstractCegarLoop]: Abstraction has 18221 states and 56308 transitions. [2019-01-13 04:41:04,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 04:41:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 18221 states and 56308 transitions. [2019-01-13 04:41:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 04:41:04,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:04,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:04,845 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -749305669, now seen corresponding path program 1 times [2019-01-13 04:41:04,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:04,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:41:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:05,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:05,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 04:41:05,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 04:41:05,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 04:41:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 04:41:05,085 INFO L87 Difference]: Start difference. First operand 18221 states and 56308 transitions. Second operand 7 states. [2019-01-13 04:41:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:05,333 INFO L93 Difference]: Finished difference Result 21773 states and 67636 transitions. [2019-01-13 04:41:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 04:41:05,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-01-13 04:41:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:05,346 INFO L225 Difference]: With dead ends: 21773 [2019-01-13 04:41:05,346 INFO L226 Difference]: Without dead ends: 7109 [2019-01-13 04:41:05,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-13 04:41:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2019-01-13 04:41:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 7109. [2019-01-13 04:41:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7109 states. [2019-01-13 04:41:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7109 states to 7109 states and 19664 transitions. [2019-01-13 04:41:05,437 INFO L78 Accepts]: Start accepts. Automaton has 7109 states and 19664 transitions. Word has length 113 [2019-01-13 04:41:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:05,437 INFO L480 AbstractCegarLoop]: Abstraction has 7109 states and 19664 transitions. [2019-01-13 04:41:05,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 04:41:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 7109 states and 19664 transitions. [2019-01-13 04:41:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 04:41:05,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:05,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:05,447 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash -525683983, now seen corresponding path program 2 times [2019-01-13 04:41:05,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:05,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:05,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:41:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:06,055 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-13 04:41:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:06,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-01-13 04:41:06,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-13 04:41:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-13 04:41:06,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-13 04:41:06,338 INFO L87 Difference]: Start difference. First operand 7109 states and 19664 transitions. Second operand 20 states. [2019-01-13 04:41:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:07,366 INFO L93 Difference]: Finished difference Result 17611 states and 50584 transitions. [2019-01-13 04:41:07,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 04:41:07,367 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 113 [2019-01-13 04:41:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:07,394 INFO L225 Difference]: With dead ends: 17611 [2019-01-13 04:41:07,394 INFO L226 Difference]: Without dead ends: 17227 [2019-01-13 04:41:07,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2019-01-13 04:41:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17227 states. [2019-01-13 04:41:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17227 to 12311. [2019-01-13 04:41:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12311 states. [2019-01-13 04:41:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12311 states to 12311 states and 34034 transitions. [2019-01-13 04:41:07,592 INFO L78 Accepts]: Start accepts. Automaton has 12311 states and 34034 transitions. Word has length 113 [2019-01-13 04:41:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:07,593 INFO L480 AbstractCegarLoop]: Abstraction has 12311 states and 34034 transitions. [2019-01-13 04:41:07,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-13 04:41:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12311 states and 34034 transitions. [2019-01-13 04:41:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 04:41:07,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:07,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:07,608 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1217126352, now seen corresponding path program 1 times [2019-01-13 04:41:07,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:07,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:07,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 04:41:07,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 04:41:07,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 04:41:07,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 04:41:07,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-13 04:41:07,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 04:41:07,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 04:41:07,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-01-13 04:41:07,867 INFO L87 Difference]: Start difference. First operand 12311 states and 34034 transitions. Second operand 12 states. [2019-01-13 04:41:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 04:41:08,119 INFO L93 Difference]: Finished difference Result 15483 states and 44165 transitions. [2019-01-13 04:41:08,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 04:41:08,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2019-01-13 04:41:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 04:41:08,128 INFO L225 Difference]: With dead ends: 15483 [2019-01-13 04:41:08,128 INFO L226 Difference]: Without dead ends: 4519 [2019-01-13 04:41:08,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-01-13 04:41:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-01-13 04:41:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4339. [2019-01-13 04:41:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4339 states. [2019-01-13 04:41:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 12844 transitions. [2019-01-13 04:41:08,186 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 12844 transitions. Word has length 113 [2019-01-13 04:41:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 04:41:08,187 INFO L480 AbstractCegarLoop]: Abstraction has 4339 states and 12844 transitions. [2019-01-13 04:41:08,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 04:41:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 12844 transitions. [2019-01-13 04:41:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-13 04:41:08,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 04:41:08,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 04:41:08,193 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 04:41:08,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 04:41:08,193 INFO L82 PathProgramCache]: Analyzing trace with hash -646824221, now seen corresponding path program 3 times [2019-01-13 04:41:08,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 04:41:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 04:41:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:08,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 04:41:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 04:41:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:41:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 04:41:08,344 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 04:41:08,614 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 04:41:08,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 04:41:08 BasicIcfg [2019-01-13 04:41:08,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 04:41:08,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 04:41:08,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 04:41:08,618 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 04:41:08,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 04:38:26" (3/4) ... [2019-01-13 04:41:08,622 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-13 04:41:08,923 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 04:41:08,923 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 04:41:08,924 INFO L168 Benchmark]: Toolchain (without parser) took 165417.16 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 947.3 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-13 04:41:08,925 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:41:08,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 973.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-01-13 04:41:08,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:41:08,931 INFO L168 Benchmark]: Boogie Preprocessor took 61.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 04:41:08,931 INFO L168 Benchmark]: RCFGBuilder took 1641.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-01-13 04:41:08,931 INFO L168 Benchmark]: TraceAbstraction took 162355.90 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-01-13 04:41:08,932 INFO L168 Benchmark]: Witness Printer took 305.64 ms. Allocated memory is still 6.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. [2019-01-13 04:41:08,938 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 973.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1641.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 162355.90 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 305.64 ms. Allocated memory is still 6.4 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L673] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L675] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 _Bool __unbuffered_p0_EAX$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0] [L677] -1 int __unbuffered_p0_EAX$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0] [L678] -1 _Bool __unbuffered_p0_EAX$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0] [L679] -1 _Bool __unbuffered_p0_EAX$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0] [L680] -1 _Bool __unbuffered_p0_EAX$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0] [L681] -1 _Bool __unbuffered_p0_EAX$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0] [L682] -1 _Bool __unbuffered_p0_EAX$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0] [L683] -1 _Bool __unbuffered_p0_EAX$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0] [L684] -1 _Bool __unbuffered_p0_EAX$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0] [L685] -1 _Bool __unbuffered_p0_EAX$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0] [L686] -1 _Bool __unbuffered_p0_EAX$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0] [L687] -1 int *__unbuffered_p0_EAX$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}] [L688] -1 int __unbuffered_p0_EAX$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0] [L689] -1 _Bool __unbuffered_p0_EAX$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0] [L690] -1 int __unbuffered_p0_EAX$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0] [L691] -1 _Bool __unbuffered_p0_EAX$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0] [L693] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0] [L695] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}] [L702] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0] [L703] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0] [L704] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L705] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L706] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L707] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L708] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L709] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L712] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L713] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L714] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L715] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L716] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L717] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] -1 _Bool weak$$choice1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 pthread_t t2099; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK -1 pthread_create(&t2099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -1 pthread_t t2100; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L725] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L726] 0 y$flush_delayed = weak$$choice2 [L727] EXPR 0 \read(y) [L727] 0 y$mem_tmp = y [L728] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L729] EXPR 0 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L729] EXPR 0 \read(y) [L729] EXPR 0 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) VAL [!y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L730] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L731] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L731] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L801] FCALL, FORK -1 pthread_create(&t2100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -1 pthread_t t2101; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L803] FCALL, FORK -1 pthread_create(&t2101, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L734] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L735] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={1:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L736] 0 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L737] 0 __unbuffered_p0_EAX$read_delayed_var = &y [L738] EXPR 0 \read(y) [L738] 0 __unbuffered_p0_EAX = y [L739] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y = y$flush_delayed ? y$mem_tmp : y [L740] 0 y$flush_delayed = (_Bool)0 [L743] 0 __unbuffered_p0_EBX = x [L748] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 [L758] 1 x = 2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 __unbuffered_p2_EAX = x [L773] 2 y = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L776] EXPR 2 \read(y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y VAL [\read(y)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=1] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\read(y)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L809] EXPR -1 \read(y) [L809] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L812] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L813] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L816] -1 weak$$choice1 = __VERIFIER_nondet_bool() [L817] EXPR -1 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L817] EXPR -1 \read(*__unbuffered_p0_EAX$read_delayed_var) [L817] EXPR -1 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L818] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={1:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=2, y={1:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 307 locations, 1 error locations. UNSAFE Result, 162.0s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7366 SDtfs, 9615 SDslu, 21147 SDs, 0 SdLazy, 6039 SolverSat, 495 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 66 SyntacticMatches, 29 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247741occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 53.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 167909 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2387 ConstructedInterpolants, 0 QuantifiedInterpolants, 731180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...