./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer --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 5d7e08eb1aa42a48feeefe6b4b7860eb66c28d80 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-09 08:18:12,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:18:12,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:18:12,266 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:18:12,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:18:12,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:18:12,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:18:12,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:18:12,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:18:12,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:18:12,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:18:12,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:18:12,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:18:12,271 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:18:12,272 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:18:12,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:18:12,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:18:12,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:18:12,275 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:18:12,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:18:12,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:18:12,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:18:12,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:18:12,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:18:12,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:18:12,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:18:12,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:18:12,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:18:12,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:18:12,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:18:12,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:18:12,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:18:12,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:18:12,281 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:18:12,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:18:12,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:18:12,282 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 08:18:12,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:18:12,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:18:12,290 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:18:12,290 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:18:12,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 08:18:12,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:18:12,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:18:12,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:18:12,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:18:12,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:18:12,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:18:12,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:18:12,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 08:18:12,293 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:18:12,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:18:12,293 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer 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 -> 5d7e08eb1aa42a48feeefe6b4b7860eb66c28d80 [2018-12-09 08:18:12,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:18:12,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:18:12,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:18:12,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:18:12,322 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:18:12,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i [2018-12-09 08:18:12,364 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/data/ae9f257c5/bc9b4234833746648aa637f8d95c053f/FLAGa8451a0da [2018-12-09 08:18:12,800 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:18:12,801 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/sv-benchmarks/c/pthread-wmm/rfi000_tso.oepc_true-unreach-call.i [2018-12-09 08:18:12,808 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/data/ae9f257c5/bc9b4234833746648aa637f8d95c053f/FLAGa8451a0da [2018-12-09 08:18:12,818 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/data/ae9f257c5/bc9b4234833746648aa637f8d95c053f [2018-12-09 08:18:12,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:18:12,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:18:12,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:18:12,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:18:12,823 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:18:12,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:18:12" (1/1) ... [2018-12-09 08:18:12,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:12, skipping insertion in model container [2018-12-09 08:18:12,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:18:12" (1/1) ... [2018-12-09 08:18:12,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:18:12,857 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:18:13,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:18:13,062 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:18:13,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:18:13,178 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:18:13,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13 WrapperNode [2018-12-09 08:18:13,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:18:13,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:18:13,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:18:13,179 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:18:13,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:18:13,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:18:13,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:18:13,223 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:18:13,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... [2018-12-09 08:18:13,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:18:13,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:18:13,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:18:13,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:18:13,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/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 [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 08:18:13,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 08:18:13,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 08:18:13,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 08:18:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 08:18:13,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:18:13,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:18:13,283 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 08:18:13,710 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:18:13,710 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 08:18:13,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:18:13 BoogieIcfgContainer [2018-12-09 08:18:13,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:18:13,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:18:13,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:18:13,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:18:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:18:12" (1/3) ... [2018-12-09 08:18:13,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3cf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:18:13, skipping insertion in model container [2018-12-09 08:18:13,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:18:13" (2/3) ... [2018-12-09 08:18:13,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3cf0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:18:13, skipping insertion in model container [2018-12-09 08:18:13,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:18:13" (3/3) ... [2018-12-09 08:18:13,717 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc_true-unreach-call.i [2018-12-09 08:18:13,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,753 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,753 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,753 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,754 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,755 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,758 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,759 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,764 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,765 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,766 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,767 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,768 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,769 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,770 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,771 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,772 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,773 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,774 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,775 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,776 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,777 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,778 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,779 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,780 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 08:18:13,789 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 08:18:13,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:18:13,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 08:18:13,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 08:18:13,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:18:13,831 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:18:13,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:18:13,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:18:13,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:18:13,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:18:13,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:18:13,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:18:13,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:18:13,843 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-09 08:18:22,760 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125048 states. [2018-12-09 08:18:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 125048 states. [2018-12-09 08:18:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 08:18:22,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:22,767 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] [2018-12-09 08:18:22,769 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1224915915, now seen corresponding path program 1 times [2018-12-09 08:18:22,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:22,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:22,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:22,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:22,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:18:22,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:18:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:18:22,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:18:22,935 INFO L87 Difference]: Start difference. First operand 125048 states. Second operand 4 states. [2018-12-09 08:18:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:24,205 INFO L93 Difference]: Finished difference Result 240604 states and 990158 transitions. [2018-12-09 08:18:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:18:24,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 08:18:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:24,953 INFO L225 Difference]: With dead ends: 240604 [2018-12-09 08:18:24,953 INFO L226 Difference]: Without dead ends: 212996 [2018-12-09 08:18:24,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:18:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212996 states. [2018-12-09 08:18:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212996 to 112198. [2018-12-09 08:18:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112198 states. [2018-12-09 08:18:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112198 states to 112198 states and 465587 transitions. [2018-12-09 08:18:31,095 INFO L78 Accepts]: Start accepts. Automaton has 112198 states and 465587 transitions. Word has length 37 [2018-12-09 08:18:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:31,095 INFO L480 AbstractCegarLoop]: Abstraction has 112198 states and 465587 transitions. [2018-12-09 08:18:31,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:18:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112198 states and 465587 transitions. [2018-12-09 08:18:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 08:18:31,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:31,100 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] [2018-12-09 08:18:31,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:31,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash -694802140, now seen corresponding path program 1 times [2018-12-09 08:18:31,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:31,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:31,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:31,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:31,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:18:31,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:18:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:18:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:18:31,156 INFO L87 Difference]: Start difference. First operand 112198 states and 465587 transitions. Second operand 5 states. [2018-12-09 08:18:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:32,831 INFO L93 Difference]: Finished difference Result 337662 states and 1310633 transitions. [2018-12-09 08:18:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 08:18:32,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 08:18:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:35,732 INFO L225 Difference]: With dead ends: 337662 [2018-12-09 08:18:35,732 INFO L226 Difference]: Without dead ends: 337502 [2018-12-09 08:18:35,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:18:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337502 states. [2018-12-09 08:18:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337502 to 182336. [2018-12-09 08:18:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182336 states. [2018-12-09 08:18:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182336 states to 182336 states and 707538 transitions. [2018-12-09 08:18:41,621 INFO L78 Accepts]: Start accepts. Automaton has 182336 states and 707538 transitions. Word has length 44 [2018-12-09 08:18:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:41,622 INFO L480 AbstractCegarLoop]: Abstraction has 182336 states and 707538 transitions. [2018-12-09 08:18:41,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:18:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 182336 states and 707538 transitions. [2018-12-09 08:18:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 08:18:41,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:41,625 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] [2018-12-09 08:18:41,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:41,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash -7464308, now seen corresponding path program 1 times [2018-12-09 08:18:41,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:41,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:41,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:41,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:41,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:18:41,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:18:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:18:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:18:41,663 INFO L87 Difference]: Start difference. First operand 182336 states and 707538 transitions. Second operand 4 states. [2018-12-09 08:18:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:41,780 INFO L93 Difference]: Finished difference Result 39892 states and 138215 transitions. [2018-12-09 08:18:41,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:18:41,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 08:18:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:41,834 INFO L225 Difference]: With dead ends: 39892 [2018-12-09 08:18:41,834 INFO L226 Difference]: Without dead ends: 37019 [2018-12-09 08:18:41,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:18:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37019 states. [2018-12-09 08:18:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37019 to 37019. [2018-12-09 08:18:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37019 states. [2018-12-09 08:18:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37019 states to 37019 states and 128876 transitions. [2018-12-09 08:18:42,293 INFO L78 Accepts]: Start accepts. Automaton has 37019 states and 128876 transitions. Word has length 45 [2018-12-09 08:18:42,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:42,293 INFO L480 AbstractCegarLoop]: Abstraction has 37019 states and 128876 transitions. [2018-12-09 08:18:42,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:18:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 37019 states and 128876 transitions. [2018-12-09 08:18:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:18:42,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:42,296 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] [2018-12-09 08:18:42,296 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:42,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:42,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1439202624, now seen corresponding path program 1 times [2018-12-09 08:18:42,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:42,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:42,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:42,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:42,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:42,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:18:42,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:18:42,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:18:42,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:18:42,360 INFO L87 Difference]: Start difference. First operand 37019 states and 128876 transitions. Second operand 4 states. [2018-12-09 08:18:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:42,677 INFO L93 Difference]: Finished difference Result 49059 states and 166861 transitions. [2018-12-09 08:18:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:18:42,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 08:18:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:42,744 INFO L225 Difference]: With dead ends: 49059 [2018-12-09 08:18:42,744 INFO L226 Difference]: Without dead ends: 49059 [2018-12-09 08:18:42,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:18:43,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2018-12-09 08:18:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 42063. [2018-12-09 08:18:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42063 states. [2018-12-09 08:18:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42063 states to 42063 states and 144442 transitions. [2018-12-09 08:18:43,403 INFO L78 Accepts]: Start accepts. Automaton has 42063 states and 144442 transitions. Word has length 58 [2018-12-09 08:18:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:43,403 INFO L480 AbstractCegarLoop]: Abstraction has 42063 states and 144442 transitions. [2018-12-09 08:18:43,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:18:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42063 states and 144442 transitions. [2018-12-09 08:18:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:18:43,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:43,406 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] [2018-12-09 08:18:43,407 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:43,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -340567146, now seen corresponding path program 1 times [2018-12-09 08:18:43,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:43,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:43,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:43,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:43,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:18:43,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:18:43,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:18:43,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:18:43,462 INFO L87 Difference]: Start difference. First operand 42063 states and 144442 transitions. Second operand 4 states. [2018-12-09 08:18:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:44,156 INFO L93 Difference]: Finished difference Result 49638 states and 166843 transitions. [2018-12-09 08:18:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:18:44,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 08:18:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:44,229 INFO L225 Difference]: With dead ends: 49638 [2018-12-09 08:18:44,229 INFO L226 Difference]: Without dead ends: 49638 [2018-12-09 08:18:44,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:18:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2018-12-09 08:18:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 46731. [2018-12-09 08:18:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46731 states. [2018-12-09 08:18:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46731 states to 46731 states and 158580 transitions. [2018-12-09 08:18:44,805 INFO L78 Accepts]: Start accepts. Automaton has 46731 states and 158580 transitions. Word has length 58 [2018-12-09 08:18:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:44,806 INFO L480 AbstractCegarLoop]: Abstraction has 46731 states and 158580 transitions. [2018-12-09 08:18:44,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:18:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 46731 states and 158580 transitions. [2018-12-09 08:18:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 08:18:44,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:44,809 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] [2018-12-09 08:18:44,810 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:44,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1012742551, now seen corresponding path program 1 times [2018-12-09 08:18:44,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:44,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:44,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:44,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:44,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:44,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:18:44,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:18:44,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:18:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:18:44,853 INFO L87 Difference]: Start difference. First operand 46731 states and 158580 transitions. Second operand 6 states. [2018-12-09 08:18:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:45,550 INFO L93 Difference]: Finished difference Result 69263 states and 233515 transitions. [2018-12-09 08:18:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 08:18:45,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 08:18:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:45,651 INFO L225 Difference]: With dead ends: 69263 [2018-12-09 08:18:45,651 INFO L226 Difference]: Without dead ends: 69231 [2018-12-09 08:18:45,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:18:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69231 states. [2018-12-09 08:18:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69231 to 55787. [2018-12-09 08:18:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55787 states. [2018-12-09 08:18:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55787 states to 55787 states and 187260 transitions. [2018-12-09 08:18:46,645 INFO L78 Accepts]: Start accepts. Automaton has 55787 states and 187260 transitions. Word has length 58 [2018-12-09 08:18:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:46,645 INFO L480 AbstractCegarLoop]: Abstraction has 55787 states and 187260 transitions. [2018-12-09 08:18:46,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:18:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 55787 states and 187260 transitions. [2018-12-09 08:18:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 08:18:46,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:46,659 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] [2018-12-09 08:18:46,659 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:46,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1986386371, now seen corresponding path program 1 times [2018-12-09 08:18:46,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:46,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:46,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:18:46,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:18:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:18:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:18:46,735 INFO L87 Difference]: Start difference. First operand 55787 states and 187260 transitions. Second operand 7 states. [2018-12-09 08:18:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:48,413 INFO L93 Difference]: Finished difference Result 132794 states and 435152 transitions. [2018-12-09 08:18:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 08:18:48,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 08:18:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:48,620 INFO L225 Difference]: With dead ends: 132794 [2018-12-09 08:18:48,620 INFO L226 Difference]: Without dead ends: 132382 [2018-12-09 08:18:48,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2018-12-09 08:18:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132382 states. [2018-12-09 08:18:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132382 to 93545. [2018-12-09 08:18:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93545 states. [2018-12-09 08:18:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93545 states to 93545 states and 309427 transitions. [2018-12-09 08:18:50,055 INFO L78 Accepts]: Start accepts. Automaton has 93545 states and 309427 transitions. Word has length 72 [2018-12-09 08:18:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:50,056 INFO L480 AbstractCegarLoop]: Abstraction has 93545 states and 309427 transitions. [2018-12-09 08:18:50,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:18:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 93545 states and 309427 transitions. [2018-12-09 08:18:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 08:18:50,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:50,080 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] [2018-12-09 08:18:50,080 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:50,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1248674235, now seen corresponding path program 1 times [2018-12-09 08:18:50,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:50,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:50,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:50,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:50,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:50,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:50,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:18:50,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:18:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:18:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:18:50,134 INFO L87 Difference]: Start difference. First operand 93545 states and 309427 transitions. Second operand 7 states. [2018-12-09 08:18:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:51,390 INFO L93 Difference]: Finished difference Result 118197 states and 390628 transitions. [2018-12-09 08:18:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 08:18:51,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 08:18:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:51,561 INFO L225 Difference]: With dead ends: 118197 [2018-12-09 08:18:51,561 INFO L226 Difference]: Without dead ends: 118133 [2018-12-09 08:18:51,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 08:18:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118133 states. [2018-12-09 08:18:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118133 to 102417. [2018-12-09 08:18:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102417 states. [2018-12-09 08:18:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102417 states to 102417 states and 336813 transitions. [2018-12-09 08:18:52,907 INFO L78 Accepts]: Start accepts. Automaton has 102417 states and 336813 transitions. Word has length 72 [2018-12-09 08:18:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:52,907 INFO L480 AbstractCegarLoop]: Abstraction has 102417 states and 336813 transitions. [2018-12-09 08:18:52,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:18:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 102417 states and 336813 transitions. [2018-12-09 08:18:52,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 08:18:52,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:52,938 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] [2018-12-09 08:18:52,938 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:52,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash 21000313, now seen corresponding path program 1 times [2018-12-09 08:18:52,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:52,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:52,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:52,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:52,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:52,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:18:52,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:18:52,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:18:52,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:18:52,970 INFO L87 Difference]: Start difference. First operand 102417 states and 336813 transitions. Second operand 3 states. [2018-12-09 08:18:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:53,469 INFO L93 Difference]: Finished difference Result 153893 states and 493160 transitions. [2018-12-09 08:18:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:18:53,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-09 08:18:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:53,706 INFO L225 Difference]: With dead ends: 153893 [2018-12-09 08:18:53,706 INFO L226 Difference]: Without dead ends: 153893 [2018-12-09 08:18:53,706 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 [2018-12-09 08:18:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153893 states. [2018-12-09 08:18:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153893 to 130553. [2018-12-09 08:18:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130553 states. [2018-12-09 08:18:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130553 states to 130553 states and 421076 transitions. [2018-12-09 08:18:55,603 INFO L78 Accepts]: Start accepts. Automaton has 130553 states and 421076 transitions. Word has length 74 [2018-12-09 08:18:55,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:18:55,603 INFO L480 AbstractCegarLoop]: Abstraction has 130553 states and 421076 transitions. [2018-12-09 08:18:55,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:18:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 130553 states and 421076 transitions. [2018-12-09 08:18:55,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 08:18:55,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:18:55,641 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] [2018-12-09 08:18:55,641 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:18:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:18:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 744217605, now seen corresponding path program 1 times [2018-12-09 08:18:55,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:18:55,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:18:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:55,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:18:55,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:18:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:18:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:18:55,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:18:55,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 08:18:55,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 08:18:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 08:18:55,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:18:55,748 INFO L87 Difference]: Start difference. First operand 130553 states and 421076 transitions. Second operand 10 states. [2018-12-09 08:18:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:18:59,150 INFO L93 Difference]: Finished difference Result 175379 states and 548653 transitions. [2018-12-09 08:18:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 08:18:59,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-09 08:18:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:18:59,417 INFO L225 Difference]: With dead ends: 175379 [2018-12-09 08:18:59,418 INFO L226 Difference]: Without dead ends: 175315 [2018-12-09 08:18:59,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 08:18:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175315 states. [2018-12-09 08:19:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175315 to 143179. [2018-12-09 08:19:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143179 states. [2018-12-09 08:19:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143179 states to 143179 states and 455731 transitions. [2018-12-09 08:19:01,614 INFO L78 Accepts]: Start accepts. Automaton has 143179 states and 455731 transitions. Word has length 78 [2018-12-09 08:19:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:01,615 INFO L480 AbstractCegarLoop]: Abstraction has 143179 states and 455731 transitions. [2018-12-09 08:19:01,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 08:19:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 143179 states and 455731 transitions. [2018-12-09 08:19:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 08:19:01,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:01,669 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] [2018-12-09 08:19:01,670 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:01,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:01,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2021084142, now seen corresponding path program 1 times [2018-12-09 08:19:01,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:01,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:01,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:01,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:01,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:19:01,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:19:01,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:19:01,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:19:01,727 INFO L87 Difference]: Start difference. First operand 143179 states and 455731 transitions. Second operand 6 states. [2018-12-09 08:19:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:02,814 INFO L93 Difference]: Finished difference Result 255899 states and 819251 transitions. [2018-12-09 08:19:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:19:02,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 08:19:02,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:03,261 INFO L225 Difference]: With dead ends: 255899 [2018-12-09 08:19:03,261 INFO L226 Difference]: Without dead ends: 255899 [2018-12-09 08:19:03,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255899 states. [2018-12-09 08:19:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255899 to 140438. [2018-12-09 08:19:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140438 states. [2018-12-09 08:19:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140438 states to 140438 states and 446234 transitions. [2018-12-09 08:19:05,863 INFO L78 Accepts]: Start accepts. Automaton has 140438 states and 446234 transitions. Word has length 81 [2018-12-09 08:19:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:05,863 INFO L480 AbstractCegarLoop]: Abstraction has 140438 states and 446234 transitions. [2018-12-09 08:19:05,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:19:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 140438 states and 446234 transitions. [2018-12-09 08:19:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 08:19:05,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:05,908 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] [2018-12-09 08:19:05,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:05,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -548402257, now seen corresponding path program 1 times [2018-12-09 08:19:05,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:05,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:05,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:05,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:05,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 08:19:05,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 08:19:05,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 08:19:05,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 08:19:05,942 INFO L87 Difference]: Start difference. First operand 140438 states and 446234 transitions. Second operand 3 states. [2018-12-09 08:19:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:06,340 INFO L93 Difference]: Finished difference Result 135058 states and 424811 transitions. [2018-12-09 08:19:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 08:19:06,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 08:19:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:06,537 INFO L225 Difference]: With dead ends: 135058 [2018-12-09 08:19:06,537 INFO L226 Difference]: Without dead ends: 134898 [2018-12-09 08:19:06,538 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 [2018-12-09 08:19:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134898 states. [2018-12-09 08:19:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134898 to 134706. [2018-12-09 08:19:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134706 states. [2018-12-09 08:19:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134706 states to 134706 states and 423907 transitions. [2018-12-09 08:19:08,498 INFO L78 Accepts]: Start accepts. Automaton has 134706 states and 423907 transitions. Word has length 81 [2018-12-09 08:19:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:08,498 INFO L480 AbstractCegarLoop]: Abstraction has 134706 states and 423907 transitions. [2018-12-09 08:19:08,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 08:19:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 134706 states and 423907 transitions. [2018-12-09 08:19:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 08:19:08,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:08,539 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] [2018-12-09 08:19:08,539 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:08,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:08,539 INFO L82 PathProgramCache]: Analyzing trace with hash 263975479, now seen corresponding path program 1 times [2018-12-09 08:19:08,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:08,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:08,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:08,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:08,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:08,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:19:08,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:19:08,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:19:08,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:19:08,585 INFO L87 Difference]: Start difference. First operand 134706 states and 423907 transitions. Second operand 5 states. [2018-12-09 08:19:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:08,633 INFO L93 Difference]: Finished difference Result 14686 states and 36728 transitions. [2018-12-09 08:19:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:19:08,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 08:19:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:08,642 INFO L225 Difference]: With dead ends: 14686 [2018-12-09 08:19:08,642 INFO L226 Difference]: Without dead ends: 11258 [2018-12-09 08:19:08,643 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 [2018-12-09 08:19:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11258 states. [2018-12-09 08:19:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11258 to 8612. [2018-12-09 08:19:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8612 states. [2018-12-09 08:19:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8612 states to 8612 states and 21184 transitions. [2018-12-09 08:19:08,722 INFO L78 Accepts]: Start accepts. Automaton has 8612 states and 21184 transitions. Word has length 82 [2018-12-09 08:19:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:08,723 INFO L480 AbstractCegarLoop]: Abstraction has 8612 states and 21184 transitions. [2018-12-09 08:19:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:19:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8612 states and 21184 transitions. [2018-12-09 08:19:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:08,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:08,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:08,728 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:08,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -440780413, now seen corresponding path program 1 times [2018-12-09 08:19:08,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:08,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:08,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:08,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:08,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:19:08,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:19:08,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:19:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:19:08,761 INFO L87 Difference]: Start difference. First operand 8612 states and 21184 transitions. Second operand 4 states. [2018-12-09 08:19:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:08,878 INFO L93 Difference]: Finished difference Result 9320 states and 22880 transitions. [2018-12-09 08:19:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 08:19:08,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 08:19:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:08,885 INFO L225 Difference]: With dead ends: 9320 [2018-12-09 08:19:08,885 INFO L226 Difference]: Without dead ends: 9320 [2018-12-09 08:19:08,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:19:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2018-12-09 08:19:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8732. [2018-12-09 08:19:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2018-12-09 08:19:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 21456 transitions. [2018-12-09 08:19:08,949 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 21456 transitions. Word has length 127 [2018-12-09 08:19:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:08,949 INFO L480 AbstractCegarLoop]: Abstraction has 8732 states and 21456 transitions. [2018-12-09 08:19:08,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:19:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 21456 transitions. [2018-12-09 08:19:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:08,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:08,955 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:08,955 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:08,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1624127710, now seen corresponding path program 1 times [2018-12-09 08:19:08,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:08,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:08,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:08,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:09,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:19:09,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:19:09,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:19:09,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:09,021 INFO L87 Difference]: Start difference. First operand 8732 states and 21456 transitions. Second operand 7 states. [2018-12-09 08:19:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:09,723 INFO L93 Difference]: Finished difference Result 23569 states and 56337 transitions. [2018-12-09 08:19:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 08:19:09,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 08:19:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:09,739 INFO L225 Difference]: With dead ends: 23569 [2018-12-09 08:19:09,739 INFO L226 Difference]: Without dead ends: 23449 [2018-12-09 08:19:09,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-12-09 08:19:09,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23449 states. [2018-12-09 08:19:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23449 to 9859. [2018-12-09 08:19:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9859 states. [2018-12-09 08:19:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9859 states to 9859 states and 24190 transitions. [2018-12-09 08:19:09,858 INFO L78 Accepts]: Start accepts. Automaton has 9859 states and 24190 transitions. Word has length 127 [2018-12-09 08:19:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:09,859 INFO L480 AbstractCegarLoop]: Abstraction has 9859 states and 24190 transitions. [2018-12-09 08:19:09,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:19:09,859 INFO L276 IsEmpty]: Start isEmpty. Operand 9859 states and 24190 transitions. [2018-12-09 08:19:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:09,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:09,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:09,865 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:09,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1879449917, now seen corresponding path program 1 times [2018-12-09 08:19:09,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:09,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:09,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:09,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:09,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:09,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:19:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 08:19:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 08:19:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:09,964 INFO L87 Difference]: Start difference. First operand 9859 states and 24190 transitions. Second operand 8 states. [2018-12-09 08:19:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:10,271 INFO L93 Difference]: Finished difference Result 17230 states and 40640 transitions. [2018-12-09 08:19:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 08:19:10,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 08:19:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:10,282 INFO L225 Difference]: With dead ends: 17230 [2018-12-09 08:19:10,282 INFO L226 Difference]: Without dead ends: 17153 [2018-12-09 08:19:10,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:19:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17153 states. [2018-12-09 08:19:10,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17153 to 14025. [2018-12-09 08:19:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14025 states. [2018-12-09 08:19:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14025 states to 14025 states and 33655 transitions. [2018-12-09 08:19:10,403 INFO L78 Accepts]: Start accepts. Automaton has 14025 states and 33655 transitions. Word has length 127 [2018-12-09 08:19:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:10,403 INFO L480 AbstractCegarLoop]: Abstraction has 14025 states and 33655 transitions. [2018-12-09 08:19:10,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 08:19:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14025 states and 33655 transitions. [2018-12-09 08:19:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:10,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:10,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:10,412 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:10,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1667042851, now seen corresponding path program 2 times [2018-12-09 08:19:10,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:10,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:10,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:19:10,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 08:19:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 08:19:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:10,493 INFO L87 Difference]: Start difference. First operand 14025 states and 33655 transitions. Second operand 8 states. [2018-12-09 08:19:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:11,497 INFO L93 Difference]: Finished difference Result 22171 states and 51986 transitions. [2018-12-09 08:19:11,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:19:11,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 08:19:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:11,511 INFO L225 Difference]: With dead ends: 22171 [2018-12-09 08:19:11,512 INFO L226 Difference]: Without dead ends: 22171 [2018-12-09 08:19:11,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 08:19:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22171 states. [2018-12-09 08:19:11,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22171 to 14452. [2018-12-09 08:19:11,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2018-12-09 08:19:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 34729 transitions. [2018-12-09 08:19:11,654 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 34729 transitions. Word has length 127 [2018-12-09 08:19:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:11,654 INFO L480 AbstractCegarLoop]: Abstraction has 14452 states and 34729 transitions. [2018-12-09 08:19:11,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 08:19:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 34729 transitions. [2018-12-09 08:19:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:11,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:11,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:11,665 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:11,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash -705428834, now seen corresponding path program 1 times [2018-12-09 08:19:11,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:11,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:19:11,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:11,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:11,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:19:11,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:19:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:19:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:11,749 INFO L87 Difference]: Start difference. First operand 14452 states and 34729 transitions. Second operand 7 states. [2018-12-09 08:19:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:12,018 INFO L93 Difference]: Finished difference Result 13462 states and 32120 transitions. [2018-12-09 08:19:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:19:12,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 08:19:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:12,028 INFO L225 Difference]: With dead ends: 13462 [2018-12-09 08:19:12,028 INFO L226 Difference]: Without dead ends: 13462 [2018-12-09 08:19:12,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:19:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13462 states. [2018-12-09 08:19:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13462 to 11087. [2018-12-09 08:19:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11087 states. [2018-12-09 08:19:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11087 states to 11087 states and 26421 transitions. [2018-12-09 08:19:12,227 INFO L78 Accepts]: Start accepts. Automaton has 11087 states and 26421 transitions. Word has length 127 [2018-12-09 08:19:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:12,227 INFO L480 AbstractCegarLoop]: Abstraction has 11087 states and 26421 transitions. [2018-12-09 08:19:12,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:19:12,227 INFO L276 IsEmpty]: Start isEmpty. Operand 11087 states and 26421 transitions. [2018-12-09 08:19:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:12,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:12,234 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:12,234 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:12,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:12,234 INFO L82 PathProgramCache]: Analyzing trace with hash 577980798, now seen corresponding path program 1 times [2018-12-09 08:19:12,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:12,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:12,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:12,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:12,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:12,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:19:12,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:19:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:19:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:19:12,282 INFO L87 Difference]: Start difference. First operand 11087 states and 26421 transitions. Second operand 6 states. [2018-12-09 08:19:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:12,582 INFO L93 Difference]: Finished difference Result 13770 states and 32769 transitions. [2018-12-09 08:19:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 08:19:12,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 08:19:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:12,591 INFO L225 Difference]: With dead ends: 13770 [2018-12-09 08:19:12,591 INFO L226 Difference]: Without dead ends: 13770 [2018-12-09 08:19:12,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 08:19:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13770 states. [2018-12-09 08:19:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13770 to 11081. [2018-12-09 08:19:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11081 states. [2018-12-09 08:19:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11081 states to 11081 states and 26416 transitions. [2018-12-09 08:19:12,681 INFO L78 Accepts]: Start accepts. Automaton has 11081 states and 26416 transitions. Word has length 127 [2018-12-09 08:19:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 11081 states and 26416 transitions. [2018-12-09 08:19:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:19:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11081 states and 26416 transitions. [2018-12-09 08:19:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:12,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:12,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:12,688 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:12,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 774255455, now seen corresponding path program 1 times [2018-12-09 08:19:12,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:12,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:12,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:12,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:12,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:19:12,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 08:19:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 08:19:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:12,756 INFO L87 Difference]: Start difference. First operand 11081 states and 26416 transitions. Second operand 8 states. [2018-12-09 08:19:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:12,993 INFO L93 Difference]: Finished difference Result 11622 states and 27570 transitions. [2018-12-09 08:19:12,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:19:12,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 08:19:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:13,001 INFO L225 Difference]: With dead ends: 11622 [2018-12-09 08:19:13,001 INFO L226 Difference]: Without dead ends: 11622 [2018-12-09 08:19:13,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:19:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11622 states. [2018-12-09 08:19:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11622 to 11183. [2018-12-09 08:19:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11183 states. [2018-12-09 08:19:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 26614 transitions. [2018-12-09 08:19:13,083 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 26614 transitions. Word has length 127 [2018-12-09 08:19:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:13,083 INFO L480 AbstractCegarLoop]: Abstraction has 11183 states and 26614 transitions. [2018-12-09 08:19:13,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 08:19:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 26614 transitions. [2018-12-09 08:19:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:13,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:13,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:13,091 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:13,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash -909868894, now seen corresponding path program 1 times [2018-12-09 08:19:13,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:13,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:13,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:13,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 08:19:13,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 08:19:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 08:19:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 08:19:13,135 INFO L87 Difference]: Start difference. First operand 11183 states and 26614 transitions. Second operand 4 states. [2018-12-09 08:19:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:13,196 INFO L93 Difference]: Finished difference Result 11023 states and 26086 transitions. [2018-12-09 08:19:13,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:19:13,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 08:19:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:13,203 INFO L225 Difference]: With dead ends: 11023 [2018-12-09 08:19:13,203 INFO L226 Difference]: Without dead ends: 11023 [2018-12-09 08:19:13,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:19:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11023 states. [2018-12-09 08:19:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11023 to 10302. [2018-12-09 08:19:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2018-12-09 08:19:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 24402 transitions. [2018-12-09 08:19:13,279 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 24402 transitions. Word has length 127 [2018-12-09 08:19:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:13,279 INFO L480 AbstractCegarLoop]: Abstraction has 10302 states and 24402 transitions. [2018-12-09 08:19:13,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 08:19:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 24402 transitions. [2018-12-09 08:19:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:13,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:13,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:13,285 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:13,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -713594237, now seen corresponding path program 1 times [2018-12-09 08:19:13,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:13,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:13,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:13,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:19:13,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:19:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:19:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:19:13,335 INFO L87 Difference]: Start difference. First operand 10302 states and 24402 transitions. Second operand 5 states. [2018-12-09 08:19:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:13,379 INFO L93 Difference]: Finished difference Result 12213 states and 28711 transitions. [2018-12-09 08:19:13,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 08:19:13,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 08:19:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:13,391 INFO L225 Difference]: With dead ends: 12213 [2018-12-09 08:19:13,392 INFO L226 Difference]: Without dead ends: 12213 [2018-12-09 08:19:13,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:19:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12213 states. [2018-12-09 08:19:13,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12213 to 8777. [2018-12-09 08:19:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8777 states. [2018-12-09 08:19:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8777 states to 8777 states and 20336 transitions. [2018-12-09 08:19:13,471 INFO L78 Accepts]: Start accepts. Automaton has 8777 states and 20336 transitions. Word has length 127 [2018-12-09 08:19:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:13,472 INFO L480 AbstractCegarLoop]: Abstraction has 8777 states and 20336 transitions. [2018-12-09 08:19:13,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:19:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8777 states and 20336 transitions. [2018-12-09 08:19:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:13,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:13,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:13,478 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:13,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1628592957, now seen corresponding path program 1 times [2018-12-09 08:19:13,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:13,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:13,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:13,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:13,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 08:19:13,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 08:19:13,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 08:19:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 08:19:13,533 INFO L87 Difference]: Start difference. First operand 8777 states and 20336 transitions. Second operand 5 states. [2018-12-09 08:19:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:13,671 INFO L93 Difference]: Finished difference Result 9225 states and 21440 transitions. [2018-12-09 08:19:13,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:19:13,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 08:19:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:13,677 INFO L225 Difference]: With dead ends: 9225 [2018-12-09 08:19:13,677 INFO L226 Difference]: Without dead ends: 9193 [2018-12-09 08:19:13,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9193 states. [2018-12-09 08:19:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9193 to 8825. [2018-12-09 08:19:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8825 states. [2018-12-09 08:19:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8825 states to 8825 states and 20440 transitions. [2018-12-09 08:19:13,737 INFO L78 Accepts]: Start accepts. Automaton has 8825 states and 20440 transitions. Word has length 127 [2018-12-09 08:19:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:13,737 INFO L480 AbstractCegarLoop]: Abstraction has 8825 states and 20440 transitions. [2018-12-09 08:19:13,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 08:19:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8825 states and 20440 transitions. [2018-12-09 08:19:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:13,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:13,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:13,742 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:13,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -383828476, now seen corresponding path program 1 times [2018-12-09 08:19:13,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:13,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:13,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:13,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:13,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:19:13,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:19:13,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:19:13,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:19:13,797 INFO L87 Difference]: Start difference. First operand 8825 states and 20440 transitions. Second operand 6 states. [2018-12-09 08:19:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:14,017 INFO L93 Difference]: Finished difference Result 9677 states and 22122 transitions. [2018-12-09 08:19:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:19:14,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 08:19:14,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:14,023 INFO L225 Difference]: With dead ends: 9677 [2018-12-09 08:19:14,023 INFO L226 Difference]: Without dead ends: 9677 [2018-12-09 08:19:14,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2018-12-09 08:19:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 9128. [2018-12-09 08:19:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9128 states. [2018-12-09 08:19:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 20999 transitions. [2018-12-09 08:19:14,087 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 20999 transitions. Word has length 127 [2018-12-09 08:19:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:14,087 INFO L480 AbstractCegarLoop]: Abstraction has 9128 states and 20999 transitions. [2018-12-09 08:19:14,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:19:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 20999 transitions. [2018-12-09 08:19:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:14,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:14,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:14,093 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:14,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:14,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1430777416, now seen corresponding path program 2 times [2018-12-09 08:19:14,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:14,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:14,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:14,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:14,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:19:14,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:19:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:19:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:14,149 INFO L87 Difference]: Start difference. First operand 9128 states and 20999 transitions. Second operand 7 states. [2018-12-09 08:19:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:14,497 INFO L93 Difference]: Finished difference Result 11928 states and 26926 transitions. [2018-12-09 08:19:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 08:19:14,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 08:19:14,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:14,504 INFO L225 Difference]: With dead ends: 11928 [2018-12-09 08:19:14,505 INFO L226 Difference]: Without dead ends: 11928 [2018-12-09 08:19:14,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:19:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11928 states. [2018-12-09 08:19:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11928 to 9429. [2018-12-09 08:19:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9429 states. [2018-12-09 08:19:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9429 states to 9429 states and 21657 transitions. [2018-12-09 08:19:14,578 INFO L78 Accepts]: Start accepts. Automaton has 9429 states and 21657 transitions. Word has length 127 [2018-12-09 08:19:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:14,578 INFO L480 AbstractCegarLoop]: Abstraction has 9429 states and 21657 transitions. [2018-12-09 08:19:14,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:19:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 9429 states and 21657 transitions. [2018-12-09 08:19:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:14,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:14,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:14,584 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:14,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1423932934, now seen corresponding path program 3 times [2018-12-09 08:19:14,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:14,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:19:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:14,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:14,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 08:19:14,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 08:19:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 08:19:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 08:19:14,658 INFO L87 Difference]: Start difference. First operand 9429 states and 21657 transitions. Second operand 8 states. [2018-12-09 08:19:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:15,115 INFO L93 Difference]: Finished difference Result 12589 states and 28476 transitions. [2018-12-09 08:19:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 08:19:15,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 08:19:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:15,123 INFO L225 Difference]: With dead ends: 12589 [2018-12-09 08:19:15,123 INFO L226 Difference]: Without dead ends: 12589 [2018-12-09 08:19:15,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:19:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2018-12-09 08:19:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 9023. [2018-12-09 08:19:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9023 states. [2018-12-09 08:19:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9023 states to 9023 states and 20738 transitions. [2018-12-09 08:19:15,198 INFO L78 Accepts]: Start accepts. Automaton has 9023 states and 20738 transitions. Word has length 127 [2018-12-09 08:19:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:15,198 INFO L480 AbstractCegarLoop]: Abstraction has 9023 states and 20738 transitions. [2018-12-09 08:19:15,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 08:19:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 9023 states and 20738 transitions. [2018-12-09 08:19:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 08:19:15,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:15,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:15,204 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:15,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1720650046, now seen corresponding path program 4 times [2018-12-09 08:19:15,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:15,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:15,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:15,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:19:15,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:15,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:15,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:19:15,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:19:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:19:15,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:19:15,249 INFO L87 Difference]: Start difference. First operand 9023 states and 20738 transitions. Second operand 6 states. [2018-12-09 08:19:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:15,472 INFO L93 Difference]: Finished difference Result 9733 states and 22157 transitions. [2018-12-09 08:19:15,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 08:19:15,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 08:19:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:15,478 INFO L225 Difference]: With dead ends: 9733 [2018-12-09 08:19:15,478 INFO L226 Difference]: Without dead ends: 9733 [2018-12-09 08:19:15,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 08:19:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9733 states. [2018-12-09 08:19:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9733 to 9193. [2018-12-09 08:19:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9193 states. [2018-12-09 08:19:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9193 states to 9193 states and 21071 transitions. [2018-12-09 08:19:15,542 INFO L78 Accepts]: Start accepts. Automaton has 9193 states and 21071 transitions. Word has length 127 [2018-12-09 08:19:15,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:15,543 INFO L480 AbstractCegarLoop]: Abstraction has 9193 states and 21071 transitions. [2018-12-09 08:19:15,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:19:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9193 states and 21071 transitions. [2018-12-09 08:19:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 08:19:15,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:15,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:15,548 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:15,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1433250747, now seen corresponding path program 1 times [2018-12-09 08:19:15,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:15,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:15,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:19:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:15,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:15,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 08:19:15,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 08:19:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 08:19:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:19:15,721 INFO L87 Difference]: Start difference. First operand 9193 states and 21071 transitions. Second operand 7 states. [2018-12-09 08:19:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:16,012 INFO L93 Difference]: Finished difference Result 9686 states and 22109 transitions. [2018-12-09 08:19:16,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 08:19:16,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-12-09 08:19:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:16,018 INFO L225 Difference]: With dead ends: 9686 [2018-12-09 08:19:16,018 INFO L226 Difference]: Without dead ends: 9666 [2018-12-09 08:19:16,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:19:16,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2018-12-09 08:19:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 9219. [2018-12-09 08:19:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9219 states. [2018-12-09 08:19:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9219 states to 9219 states and 21122 transitions. [2018-12-09 08:19:16,083 INFO L78 Accepts]: Start accepts. Automaton has 9219 states and 21122 transitions. Word has length 129 [2018-12-09 08:19:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:16,083 INFO L480 AbstractCegarLoop]: Abstraction has 9219 states and 21122 transitions. [2018-12-09 08:19:16,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 08:19:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 9219 states and 21122 transitions. [2018-12-09 08:19:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 08:19:16,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:16,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:16,088 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:16,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash 3372679, now seen corresponding path program 1 times [2018-12-09 08:19:16,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:16,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:16,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:16,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:16,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:16,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 08:19:16,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 08:19:16,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 08:19:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 08:19:16,200 INFO L87 Difference]: Start difference. First operand 9219 states and 21122 transitions. Second operand 12 states. [2018-12-09 08:19:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:16,930 INFO L93 Difference]: Finished difference Result 22143 states and 51047 transitions. [2018-12-09 08:19:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 08:19:16,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2018-12-09 08:19:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:16,938 INFO L225 Difference]: With dead ends: 22143 [2018-12-09 08:19:16,938 INFO L226 Difference]: Without dead ends: 12476 [2018-12-09 08:19:16,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 08:19:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12476 states. [2018-12-09 08:19:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12476 to 9191. [2018-12-09 08:19:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9191 states. [2018-12-09 08:19:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9191 states to 9191 states and 20975 transitions. [2018-12-09 08:19:17,014 INFO L78 Accepts]: Start accepts. Automaton has 9191 states and 20975 transitions. Word has length 129 [2018-12-09 08:19:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:17,014 INFO L480 AbstractCegarLoop]: Abstraction has 9191 states and 20975 transitions. [2018-12-09 08:19:17,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 08:19:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 9191 states and 20975 transitions. [2018-12-09 08:19:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 08:19:17,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:17,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:17,020 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:17,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 95749886, now seen corresponding path program 1 times [2018-12-09 08:19:17,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:19:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 08:19:17,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:19:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 08:19:17,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 08:19:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 08:19:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:19:17,132 INFO L87 Difference]: Start difference. First operand 9191 states and 20975 transitions. Second operand 14 states. [2018-12-09 08:19:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:19:17,582 INFO L93 Difference]: Finished difference Result 14564 states and 33796 transitions. [2018-12-09 08:19:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 08:19:17,582 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-12-09 08:19:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:19:17,590 INFO L225 Difference]: With dead ends: 14564 [2018-12-09 08:19:17,590 INFO L226 Difference]: Without dead ends: 12726 [2018-12-09 08:19:17,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-09 08:19:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12726 states. [2018-12-09 08:19:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12726 to 10316. [2018-12-09 08:19:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10316 states. [2018-12-09 08:19:17,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10316 states to 10316 states and 23393 transitions. [2018-12-09 08:19:17,672 INFO L78 Accepts]: Start accepts. Automaton has 10316 states and 23393 transitions. Word has length 131 [2018-12-09 08:19:17,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:19:17,672 INFO L480 AbstractCegarLoop]: Abstraction has 10316 states and 23393 transitions. [2018-12-09 08:19:17,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 08:19:17,672 INFO L276 IsEmpty]: Start isEmpty. Operand 10316 states and 23393 transitions. [2018-12-09 08:19:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 08:19:17,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:19:17,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:19:17,679 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:19:17,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:19:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash -374762910, now seen corresponding path program 2 times [2018-12-09 08:19:17,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 08:19:17,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 08:19:17,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:17,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:19:17,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:19:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 08:19:17,728 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 08:19:17,809 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 08:19:17,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:19:17 BasicIcfg [2018-12-09 08:19:17,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:19:17,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:19:17,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:19:17,811 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:19:17,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:18:13" (3/4) ... [2018-12-09 08:19:17,813 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 08:19:17,899 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5909e0af-c241-46ae-824a-65fd6f65059f/bin-2019/uautomizer/witness.graphml [2018-12-09 08:19:17,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:19:17,899 INFO L168 Benchmark]: Toolchain (without parser) took 65079.58 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 5.0 GB). Free memory was 957.1 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,900 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:19:17,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,900 INFO L168 Benchmark]: Boogie Preprocessor took 23.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:19:17,901 INFO L168 Benchmark]: RCFGBuilder took 464.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.4 MB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,901 INFO L168 Benchmark]: TraceAbstraction took 64099.38 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 970.4 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,901 INFO L168 Benchmark]: Witness Printer took 87.89 ms. Allocated memory is still 6.0 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:19:17,902 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 464.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.4 MB in the end (delta: 75.1 MB). Peak memory consumption was 75.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64099.38 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 970.4 MB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 87.89 ms. Allocated memory is still 6.0 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L789] -1 pthread_t t1599; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] FCALL, FORK -1 pthread_create(&t1599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L701] 0 y = 2 [L704] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] -1 pthread_t t1600; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] FCALL, FORK -1 pthread_create(&t1600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L707] EXPR 0 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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_thd1 ? y$w_buff1 : y=2] [L721] 1 x = 2 [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd2 = (_Bool)1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L756] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L757] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L758] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L759] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L760] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L761] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L707] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L769] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L708] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -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 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 63.9s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16828 SDtfs, 18585 SDslu, 51142 SDs, 0 SdLazy, 19535 SolverSat, 875 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 109 SyntacticMatches, 33 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182336occurred in iteration=2, 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: 27.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 555988 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3138 NumberOfCodeBlocks, 3138 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2977 ConstructedInterpolants, 0 QuantifiedInterpolants, 782635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...