./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.oepc_false-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_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e50c987c43e88e6c05ffc272ace38771270e4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:22:59,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:22:59,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:22:59,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:22:59,477 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:22:59,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:22:59,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:22:59,479 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:22:59,480 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:22:59,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:22:59,481 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:22:59,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:22:59,482 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:22:59,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:22:59,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:22:59,484 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:22:59,485 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:22:59,486 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:22:59,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:22:59,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:22:59,489 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:22:59,490 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:22:59,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:22:59,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:22:59,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:22:59,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:22:59,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:22:59,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:22:59,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:22:59,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:22:59,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:22:59,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:22:59,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:22:59,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:22:59,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:22:59,496 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:22:59,497 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:22:59,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:22:59,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:22:59,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:22:59,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:22:59,508 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:22:59,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:22:59,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:22:59,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:22:59,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:22:59,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:22:59,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:22:59,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:22:59,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:22:59,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:22:59,511 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan 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 -> Taipan 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 -> 8e4e50c987c43e88e6c05ffc272ace38771270e4 [2018-12-09 10:22:59,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:22:59,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:22:59,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:22:59,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:22:59,544 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:22:59,544 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i [2018-12-09 10:22:59,578 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/data/55b0d3c1a/13acf12d43cc4b60a17b439270cc8c14/FLAG7db5d79f5 [2018-12-09 10:23:00,007 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:23:00,007 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/sv-benchmarks/c/pthread-wmm/rfi007_tso.oepc_false-unreach-call.i [2018-12-09 10:23:00,014 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/data/55b0d3c1a/13acf12d43cc4b60a17b439270cc8c14/FLAG7db5d79f5 [2018-12-09 10:23:00,022 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/data/55b0d3c1a/13acf12d43cc4b60a17b439270cc8c14 [2018-12-09 10:23:00,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:23:00,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:23:00,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:23:00,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:23:00,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:23:00,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00, skipping insertion in model container [2018-12-09 10:23:00,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:23:00,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:23:00,234 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:23:00,242 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:23:00,314 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:23:00,344 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:23:00,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00 WrapperNode [2018-12-09 10:23:00,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:23:00,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:23:00,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:23:00,345 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:23:00,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:23:00,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:23:00,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:23:00,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:23:00,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... [2018-12-09 10:23:00,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:23:00,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:23:00,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:23:00,406 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:23:00,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/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 10:23:00,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:23:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:23:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:23:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:23:00,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:23:00,449 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 10:23:00,831 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:23:00,832 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:23:00,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:00 BoogieIcfgContainer [2018-12-09 10:23:00,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:23:00,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:23:00,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:23:00,834 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:23:00,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:23:00" (1/3) ... [2018-12-09 10:23:00,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:23:00, skipping insertion in model container [2018-12-09 10:23:00,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:00" (2/3) ... [2018-12-09 10:23:00,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f21e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:23:00, skipping insertion in model container [2018-12-09 10:23:00,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:00" (3/3) ... [2018-12-09 10:23:00,836 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.oepc_false-unreach-call.i [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,861 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,862 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,863 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,864 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,865 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,866 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,867 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,868 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,869 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,870 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,871 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,872 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,873 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,874 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:00,884 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:23:00,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:23:00,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:23:00,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:23:00,915 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:23:00,915 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:23:00,915 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:23:00,915 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:23:00,915 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:23:00,915 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:23:00,915 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:23:00,915 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:23:00,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-09 10:23:05,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-09 10:23:05,305 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-09 10:23:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 10:23:05,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:05,311 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 10:23:05,312 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:05,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:05,316 INFO L82 PathProgramCache]: Analyzing trace with hash 210414996, now seen corresponding path program 1 times [2018-12-09 10:23:05,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:05,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:05,485 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 10:23:05,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:05,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:05,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:05,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:05,499 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-09 10:23:06,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:06,304 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-09 10:23:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:23:06,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 10:23:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:06,724 INFO L225 Difference]: With dead ends: 142996 [2018-12-09 10:23:06,724 INFO L226 Difference]: Without dead ends: 126812 [2018-12-09 10:23:06,725 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 10:23:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-09 10:23:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-09 10:23:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-09 10:23:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-09 10:23:09,084 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-09 10:23:09,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:09,085 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-09 10:23:09,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-09 10:23:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 10:23:09,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:09,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] [2018-12-09 10:23:09,088 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:09,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:09,088 INFO L82 PathProgramCache]: Analyzing trace with hash -746847349, now seen corresponding path program 1 times [2018-12-09 10:23:09,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:09,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:09,137 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 10:23:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:09,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:09,139 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-09 10:23:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:11,475 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-09 10:23:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:23:11,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 10:23:11,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:11,937 INFO L225 Difference]: With dead ends: 201246 [2018-12-09 10:23:11,937 INFO L226 Difference]: Without dead ends: 201086 [2018-12-09 10:23:11,938 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 10:23:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-09 10:23:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-09 10:23:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-09 10:23:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-09 10:23:15,180 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-09 10:23:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:15,180 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-09 10:23:15,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-09 10:23:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 10:23:15,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:15,183 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 10:23:15,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:15,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash 56283897, now seen corresponding path program 1 times [2018-12-09 10:23:15,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:15,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:15,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:15,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:15,219 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 10:23:15,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:15,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:15,219 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:15,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:15,220 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-09 10:23:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:15,297 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-09 10:23:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:23:15,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 10:23:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:15,332 INFO L225 Difference]: With dead ends: 26128 [2018-12-09 10:23:15,332 INFO L226 Difference]: Without dead ends: 24431 [2018-12-09 10:23:15,332 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 10:23:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-09 10:23:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-09 10:23:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-09 10:23:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-09 10:23:15,632 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-09 10:23:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:15,632 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-09 10:23:15,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-09 10:23:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:23:15,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:15,635 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 10:23:15,636 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:15,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash -677750709, now seen corresponding path program 1 times [2018-12-09 10:23:15,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:15,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:15,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:15,693 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 10:23:15,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:15,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:15,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:15,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:15,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:15,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:15,694 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-09 10:23:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:15,964 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-09 10:23:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:23:15,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 10:23:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:16,006 INFO L225 Difference]: With dead ends: 33039 [2018-12-09 10:23:16,006 INFO L226 Difference]: Without dead ends: 33039 [2018-12-09 10:23:16,006 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 10:23:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-09 10:23:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-09 10:23:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-09 10:23:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-09 10:23:16,353 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-09 10:23:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:16,354 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-09 10:23:16,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-09 10:23:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:23:16,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:16,357 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 10:23:16,357 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:16,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1045055487, now seen corresponding path program 1 times [2018-12-09 10:23:16,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:16,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:16,389 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 10:23:16,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:16,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:16,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:16,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:16,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:16,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:16,390 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-09 10:23:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:16,943 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-09 10:23:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:23:16,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 10:23:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:16,985 INFO L225 Difference]: With dead ends: 34248 [2018-12-09 10:23:16,985 INFO L226 Difference]: Without dead ends: 34248 [2018-12-09 10:23:16,986 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 10:23:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-09 10:23:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-09 10:23:17,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-09 10:23:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-09 10:23:17,544 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-09 10:23:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:17,544 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-09 10:23:17,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-09 10:23:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:23:17,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:17,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] [2018-12-09 10:23:17,548 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1896602112, now seen corresponding path program 1 times [2018-12-09 10:23:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:17,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:17,597 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 10:23:17,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:17,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:23:17,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:17,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:23:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:23:17,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:23:17,598 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-09 10:23:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:18,179 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-09 10:23:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:23:18,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 10:23:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:18,238 INFO L225 Difference]: With dead ends: 46397 [2018-12-09 10:23:18,238 INFO L226 Difference]: Without dead ends: 46365 [2018-12-09 10:23:18,238 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 10:23:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-09 10:23:18,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-09 10:23:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-09 10:23:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-09 10:23:18,704 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-09 10:23:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:18,704 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-09 10:23:18,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:23:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-09 10:23:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 10:23:18,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:18,717 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 10:23:18,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:18,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -687839314, now seen corresponding path program 1 times [2018-12-09 10:23:18,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:18,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:18,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:18,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:18,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:18,790 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 10:23:18,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:18,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:18,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:18,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:18,791 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 7 states. [2018-12-09 10:23:20,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:20,110 INFO L93 Difference]: Finished difference Result 93838 states and 305051 transitions. [2018-12-09 10:23:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:23:20,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 10:23:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:20,234 INFO L225 Difference]: With dead ends: 93838 [2018-12-09 10:23:20,234 INFO L226 Difference]: Without dead ends: 93426 [2018-12-09 10:23:20,234 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 10:23:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93426 states. [2018-12-09 10:23:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93426 to 61439. [2018-12-09 10:23:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61439 states. [2018-12-09 10:23:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61439 states to 61439 states and 201479 transitions. [2018-12-09 10:23:21,257 INFO L78 Accepts]: Start accepts. Automaton has 61439 states and 201479 transitions. Word has length 72 [2018-12-09 10:23:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:21,257 INFO L480 AbstractCegarLoop]: Abstraction has 61439 states and 201479 transitions. [2018-12-09 10:23:21,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 61439 states and 201479 transitions. [2018-12-09 10:23:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 10:23:21,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:21,283 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 10:23:21,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:21,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 372067376, now seen corresponding path program 1 times [2018-12-09 10:23:21,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:21,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:21,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:21,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:21,325 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 10:23:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:21,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:21,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:21,326 INFO L87 Difference]: Start difference. First operand 61439 states and 201479 transitions. Second operand 7 states. [2018-12-09 10:23:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:22,111 INFO L93 Difference]: Finished difference Result 76959 states and 252023 transitions. [2018-12-09 10:23:22,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:23:22,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 10:23:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:22,218 INFO L225 Difference]: With dead ends: 76959 [2018-12-09 10:23:22,218 INFO L226 Difference]: Without dead ends: 76895 [2018-12-09 10:23:22,218 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 10:23:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76895 states. [2018-12-09 10:23:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76895 to 66747. [2018-12-09 10:23:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66747 states. [2018-12-09 10:23:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66747 states to 66747 states and 217888 transitions. [2018-12-09 10:23:23,027 INFO L78 Accepts]: Start accepts. Automaton has 66747 states and 217888 transitions. Word has length 72 [2018-12-09 10:23:23,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:23,027 INFO L480 AbstractCegarLoop]: Abstraction has 66747 states and 217888 transitions. [2018-12-09 10:23:23,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:23,027 INFO L276 IsEmpty]: Start isEmpty. Operand 66747 states and 217888 transitions. [2018-12-09 10:23:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 10:23:23,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:23,056 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 10:23:23,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:23,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1403827813, now seen corresponding path program 1 times [2018-12-09 10:23:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:23,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:23,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:23,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:23,091 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 10:23:23,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:23,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:23:23,091 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:23,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:23:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:23:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:23:23,092 INFO L87 Difference]: Start difference. First operand 66747 states and 217888 transitions. Second operand 3 states. [2018-12-09 10:23:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:23,409 INFO L93 Difference]: Finished difference Result 102603 states and 327658 transitions. [2018-12-09 10:23:23,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:23:23,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-09 10:23:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:23,561 INFO L225 Difference]: With dead ends: 102603 [2018-12-09 10:23:23,561 INFO L226 Difference]: Without dead ends: 102603 [2018-12-09 10:23:23,562 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 10:23:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102603 states. [2018-12-09 10:23:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102603 to 82493. [2018-12-09 10:23:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82493 states. [2018-12-09 10:23:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82493 states to 82493 states and 265370 transitions. [2018-12-09 10:23:24,686 INFO L78 Accepts]: Start accepts. Automaton has 82493 states and 265370 transitions. Word has length 74 [2018-12-09 10:23:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:24,686 INFO L480 AbstractCegarLoop]: Abstraction has 82493 states and 265370 transitions. [2018-12-09 10:23:24,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:23:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 82493 states and 265370 transitions. [2018-12-09 10:23:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 10:23:24,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:24,725 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 10:23:24,725 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:24,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:24,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1846574122, now seen corresponding path program 1 times [2018-12-09 10:23:24,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:24,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:24,788 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 10:23:24,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:24,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:23:24,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:24,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:23:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:23:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:23:24,788 INFO L87 Difference]: Start difference. First operand 82493 states and 265370 transitions. Second operand 8 states. [2018-12-09 10:23:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:25,867 INFO L93 Difference]: Finished difference Result 93961 states and 299287 transitions. [2018-12-09 10:23:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 10:23:25,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-09 10:23:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:25,995 INFO L225 Difference]: With dead ends: 93961 [2018-12-09 10:23:25,995 INFO L226 Difference]: Without dead ends: 93897 [2018-12-09 10:23:25,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-09 10:23:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93897 states. [2018-12-09 10:23:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93897 to 82693. [2018-12-09 10:23:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82693 states. [2018-12-09 10:23:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82693 states to 82693 states and 266156 transitions. [2018-12-09 10:23:27,004 INFO L78 Accepts]: Start accepts. Automaton has 82693 states and 266156 transitions. Word has length 78 [2018-12-09 10:23:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:27,004 INFO L480 AbstractCegarLoop]: Abstraction has 82693 states and 266156 transitions. [2018-12-09 10:23:27,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:23:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82693 states and 266156 transitions. [2018-12-09 10:23:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:23:27,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:27,053 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 10:23:27,053 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:27,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1440185303, now seen corresponding path program 1 times [2018-12-09 10:23:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:27,093 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 10:23:27,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:27,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:27,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:27,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:27,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:27,094 INFO L87 Difference]: Start difference. First operand 82693 states and 266156 transitions. Second operand 5 states. [2018-12-09 10:23:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:27,136 INFO L93 Difference]: Finished difference Result 10825 states and 27631 transitions. [2018-12-09 10:23:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:23:27,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-09 10:23:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:27,143 INFO L225 Difference]: With dead ends: 10825 [2018-12-09 10:23:27,144 INFO L226 Difference]: Without dead ends: 8341 [2018-12-09 10:23:27,144 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 10:23:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2018-12-09 10:23:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 6183. [2018-12-09 10:23:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6183 states. [2018-12-09 10:23:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 15803 transitions. [2018-12-09 10:23:27,217 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 15803 transitions. Word has length 81 [2018-12-09 10:23:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:27,218 INFO L480 AbstractCegarLoop]: Abstraction has 6183 states and 15803 transitions. [2018-12-09 10:23:27,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 15803 transitions. [2018-12-09 10:23:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:27,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:27,223 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] [2018-12-09 10:23:27,223 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:27,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:27,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1951447944, now seen corresponding path program 1 times [2018-12-09 10:23:27,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:27,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:27,285 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 10:23:27,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:27,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:27,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:27,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:27,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:27,286 INFO L87 Difference]: Start difference. First operand 6183 states and 15803 transitions. Second operand 4 states. [2018-12-09 10:23:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:27,402 INFO L93 Difference]: Finished difference Result 6969 states and 17693 transitions. [2018-12-09 10:23:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:23:27,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-09 10:23:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:27,408 INFO L225 Difference]: With dead ends: 6969 [2018-12-09 10:23:27,408 INFO L226 Difference]: Without dead ends: 6969 [2018-12-09 10:23:27,409 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 10:23:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2018-12-09 10:23:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 6837. [2018-12-09 10:23:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-12-09 10:23:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 17398 transitions. [2018-12-09 10:23:27,469 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 17398 transitions. Word has length 109 [2018-12-09 10:23:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 17398 transitions. [2018-12-09 10:23:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 17398 transitions. [2018-12-09 10:23:27,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:27,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:27,474 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] [2018-12-09 10:23:27,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:27,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash 15787657, now seen corresponding path program 1 times [2018-12-09 10:23:27,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:27,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:27,511 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 10:23:27,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:27,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:23:27,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:27,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:23:27,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:23:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:23:27,511 INFO L87 Difference]: Start difference. First operand 6837 states and 17398 transitions. Second operand 3 states. [2018-12-09 10:23:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:27,629 INFO L93 Difference]: Finished difference Result 8124 states and 20189 transitions. [2018-12-09 10:23:27,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:23:27,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-09 10:23:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:27,635 INFO L225 Difference]: With dead ends: 8124 [2018-12-09 10:23:27,635 INFO L226 Difference]: Without dead ends: 8124 [2018-12-09 10:23:27,635 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 10:23:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8124 states. [2018-12-09 10:23:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8124 to 7667. [2018-12-09 10:23:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7667 states. [2018-12-09 10:23:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7667 states to 7667 states and 19252 transitions. [2018-12-09 10:23:27,691 INFO L78 Accepts]: Start accepts. Automaton has 7667 states and 19252 transitions. Word has length 109 [2018-12-09 10:23:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:27,691 INFO L480 AbstractCegarLoop]: Abstraction has 7667 states and 19252 transitions. [2018-12-09 10:23:27,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:23:27,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7667 states and 19252 transitions. [2018-12-09 10:23:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:27,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:27,696 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] [2018-12-09 10:23:27,697 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:27,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 272152249, now seen corresponding path program 1 times [2018-12-09 10:23:27,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:27,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:27,823 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 10:23:27,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:27,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:27,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:27,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:27,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:27,824 INFO L87 Difference]: Start difference. First operand 7667 states and 19252 transitions. Second operand 7 states. [2018-12-09 10:23:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:28,026 INFO L93 Difference]: Finished difference Result 9764 states and 23735 transitions. [2018-12-09 10:23:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:23:28,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 10:23:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:28,033 INFO L225 Difference]: With dead ends: 9764 [2018-12-09 10:23:28,033 INFO L226 Difference]: Without dead ends: 9683 [2018-12-09 10:23:28,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:23:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9683 states. [2018-12-09 10:23:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9683 to 8096. [2018-12-09 10:23:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8096 states. [2018-12-09 10:23:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8096 states to 8096 states and 20179 transitions. [2018-12-09 10:23:28,095 INFO L78 Accepts]: Start accepts. Automaton has 8096 states and 20179 transitions. Word has length 109 [2018-12-09 10:23:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:28,096 INFO L480 AbstractCegarLoop]: Abstraction has 8096 states and 20179 transitions. [2018-12-09 10:23:28,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 8096 states and 20179 transitions. [2018-12-09 10:23:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:28,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:28,101 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] [2018-12-09 10:23:28,101 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:28,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1242649962, now seen corresponding path program 2 times [2018-12-09 10:23:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:28,187 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 10:23:28,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:28,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:23:28,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:28,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:23:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:23:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:23:28,188 INFO L87 Difference]: Start difference. First operand 8096 states and 20179 transitions. Second operand 6 states. [2018-12-09 10:23:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:28,378 INFO L93 Difference]: Finished difference Result 8119 states and 20111 transitions. [2018-12-09 10:23:28,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:23:28,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 10:23:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:28,384 INFO L225 Difference]: With dead ends: 8119 [2018-12-09 10:23:28,384 INFO L226 Difference]: Without dead ends: 8119 [2018-12-09 10:23:28,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8119 states. [2018-12-09 10:23:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8119 to 6846. [2018-12-09 10:23:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6846 states. [2018-12-09 10:23:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6846 states to 6846 states and 17031 transitions. [2018-12-09 10:23:28,436 INFO L78 Accepts]: Start accepts. Automaton has 6846 states and 17031 transitions. Word has length 109 [2018-12-09 10:23:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:28,436 INFO L480 AbstractCegarLoop]: Abstraction has 6846 states and 17031 transitions. [2018-12-09 10:23:28,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:23:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6846 states and 17031 transitions. [2018-12-09 10:23:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:28,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:28,443 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] [2018-12-09 10:23:28,443 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:28,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1959966231, now seen corresponding path program 1 times [2018-12-09 10:23:28,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:28,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:23:28,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:28,521 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 10:23:28,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:28,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:28,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:28,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:28,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:28,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:28,522 INFO L87 Difference]: Start difference. First operand 6846 states and 17031 transitions. Second operand 7 states. [2018-12-09 10:23:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:28,804 INFO L93 Difference]: Finished difference Result 9588 states and 23651 transitions. [2018-12-09 10:23:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:23:28,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 10:23:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:28,811 INFO L225 Difference]: With dead ends: 9588 [2018-12-09 10:23:28,811 INFO L226 Difference]: Without dead ends: 9556 [2018-12-09 10:23:28,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:23:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9556 states. [2018-12-09 10:23:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9556 to 7766. [2018-12-09 10:23:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7766 states. [2018-12-09 10:23:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7766 states to 7766 states and 19200 transitions. [2018-12-09 10:23:28,873 INFO L78 Accepts]: Start accepts. Automaton has 7766 states and 19200 transitions. Word has length 109 [2018-12-09 10:23:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:28,873 INFO L480 AbstractCegarLoop]: Abstraction has 7766 states and 19200 transitions. [2018-12-09 10:23:28,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7766 states and 19200 transitions. [2018-12-09 10:23:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:28,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:28,878 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] [2018-12-09 10:23:28,878 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:28,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -128622567, now seen corresponding path program 1 times [2018-12-09 10:23:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:28,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:28,948 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 10:23:28,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:28,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:23:28,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:28,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:23:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:23:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:23:28,949 INFO L87 Difference]: Start difference. First operand 7766 states and 19200 transitions. Second operand 8 states. [2018-12-09 10:23:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:29,290 INFO L93 Difference]: Finished difference Result 17801 states and 45802 transitions. [2018-12-09 10:23:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:23:29,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-12-09 10:23:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:29,303 INFO L225 Difference]: With dead ends: 17801 [2018-12-09 10:23:29,303 INFO L226 Difference]: Without dead ends: 17801 [2018-12-09 10:23:29,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-09 10:23:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17801 states. [2018-12-09 10:23:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17801 to 6924. [2018-12-09 10:23:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6924 states. [2018-12-09 10:23:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6924 states to 6924 states and 16769 transitions. [2018-12-09 10:23:29,393 INFO L78 Accepts]: Start accepts. Automaton has 6924 states and 16769 transitions. Word has length 109 [2018-12-09 10:23:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:29,393 INFO L480 AbstractCegarLoop]: Abstraction has 6924 states and 16769 transitions. [2018-12-09 10:23:29,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:23:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6924 states and 16769 transitions. [2018-12-09 10:23:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:23:29,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:29,397 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] [2018-12-09 10:23:29,398 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:29,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash 352093849, now seen corresponding path program 1 times [2018-12-09 10:23:29,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:29,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:29,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:29,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:29,490 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 10:23:29,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:29,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:23:29,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:29,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:23:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:23:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:23:29,491 INFO L87 Difference]: Start difference. First operand 6924 states and 16769 transitions. Second operand 6 states. [2018-12-09 10:23:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:29,619 INFO L93 Difference]: Finished difference Result 6476 states and 15393 transitions. [2018-12-09 10:23:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:23:29,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 10:23:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:29,624 INFO L225 Difference]: With dead ends: 6476 [2018-12-09 10:23:29,624 INFO L226 Difference]: Without dead ends: 6476 [2018-12-09 10:23:29,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:23:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2018-12-09 10:23:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 5250. [2018-12-09 10:23:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5250 states. [2018-12-09 10:23:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 12615 transitions. [2018-12-09 10:23:29,668 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 12615 transitions. Word has length 109 [2018-12-09 10:23:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:29,668 INFO L480 AbstractCegarLoop]: Abstraction has 5250 states and 12615 transitions. [2018-12-09 10:23:29,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:23:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 12615 transitions. [2018-12-09 10:23:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:23:29,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:29,671 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] [2018-12-09 10:23:29,671 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:29,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:29,672 INFO L82 PathProgramCache]: Analyzing trace with hash -527584691, now seen corresponding path program 1 times [2018-12-09 10:23:29,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:29,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:29,723 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 10:23:29,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:29,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:29,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:29,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:29,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:29,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:29,724 INFO L87 Difference]: Start difference. First operand 5250 states and 12615 transitions. Second operand 7 states. [2018-12-09 10:23:30,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:30,097 INFO L93 Difference]: Finished difference Result 8928 states and 20700 transitions. [2018-12-09 10:23:30,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:23:30,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 10:23:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:30,103 INFO L225 Difference]: With dead ends: 8928 [2018-12-09 10:23:30,103 INFO L226 Difference]: Without dead ends: 8896 [2018-12-09 10:23:30,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:23:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8896 states. [2018-12-09 10:23:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8896 to 6396. [2018-12-09 10:23:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2018-12-09 10:23:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 15226 transitions. [2018-12-09 10:23:30,156 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 15226 transitions. Word has length 111 [2018-12-09 10:23:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:30,156 INFO L480 AbstractCegarLoop]: Abstraction has 6396 states and 15226 transitions. [2018-12-09 10:23:30,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 15226 transitions. [2018-12-09 10:23:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:23:30,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:30,160 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] [2018-12-09 10:23:30,160 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:30,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:30,160 INFO L82 PathProgramCache]: Analyzing trace with hash 717179790, now seen corresponding path program 1 times [2018-12-09 10:23:30,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:30,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:30,238 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 10:23:30,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:30,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:23:30,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:30,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:23:30,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:23:30,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:30,239 INFO L87 Difference]: Start difference. First operand 6396 states and 15226 transitions. Second operand 7 states. [2018-12-09 10:23:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:30,423 INFO L93 Difference]: Finished difference Result 7408 states and 17291 transitions. [2018-12-09 10:23:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:23:30,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 10:23:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:30,427 INFO L225 Difference]: With dead ends: 7408 [2018-12-09 10:23:30,427 INFO L226 Difference]: Without dead ends: 7408 [2018-12-09 10:23:30,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:23:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2018-12-09 10:23:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 6528. [2018-12-09 10:23:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6528 states. [2018-12-09 10:23:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 15490 transitions. [2018-12-09 10:23:30,477 INFO L78 Accepts]: Start accepts. Automaton has 6528 states and 15490 transitions. Word has length 111 [2018-12-09 10:23:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:30,477 INFO L480 AbstractCegarLoop]: Abstraction has 6528 states and 15490 transitions. [2018-12-09 10:23:30,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:23:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6528 states and 15490 transitions. [2018-12-09 10:23:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:23:30,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:30,481 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] [2018-12-09 10:23:30,482 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:30,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash -197818930, now seen corresponding path program 1 times [2018-12-09 10:23:30,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:30,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:30,524 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 10:23:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:30,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:30,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:30,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:30,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:30,525 INFO L87 Difference]: Start difference. First operand 6528 states and 15490 transitions. Second operand 5 states. [2018-12-09 10:23:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:30,643 INFO L93 Difference]: Finished difference Result 6976 states and 16594 transitions. [2018-12-09 10:23:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:23:30,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:23:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:30,647 INFO L225 Difference]: With dead ends: 6976 [2018-12-09 10:23:30,647 INFO L226 Difference]: Without dead ends: 6944 [2018-12-09 10:23:30,648 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 10:23:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-12-09 10:23:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 5974. [2018-12-09 10:23:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5974 states. [2018-12-09 10:23:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5974 states to 5974 states and 14121 transitions. [2018-12-09 10:23:30,693 INFO L78 Accepts]: Start accepts. Automaton has 5974 states and 14121 transitions. Word has length 111 [2018-12-09 10:23:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:30,693 INFO L480 AbstractCegarLoop]: Abstraction has 5974 states and 14121 transitions. [2018-12-09 10:23:30,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5974 states and 14121 transitions. [2018-12-09 10:23:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:23:30,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:30,697 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] [2018-12-09 10:23:30,697 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:30,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1046945551, now seen corresponding path program 1 times [2018-12-09 10:23:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:30,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:30,741 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 10:23:30,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:30,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:30,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:30,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:30,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:30,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:30,742 INFO L87 Difference]: Start difference. First operand 5974 states and 14121 transitions. Second operand 5 states. [2018-12-09 10:23:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:30,890 INFO L93 Difference]: Finished difference Result 7448 states and 17251 transitions. [2018-12-09 10:23:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:23:30,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:23:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:30,895 INFO L225 Difference]: With dead ends: 7448 [2018-12-09 10:23:30,895 INFO L226 Difference]: Without dead ends: 7448 [2018-12-09 10:23:30,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:23:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7448 states. [2018-12-09 10:23:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7448 to 5695. [2018-12-09 10:23:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5695 states. [2018-12-09 10:23:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 13435 transitions. [2018-12-09 10:23:30,936 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 13435 transitions. Word has length 111 [2018-12-09 10:23:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:30,936 INFO L480 AbstractCegarLoop]: Abstraction has 5695 states and 13435 transitions. [2018-12-09 10:23:30,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 13435 transitions. [2018-12-09 10:23:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:23:30,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:30,940 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] [2018-12-09 10:23:30,940 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:30,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:30,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1726378037, now seen corresponding path program 2 times [2018-12-09 10:23:30,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:30,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:30,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:30,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:30,979 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 10:23:30,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:30,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:30,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:30,980 INFO L87 Difference]: Start difference. First operand 5695 states and 13435 transitions. Second operand 5 states. [2018-12-09 10:23:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:31,137 INFO L93 Difference]: Finished difference Result 6305 states and 14664 transitions. [2018-12-09 10:23:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:23:31,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:23:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:31,141 INFO L225 Difference]: With dead ends: 6305 [2018-12-09 10:23:31,141 INFO L226 Difference]: Without dead ends: 6305 [2018-12-09 10:23:31,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 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 10:23:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2018-12-09 10:23:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 5745. [2018-12-09 10:23:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5745 states. [2018-12-09 10:23:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 13530 transitions. [2018-12-09 10:23:31,180 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 13530 transitions. Word has length 111 [2018-12-09 10:23:31,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:31,180 INFO L480 AbstractCegarLoop]: Abstraction has 5745 states and 13530 transitions. [2018-12-09 10:23:31,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 13530 transitions. [2018-12-09 10:23:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:23:31,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:31,184 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] [2018-12-09 10:23:31,184 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:31,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash -823375308, now seen corresponding path program 1 times [2018-12-09 10:23:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:31,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:23:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:31,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:31,306 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 10:23:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:23:31,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:31,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:23:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:23:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:23:31,307 INFO L87 Difference]: Start difference. First operand 5745 states and 13530 transitions. Second operand 10 states. [2018-12-09 10:23:31,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:31,481 INFO L93 Difference]: Finished difference Result 12007 states and 28943 transitions. [2018-12-09 10:23:31,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:23:31,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 10:23:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:31,484 INFO L225 Difference]: With dead ends: 12007 [2018-12-09 10:23:31,484 INFO L226 Difference]: Without dead ends: 2569 [2018-12-09 10:23:31,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-12-09 10:23:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2018-12-09 10:23:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2569. [2018-12-09 10:23:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-12-09 10:23:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 6408 transitions. [2018-12-09 10:23:31,505 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 6408 transitions. Word has length 113 [2018-12-09 10:23:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:31,505 INFO L480 AbstractCegarLoop]: Abstraction has 2569 states and 6408 transitions. [2018-12-09 10:23:31,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:23:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 6408 transitions. [2018-12-09 10:23:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:23:31,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:31,508 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] [2018-12-09 10:23:31,508 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:31,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1992642750, now seen corresponding path program 2 times [2018-12-09 10:23:31,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:31,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:31,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:31,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:23:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:23:31,559 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:23:31,656 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:23:31,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:23:31 BasicIcfg [2018-12-09 10:23:31,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:23:31,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:23:31,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:23:31,658 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:23:31,658 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:00" (3/4) ... [2018-12-09 10:23:31,660 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:23:31,734 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c4ec6f04-348a-409b-a7b3-ab51b1efc16e/bin-2019/utaipan/witness.graphml [2018-12-09 10:23:31,734 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:23:31,734 INFO L168 Benchmark]: Toolchain (without parser) took 31710.41 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 948.1 MB in the beginning and 1.7 GB in the end (delta: -714.3 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,735 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:23:31,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,736 INFO L168 Benchmark]: Boogie Preprocessor took 22.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:23:31,736 INFO L168 Benchmark]: RCFGBuilder took 426.84 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: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,736 INFO L168 Benchmark]: TraceAbstraction took 30825.01 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -704.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,736 INFO L168 Benchmark]: Witness Printer took 76.25 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2018-12-09 10:23:31,737 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 426.84 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: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30825.01 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -704.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.25 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.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] [L773] -1 pthread_t t1719; 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] [L774] FCALL, FORK -1 pthread_create(&t1719, ((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] [L775] -1 pthread_t t1720; 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] [L776] FCALL, FORK -1 pthread_create(&t1720, ((void *)0), P1, ((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] [L721] 0 y$w_buff1 = y$w_buff0 [L722] 0 y$w_buff0 = 2 [L723] 0 y$w_buff1_used = y$w_buff0_used [L724] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L727] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L728] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L729] 0 y$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 y$flush_delayed = weak$$choice2 [L735] 0 y$mem_tmp = y 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=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 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) [L737] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 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)) [L738] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 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)) [L739] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 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)) [L740] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 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)) [L741] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 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)) [L742] EXPR 0 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 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)) [L743] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 y = y$flush_delayed ? y$mem_tmp : y [L745] 0 y$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L701] 1 x = 1 [L704] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, 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=1] [L707] EXPR 1 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, 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)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L708] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 0 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 0 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 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 [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L709] EXPR 1 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, 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] 1 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 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, 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] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 1 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=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, 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] 1 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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] EXPR 0 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 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 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -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) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -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 [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, 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=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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -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 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 y$flush_delayed = weak$$choice2 [L792] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] -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) [L794] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -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)) [L795] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -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)) [L796] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -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)) [L797] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -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)) [L798] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -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)) [L799] 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -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)) [L800] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y = y$flush_delayed ? y$mem_tmp : y [L802] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, 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=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 30.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10007 SDtfs, 10999 SDslu, 23944 SDs, 0 SdLazy, 8951 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 66 SyntacticMatches, 19 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred 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: 11.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 266684 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2221 NumberOfCodeBlocks, 2221 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2084 ConstructedInterpolants, 0 QuantifiedInterpolants, 454551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...