./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_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_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/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 a99d57a1eed70a2c92247fcea50713c025ae5730 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 20:38:30,551 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:38:30,552 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:38:30,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:38:30,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:38:30,562 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:38:30,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:38:30,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:38:30,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:38:30,565 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:38:30,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:38:30,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:38:30,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:38:30,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:38:30,568 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:38:30,569 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:38:30,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:38:30,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:38:30,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:38:30,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:38:30,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:38:30,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:38:30,576 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:38:30,576 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:38:30,577 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:38:30,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:38:30,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:38:30,578 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:38:30,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:38:30,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:38:30,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:38:30,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:38:30,581 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:38:30,581 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:38:30,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:38:30,582 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:38:30,582 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 20:38:30,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:38:30,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:38:30,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:38:30,592 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:38:30,592 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 20:38:30,592 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 20:38:30,592 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 20:38:30,593 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 20:38:30,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:38:30,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:38:30,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:38:30,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:38:30,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:38:30,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:38:30,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:38:30,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:38:30,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:38:30,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:38:30,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:38:30,597 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 20:38:30,597 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_0f504cb6-0e00-4ff8-a736-4ceef42c786a/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 -> a99d57a1eed70a2c92247fcea50713c025ae5730 [2018-12-02 20:38:30,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:38:30,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:38:30,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:38:30,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:38:30,630 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:38:30,630 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-12-02 20:38:30,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/data/133fc827e/ad389e8cdc3c4c1fae77a551771e4d82/FLAG7b0e8f5ae [2018-12-02 20:38:31,039 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:38:31,040 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/sv-benchmarks/c/pthread-wmm/mix042_rmo.opt_false-unreach-call.i [2018-12-02 20:38:31,049 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/data/133fc827e/ad389e8cdc3c4c1fae77a551771e4d82/FLAG7b0e8f5ae [2018-12-02 20:38:31,058 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/data/133fc827e/ad389e8cdc3c4c1fae77a551771e4d82 [2018-12-02 20:38:31,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:38:31,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:38:31,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:38:31,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:38:31,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:38:31,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,065 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 02.12 08:38:31, skipping insertion in model container [2018-12-02 20:38:31,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:38:31,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:38:31,278 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:38:31,289 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:38:31,373 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:38:31,409 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:38:31,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31 WrapperNode [2018-12-02 20:38:31,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:38:31,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:38:31,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:38:31,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:38:31,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:38:31,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:38:31,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:38:31,451 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:38:31,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... [2018-12-02 20:38:31,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:38:31,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:38:31,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:38:31,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:38:31,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/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-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 20:38:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 20:38:31,503 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 20:38:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 20:38:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 20:38:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 20:38:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 20:38:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:38:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:38:31,505 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 20:38:31,818 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:38:31,818 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 20:38:31,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:38:31 BoogieIcfgContainer [2018-12-02 20:38:31,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:38:31,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:38:31,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:38:31,821 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:38:31,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:38:31" (1/3) ... [2018-12-02 20:38:31,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4771a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:38:31, skipping insertion in model container [2018-12-02 20:38:31,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:38:31" (2/3) ... [2018-12-02 20:38:31,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4771a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:38:31, skipping insertion in model container [2018-12-02 20:38:31,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:38:31" (3/3) ... [2018-12-02 20:38:31,824 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt_false-unreach-call.i [2018-12-02 20:38:31,851 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,851 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,851 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,851 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,852 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,853 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,854 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,855 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,856 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,857 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,858 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,859 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,860 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,861 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,862 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,863 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 20:38:31,868 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 20:38:31,868 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:38:31,875 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 20:38:31,887 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 20:38:31,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:38:31,902 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:38:31,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:38:31,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:38:31,902 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:38:31,902 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:38:31,902 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:38:31,902 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:38:31,910 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-02 20:38:45,003 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-02 20:38:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-02 20:38:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 20:38:45,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:38:45,012 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] [2018-12-02 20:38:45,013 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:38:45,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:38:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-02 20:38:45,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:38:45,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:45,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:38:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:45,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:38:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:38:45,168 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-02 20:38:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:38:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:38:45,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:38:45,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:38:45,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:38:45,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:38:45,182 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-02 20:38:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:38:46,526 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-02 20:38:46,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:38:46,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 20:38:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:38:47,277 INFO L225 Difference]: With dead ends: 233475 [2018-12-02 20:38:47,277 INFO L226 Difference]: Without dead ends: 203725 [2018-12-02 20:38:47,278 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-02 20:38:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-02 20:38:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-02 20:38:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 20:38:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-02 20:38:52,581 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-02 20:38:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:38:52,582 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-02 20:38:52,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:38:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-02 20:38:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 20:38:52,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:38:52,588 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] [2018-12-02 20:38:52,589 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:38:52,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:38:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-02 20:38:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:38:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:52,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:38:52,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:52,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:38:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:38:52,626 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-02 20:38:52,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:38:52,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:38:52,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:38:52,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:38:52,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:38:52,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:38:52,628 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-02 20:38:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:38:53,152 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-02 20:38:53,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:38:53,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 20:38:53,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:38:53,467 INFO L225 Difference]: With dead ends: 118895 [2018-12-02 20:38:53,468 INFO L226 Difference]: Without dead ends: 118895 [2018-12-02 20:38:53,468 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-02 20:38:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-02 20:38:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-02 20:38:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 20:38:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-02 20:38:56,108 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-02 20:38:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:38:56,108 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-02 20:38:56,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:38:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-02 20:38:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 20:38:56,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:38:56,112 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] [2018-12-02 20:38:56,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:38:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:38:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-02 20:38:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:38:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:56,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:38:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:38:56,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:38:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:38:56,156 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-02 20:38:56,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:38:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:38:56,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:38:56,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:38:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:38:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:38:56,157 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-02 20:38:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:38:59,556 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-02 20:38:59,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:38:59,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 20:38:59,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:00,439 INFO L225 Difference]: With dead ends: 325275 [2018-12-02 20:39:00,439 INFO L226 Difference]: Without dead ends: 324275 [2018-12-02 20:39:00,440 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-02 20:39:01,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-02 20:39:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-02 20:39:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-02 20:39:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-02 20:39:05,323 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-02 20:39:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:05,323 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-02 20:39:05,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-02 20:39:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 20:39:05,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:05,328 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] [2018-12-02 20:39:05,328 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:05,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-02 20:39:05,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:05,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:05,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:05,379 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-02 20:39:05,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:05,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:05,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:05,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:05,380 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 4 states. [2018-12-02 20:39:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:06,063 INFO L93 Difference]: Finished difference Result 163601 states and 725475 transitions. [2018-12-02 20:39:06,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:06,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 20:39:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:06,934 INFO L225 Difference]: With dead ends: 163601 [2018-12-02 20:39:06,935 INFO L226 Difference]: Without dead ends: 160996 [2018-12-02 20:39:06,935 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-02 20:39:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-02 20:39:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-02 20:39:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-02 20:39:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 716803 transitions. [2018-12-02 20:39:11,983 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 716803 transitions. Word has length 54 [2018-12-02 20:39:11,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:11,983 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 716803 transitions. [2018-12-02 20:39:11,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 716803 transitions. [2018-12-02 20:39:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 20:39:11,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:11,987 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] [2018-12-02 20:39:11,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:11,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1719723521, now seen corresponding path program 1 times [2018-12-02 20:39:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:11,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:12,009 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-02 20:39:12,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:12,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 20:39:12,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:12,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 20:39:12,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 20:39:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 20:39:12,010 INFO L87 Difference]: Start difference. First operand 160996 states and 716803 transitions. Second operand 3 states. [2018-12-02 20:39:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:12,999 INFO L93 Difference]: Finished difference Result 160996 states and 716767 transitions. [2018-12-02 20:39:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 20:39:13,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-02 20:39:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:13,384 INFO L225 Difference]: With dead ends: 160996 [2018-12-02 20:39:13,385 INFO L226 Difference]: Without dead ends: 160996 [2018-12-02 20:39:13,385 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-02 20:39:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-02 20:39:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-02 20:39:16,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-02 20:39:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 716767 transitions. [2018-12-02 20:39:16,507 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 716767 transitions. Word has length 55 [2018-12-02 20:39:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:16,508 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 716767 transitions. [2018-12-02 20:39:16,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 20:39:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 716767 transitions. [2018-12-02 20:39:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 20:39:16,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:16,512 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] [2018-12-02 20:39:16,512 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:16,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:16,513 INFO L82 PathProgramCache]: Analyzing trace with hash -832433440, now seen corresponding path program 1 times [2018-12-02 20:39:16,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:16,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:16,552 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-02 20:39:16,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:16,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:16,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:16,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:16,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:16,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:16,553 INFO L87 Difference]: Start difference. First operand 160996 states and 716767 transitions. Second operand 5 states. [2018-12-02 20:39:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:18,212 INFO L93 Difference]: Finished difference Result 289852 states and 1285660 transitions. [2018-12-02 20:39:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:39:18,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 20:39:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:18,986 INFO L225 Difference]: With dead ends: 289852 [2018-12-02 20:39:18,987 INFO L226 Difference]: Without dead ends: 289012 [2018-12-02 20:39:18,987 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-02 20:39:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289012 states. [2018-12-02 20:39:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289012 to 169616. [2018-12-02 20:39:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-12-02 20:39:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 752620 transitions. [2018-12-02 20:39:25,573 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 752620 transitions. Word has length 55 [2018-12-02 20:39:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:25,573 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 752620 transitions. [2018-12-02 20:39:25,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 752620 transitions. [2018-12-02 20:39:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 20:39:25,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:25,593 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] [2018-12-02 20:39:25,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:25,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash 771366836, now seen corresponding path program 1 times [2018-12-02 20:39:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:25,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:25,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:25,635 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-02 20:39:25,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:25,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:25,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:25,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:25,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:25,636 INFO L87 Difference]: Start difference. First operand 169616 states and 752620 transitions. Second operand 5 states. [2018-12-02 20:39:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:25,868 INFO L93 Difference]: Finished difference Result 59120 states and 239396 transitions. [2018-12-02 20:39:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:39:25,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 20:39:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:25,980 INFO L225 Difference]: With dead ends: 59120 [2018-12-02 20:39:25,981 INFO L226 Difference]: Without dead ends: 56808 [2018-12-02 20:39:25,981 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-02 20:39:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56808 states. [2018-12-02 20:39:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56808 to 56808. [2018-12-02 20:39:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56808 states. [2018-12-02 20:39:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56808 states to 56808 states and 230742 transitions. [2018-12-02 20:39:26,787 INFO L78 Accepts]: Start accepts. Automaton has 56808 states and 230742 transitions. Word has length 62 [2018-12-02 20:39:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:26,788 INFO L480 AbstractCegarLoop]: Abstraction has 56808 states and 230742 transitions. [2018-12-02 20:39:26,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56808 states and 230742 transitions. [2018-12-02 20:39:26,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 20:39:26,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:26,796 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] [2018-12-02 20:39:26,796 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:26,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1566863536, now seen corresponding path program 1 times [2018-12-02 20:39:26,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:26,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:26,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:26,826 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-02 20:39:26,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:26,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:26,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:26,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:26,827 INFO L87 Difference]: Start difference. First operand 56808 states and 230742 transitions. Second operand 4 states. [2018-12-02 20:39:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:27,529 INFO L93 Difference]: Finished difference Result 78972 states and 316067 transitions. [2018-12-02 20:39:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:27,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 20:39:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:27,674 INFO L225 Difference]: With dead ends: 78972 [2018-12-02 20:39:27,674 INFO L226 Difference]: Without dead ends: 78972 [2018-12-02 20:39:27,674 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-02 20:39:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78972 states. [2018-12-02 20:39:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78972 to 61564. [2018-12-02 20:39:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61564 states. [2018-12-02 20:39:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61564 states to 61564 states and 248435 transitions. [2018-12-02 20:39:28,617 INFO L78 Accepts]: Start accepts. Automaton has 61564 states and 248435 transitions. Word has length 68 [2018-12-02 20:39:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:28,618 INFO L480 AbstractCegarLoop]: Abstraction has 61564 states and 248435 transitions. [2018-12-02 20:39:28,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 61564 states and 248435 transitions. [2018-12-02 20:39:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 20:39:28,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:28,629 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] [2018-12-02 20:39:28,629 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:28,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash -985293425, now seen corresponding path program 1 times [2018-12-02 20:39:28,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:28,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:28,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:28,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-02 20:39:28,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:28,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:28,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:28,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:28,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:28,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:28,694 INFO L87 Difference]: Start difference. First operand 61564 states and 248435 transitions. Second operand 6 states. [2018-12-02 20:39:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:29,233 INFO L93 Difference]: Finished difference Result 82140 states and 328947 transitions. [2018-12-02 20:39:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:39:29,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 20:39:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:29,568 INFO L225 Difference]: With dead ends: 82140 [2018-12-02 20:39:29,568 INFO L226 Difference]: Without dead ends: 81980 [2018-12-02 20:39:29,568 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-02 20:39:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81980 states. [2018-12-02 20:39:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81980 to 60092. [2018-12-02 20:39:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60092 states. [2018-12-02 20:39:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60092 states to 60092 states and 242467 transitions. [2018-12-02 20:39:30,469 INFO L78 Accepts]: Start accepts. Automaton has 60092 states and 242467 transitions. Word has length 68 [2018-12-02 20:39:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:30,469 INFO L480 AbstractCegarLoop]: Abstraction has 60092 states and 242467 transitions. [2018-12-02 20:39:30,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 60092 states and 242467 transitions. [2018-12-02 20:39:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 20:39:30,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:30,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:30,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:30,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:30,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1468560606, now seen corresponding path program 1 times [2018-12-02 20:39:30,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:30,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:30,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:30,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:30,601 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-02 20:39:30,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:30,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:39:30,601 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:30,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:39:30,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:39:30,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:30,602 INFO L87 Difference]: Start difference. First operand 60092 states and 242467 transitions. Second operand 7 states. [2018-12-02 20:39:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:32,491 INFO L93 Difference]: Finished difference Result 206079 states and 821108 transitions. [2018-12-02 20:39:32,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 20:39:32,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 20:39:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:32,938 INFO L225 Difference]: With dead ends: 206079 [2018-12-02 20:39:32,938 INFO L226 Difference]: Without dead ends: 204943 [2018-12-02 20:39:32,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:39:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204943 states. [2018-12-02 20:39:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204943 to 93001. [2018-12-02 20:39:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93001 states. [2018-12-02 20:39:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93001 states to 93001 states and 372077 transitions. [2018-12-02 20:39:35,144 INFO L78 Accepts]: Start accepts. Automaton has 93001 states and 372077 transitions. Word has length 82 [2018-12-02 20:39:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:35,144 INFO L480 AbstractCegarLoop]: Abstraction has 93001 states and 372077 transitions. [2018-12-02 20:39:35,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:39:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 93001 states and 372077 transitions. [2018-12-02 20:39:35,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 20:39:35,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:35,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:35,226 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:35,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -115250909, now seen corresponding path program 1 times [2018-12-02 20:39:35,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:35,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:35,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:35,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:35,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:35,273 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-02 20:39:35,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:35,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:35,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:35,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:35,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:35,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:35,274 INFO L87 Difference]: Start difference. First operand 93001 states and 372077 transitions. Second operand 4 states. [2018-12-02 20:39:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:36,088 INFO L93 Difference]: Finished difference Result 128658 states and 509081 transitions. [2018-12-02 20:39:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:36,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 20:39:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:36,354 INFO L225 Difference]: With dead ends: 128658 [2018-12-02 20:39:36,354 INFO L226 Difference]: Without dead ends: 128658 [2018-12-02 20:39:36,354 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-02 20:39:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128658 states. [2018-12-02 20:39:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128658 to 116357. [2018-12-02 20:39:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116357 states. [2018-12-02 20:39:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116357 states to 116357 states and 463127 transitions. [2018-12-02 20:39:38,264 INFO L78 Accepts]: Start accepts. Automaton has 116357 states and 463127 transitions. Word has length 82 [2018-12-02 20:39:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:38,264 INFO L480 AbstractCegarLoop]: Abstraction has 116357 states and 463127 transitions. [2018-12-02 20:39:38,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 116357 states and 463127 transitions. [2018-12-02 20:39:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 20:39:38,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:38,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:38,353 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:38,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 235549028, now seen corresponding path program 1 times [2018-12-02 20:39:38,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:38,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:38,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:38,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:38,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:38,434 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-02 20:39:38,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:38,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 20:39:38,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:38,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:39:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:39:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:39:38,434 INFO L87 Difference]: Start difference. First operand 116357 states and 463127 transitions. Second operand 8 states. [2018-12-02 20:39:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:39,620 INFO L93 Difference]: Finished difference Result 164277 states and 640372 transitions. [2018-12-02 20:39:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 20:39:39,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-02 20:39:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:39,965 INFO L225 Difference]: With dead ends: 164277 [2018-12-02 20:39:39,965 INFO L226 Difference]: Without dead ends: 163189 [2018-12-02 20:39:39,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:39:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163189 states. [2018-12-02 20:39:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163189 to 120040. [2018-12-02 20:39:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120040 states. [2018-12-02 20:39:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120040 states to 120040 states and 477378 transitions. [2018-12-02 20:39:42,137 INFO L78 Accepts]: Start accepts. Automaton has 120040 states and 477378 transitions. Word has length 82 [2018-12-02 20:39:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:42,137 INFO L480 AbstractCegarLoop]: Abstraction has 120040 states and 477378 transitions. [2018-12-02 20:39:42,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:39:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 120040 states and 477378 transitions. [2018-12-02 20:39:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 20:39:42,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:42,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:42,229 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:42,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash -57853979, now seen corresponding path program 1 times [2018-12-02 20:39:42,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:42,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:42,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:42,310 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-02 20:39:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:42,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:42,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:42,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:42,310 INFO L87 Difference]: Start difference. First operand 120040 states and 477378 transitions. Second operand 6 states. [2018-12-02 20:39:43,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:43,141 INFO L93 Difference]: Finished difference Result 129314 states and 510127 transitions. [2018-12-02 20:39:43,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:39:43,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 20:39:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:43,408 INFO L225 Difference]: With dead ends: 129314 [2018-12-02 20:39:43,408 INFO L226 Difference]: Without dead ends: 129314 [2018-12-02 20:39:43,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:39:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129314 states. [2018-12-02 20:39:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129314 to 122879. [2018-12-02 20:39:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122879 states. [2018-12-02 20:39:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122879 states to 122879 states and 487324 transitions. [2018-12-02 20:39:45,574 INFO L78 Accepts]: Start accepts. Automaton has 122879 states and 487324 transitions. Word has length 82 [2018-12-02 20:39:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:45,575 INFO L480 AbstractCegarLoop]: Abstraction has 122879 states and 487324 transitions. [2018-12-02 20:39:45,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 122879 states and 487324 transitions. [2018-12-02 20:39:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 20:39:45,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:45,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:45,676 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:45,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:45,676 INFO L82 PathProgramCache]: Analyzing trace with hash 903760038, now seen corresponding path program 1 times [2018-12-02 20:39:45,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:45,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:45,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:45,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:45,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:45,736 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-02 20:39:45,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:45,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:45,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:45,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:45,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:45,737 INFO L87 Difference]: Start difference. First operand 122879 states and 487324 transitions. Second operand 6 states. [2018-12-02 20:39:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:45,840 INFO L93 Difference]: Finished difference Result 24159 states and 80924 transitions. [2018-12-02 20:39:45,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:45,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 20:39:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:45,864 INFO L225 Difference]: With dead ends: 24159 [2018-12-02 20:39:45,864 INFO L226 Difference]: Without dead ends: 19753 [2018-12-02 20:39:45,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:39:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2018-12-02 20:39:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 16723. [2018-12-02 20:39:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16723 states. [2018-12-02 20:39:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16723 states to 16723 states and 56222 transitions. [2018-12-02 20:39:46,051 INFO L78 Accepts]: Start accepts. Automaton has 16723 states and 56222 transitions. Word has length 82 [2018-12-02 20:39:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:46,051 INFO L480 AbstractCegarLoop]: Abstraction has 16723 states and 56222 transitions. [2018-12-02 20:39:46,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16723 states and 56222 transitions. [2018-12-02 20:39:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 20:39:46,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:46,065 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] [2018-12-02 20:39:46,066 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash -323882767, now seen corresponding path program 1 times [2018-12-02 20:39:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:46,118 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-02 20:39:46,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:46,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:46,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:46,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:46,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:46,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:46,119 INFO L87 Difference]: Start difference. First operand 16723 states and 56222 transitions. Second operand 4 states. [2018-12-02 20:39:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:46,251 INFO L93 Difference]: Finished difference Result 20403 states and 67626 transitions. [2018-12-02 20:39:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:46,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 20:39:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:46,274 INFO L225 Difference]: With dead ends: 20403 [2018-12-02 20:39:46,274 INFO L226 Difference]: Without dead ends: 20263 [2018-12-02 20:39:46,274 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-02 20:39:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20263 states. [2018-12-02 20:39:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20263 to 20030. [2018-12-02 20:39:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2018-12-02 20:39:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 66594 transitions. [2018-12-02 20:39:46,465 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 66594 transitions. Word has length 101 [2018-12-02 20:39:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:46,465 INFO L480 AbstractCegarLoop]: Abstraction has 20030 states and 66594 transitions. [2018-12-02 20:39:46,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 66594 transitions. [2018-12-02 20:39:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 20:39:46,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:46,483 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] [2018-12-02 20:39:46,483 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:46,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash 645698256, now seen corresponding path program 1 times [2018-12-02 20:39:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:46,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:46,504 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-02 20:39:46,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:46,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:46,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:46,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:46,505 INFO L87 Difference]: Start difference. First operand 20030 states and 66594 transitions. Second operand 4 states. [2018-12-02 20:39:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:46,693 INFO L93 Difference]: Finished difference Result 25054 states and 83640 transitions. [2018-12-02 20:39:46,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:46,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 20:39:46,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:46,723 INFO L225 Difference]: With dead ends: 25054 [2018-12-02 20:39:46,723 INFO L226 Difference]: Without dead ends: 25054 [2018-12-02 20:39:46,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25054 states. [2018-12-02 20:39:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25054 to 19400. [2018-12-02 20:39:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19400 states. [2018-12-02 20:39:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19400 states to 19400 states and 64240 transitions. [2018-12-02 20:39:46,938 INFO L78 Accepts]: Start accepts. Automaton has 19400 states and 64240 transitions. Word has length 101 [2018-12-02 20:39:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:46,938 INFO L480 AbstractCegarLoop]: Abstraction has 19400 states and 64240 transitions. [2018-12-02 20:39:46,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19400 states and 64240 transitions. [2018-12-02 20:39:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 20:39:46,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:46,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:46,955 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:46,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -90144670, now seen corresponding path program 2 times [2018-12-02 20:39:46,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:46,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:47,000 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-02 20:39:47,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:47,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:47,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:47,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:47,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:47,001 INFO L87 Difference]: Start difference. First operand 19400 states and 64240 transitions. Second operand 5 states. [2018-12-02 20:39:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:47,169 INFO L93 Difference]: Finished difference Result 22444 states and 73737 transitions. [2018-12-02 20:39:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:39:47,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 20:39:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:47,194 INFO L225 Difference]: With dead ends: 22444 [2018-12-02 20:39:47,194 INFO L226 Difference]: Without dead ends: 22304 [2018-12-02 20:39:47,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:39:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22304 states. [2018-12-02 20:39:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22304 to 19400. [2018-12-02 20:39:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19400 states. [2018-12-02 20:39:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19400 states to 19400 states and 64200 transitions. [2018-12-02 20:39:47,391 INFO L78 Accepts]: Start accepts. Automaton has 19400 states and 64200 transitions. Word has length 101 [2018-12-02 20:39:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:47,391 INFO L480 AbstractCegarLoop]: Abstraction has 19400 states and 64200 transitions. [2018-12-02 20:39:47,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19400 states and 64200 transitions. [2018-12-02 20:39:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 20:39:47,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:47,407 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] [2018-12-02 20:39:47,408 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:47,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:47,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1457509930, now seen corresponding path program 1 times [2018-12-02 20:39:47,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:47,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:39:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:47,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:47,449 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-02 20:39:47,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 20:39:47,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:47,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 20:39:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 20:39:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:47,450 INFO L87 Difference]: Start difference. First operand 19400 states and 64200 transitions. Second operand 4 states. [2018-12-02 20:39:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:47,601 INFO L93 Difference]: Finished difference Result 32755 states and 109625 transitions. [2018-12-02 20:39:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:47,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 20:39:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:47,640 INFO L225 Difference]: With dead ends: 32755 [2018-12-02 20:39:47,640 INFO L226 Difference]: Without dead ends: 32615 [2018-12-02 20:39:47,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 20:39:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32615 states. [2018-12-02 20:39:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32615 to 18495. [2018-12-02 20:39:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18495 states. [2018-12-02 20:39:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18495 states to 18495 states and 60981 transitions. [2018-12-02 20:39:47,958 INFO L78 Accepts]: Start accepts. Automaton has 18495 states and 60981 transitions. Word has length 103 [2018-12-02 20:39:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 18495 states and 60981 transitions. [2018-12-02 20:39:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 20:39:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18495 states and 60981 transitions. [2018-12-02 20:39:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 20:39:47,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:47,974 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] [2018-12-02 20:39:47,974 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:47,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1127744169, now seen corresponding path program 1 times [2018-12-02 20:39:47,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:47,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:48,050 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-02 20:39:48,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:48,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 20:39:48,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:48,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:39:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:39:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:48,052 INFO L87 Difference]: Start difference. First operand 18495 states and 60981 transitions. Second operand 7 states. [2018-12-02 20:39:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:48,241 INFO L93 Difference]: Finished difference Result 20796 states and 68163 transitions. [2018-12-02 20:39:48,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:48,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 20:39:48,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:48,264 INFO L225 Difference]: With dead ends: 20796 [2018-12-02 20:39:48,264 INFO L226 Difference]: Without dead ends: 20796 [2018-12-02 20:39:48,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2018-12-02 20:39:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 18920. [2018-12-02 20:39:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18920 states. [2018-12-02 20:39:48,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18920 states to 18920 states and 62136 transitions. [2018-12-02 20:39:48,458 INFO L78 Accepts]: Start accepts. Automaton has 18920 states and 62136 transitions. Word has length 103 [2018-12-02 20:39:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:48,458 INFO L480 AbstractCegarLoop]: Abstraction has 18920 states and 62136 transitions. [2018-12-02 20:39:48,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:39:48,458 INFO L276 IsEmpty]: Start isEmpty. Operand 18920 states and 62136 transitions. [2018-12-02 20:39:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 20:39:48,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:48,473 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] [2018-12-02 20:39:48,474 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:48,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:48,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1983875830, now seen corresponding path program 1 times [2018-12-02 20:39:48,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:48,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:48,527 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-02 20:39:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:48,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:48,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:48,528 INFO L87 Difference]: Start difference. First operand 18920 states and 62136 transitions. Second operand 5 states. [2018-12-02 20:39:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:48,633 INFO L93 Difference]: Finished difference Result 16804 states and 55112 transitions. [2018-12-02 20:39:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 20:39:48,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 20:39:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:48,652 INFO L225 Difference]: With dead ends: 16804 [2018-12-02 20:39:48,652 INFO L226 Difference]: Without dead ends: 16804 [2018-12-02 20:39:48,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16804 states. [2018-12-02 20:39:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16804 to 16304. [2018-12-02 20:39:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2018-12-02 20:39:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 53682 transitions. [2018-12-02 20:39:48,812 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 53682 transitions. Word has length 103 [2018-12-02 20:39:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:48,812 INFO L480 AbstractCegarLoop]: Abstraction has 16304 states and 53682 transitions. [2018-12-02 20:39:48,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 53682 transitions. [2018-12-02 20:39:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 20:39:48,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:48,826 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] [2018-12-02 20:39:48,826 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:48,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1061192247, now seen corresponding path program 1 times [2018-12-02 20:39:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:48,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:48,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:48,896 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-02 20:39:48,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:48,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:48,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:48,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:48,897 INFO L87 Difference]: Start difference. First operand 16304 states and 53682 transitions. Second operand 6 states. [2018-12-02 20:39:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:49,000 INFO L93 Difference]: Finished difference Result 15728 states and 50850 transitions. [2018-12-02 20:39:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:39:49,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 20:39:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:49,019 INFO L225 Difference]: With dead ends: 15728 [2018-12-02 20:39:49,019 INFO L226 Difference]: Without dead ends: 15728 [2018-12-02 20:39:49,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15728 states. [2018-12-02 20:39:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15728 to 11979. [2018-12-02 20:39:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2018-12-02 20:39:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 39166 transitions. [2018-12-02 20:39:49,157 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 39166 transitions. Word has length 103 [2018-12-02 20:39:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:49,158 INFO L480 AbstractCegarLoop]: Abstraction has 11979 states and 39166 transitions. [2018-12-02 20:39:49,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 39166 transitions. [2018-12-02 20:39:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:49,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:49,168 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] [2018-12-02 20:39:49,168 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1159044518, now seen corresponding path program 1 times [2018-12-02 20:39:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:49,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:39:49,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:49,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 20:39:49,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:49,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:39:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:39:49,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:49,249 INFO L87 Difference]: Start difference. First operand 11979 states and 39166 transitions. Second operand 6 states. [2018-12-02 20:39:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:49,331 INFO L93 Difference]: Finished difference Result 12589 states and 40764 transitions. [2018-12-02 20:39:49,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:49,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 20:39:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:49,345 INFO L225 Difference]: With dead ends: 12589 [2018-12-02 20:39:49,345 INFO L226 Difference]: Without dead ends: 12489 [2018-12-02 20:39:49,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:39:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12489 states. [2018-12-02 20:39:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12489 to 11834. [2018-12-02 20:39:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11834 states. [2018-12-02 20:39:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11834 states to 11834 states and 38685 transitions. [2018-12-02 20:39:49,465 INFO L78 Accepts]: Start accepts. Automaton has 11834 states and 38685 transitions. Word has length 105 [2018-12-02 20:39:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:49,465 INFO L480 AbstractCegarLoop]: Abstraction has 11834 states and 38685 transitions. [2018-12-02 20:39:49,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:39:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 11834 states and 38685 transitions. [2018-12-02 20:39:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:49,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:49,476 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] [2018-12-02 20:39:49,477 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:49,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:49,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1200262491, now seen corresponding path program 1 times [2018-12-02 20:39:49,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:49,539 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-02 20:39:49,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:49,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:49,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:49,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:49,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:49,540 INFO L87 Difference]: Start difference. First operand 11834 states and 38685 transitions. Second operand 5 states. [2018-12-02 20:39:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:49,610 INFO L93 Difference]: Finished difference Result 17735 states and 58971 transitions. [2018-12-02 20:39:49,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:39:49,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 20:39:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:49,632 INFO L225 Difference]: With dead ends: 17735 [2018-12-02 20:39:49,632 INFO L226 Difference]: Without dead ends: 17735 [2018-12-02 20:39:49,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:39:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17735 states. [2018-12-02 20:39:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17735 to 11514. [2018-12-02 20:39:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11514 states. [2018-12-02 20:39:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11514 states to 11514 states and 37559 transitions. [2018-12-02 20:39:49,780 INFO L78 Accepts]: Start accepts. Automaton has 11514 states and 37559 transitions. Word has length 105 [2018-12-02 20:39:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:49,780 INFO L480 AbstractCegarLoop]: Abstraction has 11514 states and 37559 transitions. [2018-12-02 20:39:49,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 11514 states and 37559 transitions. [2018-12-02 20:39:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:49,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:49,790 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] [2018-12-02 20:39:49,791 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:49,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:49,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2125123782, now seen corresponding path program 1 times [2018-12-02 20:39:49,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:49,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:49,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:49,843 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-02 20:39:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:49,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:39:49,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:49,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:39:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:39:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:39:49,844 INFO L87 Difference]: Start difference. First operand 11514 states and 37559 transitions. Second operand 5 states. [2018-12-02 20:39:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:49,988 INFO L93 Difference]: Finished difference Result 12922 states and 42071 transitions. [2018-12-02 20:39:49,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:39:49,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 20:39:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,002 INFO L225 Difference]: With dead ends: 12922 [2018-12-02 20:39:50,002 INFO L226 Difference]: Without dead ends: 12794 [2018-12-02 20:39:50,002 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-02 20:39:50,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12794 states. [2018-12-02 20:39:50,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12794 to 10738. [2018-12-02 20:39:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10738 states. [2018-12-02 20:39:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10738 states to 10738 states and 35064 transitions. [2018-12-02 20:39:50,120 INFO L78 Accepts]: Start accepts. Automaton has 10738 states and 35064 transitions. Word has length 105 [2018-12-02 20:39:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,121 INFO L480 AbstractCegarLoop]: Abstraction has 10738 states and 35064 transitions. [2018-12-02 20:39:50,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:39:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 10738 states and 35064 transitions. [2018-12-02 20:39:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:50,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:39:50,130 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash -880359301, now seen corresponding path program 1 times [2018-12-02 20:39:50,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:50,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,233 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-02 20:39:50,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 20:39:50,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:39:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:39:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:39:50,234 INFO L87 Difference]: Start difference. First operand 10738 states and 35064 transitions. Second operand 9 states. [2018-12-02 20:39:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,363 INFO L93 Difference]: Finished difference Result 19946 states and 65818 transitions. [2018-12-02 20:39:50,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:39:50,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 20:39:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,374 INFO L225 Difference]: With dead ends: 19946 [2018-12-02 20:39:50,375 INFO L226 Difference]: Without dead ends: 10078 [2018-12-02 20:39:50,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:39:50,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10078 states. [2018-12-02 20:39:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10078 to 10078. [2018-12-02 20:39:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10078 states. [2018-12-02 20:39:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10078 states to 10078 states and 33144 transitions. [2018-12-02 20:39:50,470 INFO L78 Accepts]: Start accepts. Automaton has 10078 states and 33144 transitions. Word has length 105 [2018-12-02 20:39:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,470 INFO L480 AbstractCegarLoop]: Abstraction has 10078 states and 33144 transitions. [2018-12-02 20:39:50,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:39:50,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10078 states and 33144 transitions. [2018-12-02 20:39:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:50,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,478 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] [2018-12-02 20:39:50,478 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash -287902169, now seen corresponding path program 2 times [2018-12-02 20:39:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:39:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,550 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-02 20:39:50,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 20:39:50,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:39:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:39:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:39:50,551 INFO L87 Difference]: Start difference. First operand 10078 states and 33144 transitions. Second operand 9 states. [2018-12-02 20:39:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:50,672 INFO L93 Difference]: Finished difference Result 16826 states and 56149 transitions. [2018-12-02 20:39:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:39:50,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 20:39:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:50,681 INFO L225 Difference]: With dead ends: 16826 [2018-12-02 20:39:50,682 INFO L226 Difference]: Without dead ends: 6992 [2018-12-02 20:39:50,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:39:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2018-12-02 20:39:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6992. [2018-12-02 20:39:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2018-12-02 20:39:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 23649 transitions. [2018-12-02 20:39:50,749 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 23649 transitions. Word has length 105 [2018-12-02 20:39:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:50,749 INFO L480 AbstractCegarLoop]: Abstraction has 6992 states and 23649 transitions. [2018-12-02 20:39:50,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:39:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 23649 transitions. [2018-12-02 20:39:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:50,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:50,756 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] [2018-12-02 20:39:50,756 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:50,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138289, now seen corresponding path program 3 times [2018-12-02 20:39:50,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:50,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:39:50,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:50,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:39:50,849 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-02 20:39:50,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:39:50,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 20:39:50,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 20:39:50,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 20:39:50,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 20:39:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:39:50,850 INFO L87 Difference]: Start difference. First operand 6992 states and 23649 transitions. Second operand 12 states. [2018-12-02 20:39:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:39:51,341 INFO L93 Difference]: Finished difference Result 13420 states and 45630 transitions. [2018-12-02 20:39:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 20:39:51,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 20:39:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:39:51,358 INFO L225 Difference]: With dead ends: 13420 [2018-12-02 20:39:51,358 INFO L226 Difference]: Without dead ends: 9516 [2018-12-02 20:39:51,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 20:39:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9516 states. [2018-12-02 20:39:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9516 to 8908. [2018-12-02 20:39:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8908 states. [2018-12-02 20:39:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8908 states to 8908 states and 29542 transitions. [2018-12-02 20:39:51,447 INFO L78 Accepts]: Start accepts. Automaton has 8908 states and 29542 transitions. Word has length 105 [2018-12-02 20:39:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:39:51,447 INFO L480 AbstractCegarLoop]: Abstraction has 8908 states and 29542 transitions. [2018-12-02 20:39:51,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 20:39:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8908 states and 29542 transitions. [2018-12-02 20:39:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 20:39:51,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:39:51,455 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] [2018-12-02 20:39:51,455 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:39:51,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:39:51,455 INFO L82 PathProgramCache]: Analyzing trace with hash 653369973, now seen corresponding path program 4 times [2018-12-02 20:39:51,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 20:39:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:39:51,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:39:51,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 20:39:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:39:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:39:51,494 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:39:51,569 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 20:39:51,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:39:51 BasicIcfg [2018-12-02 20:39:51,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:39:51,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:39:51,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:39:51,570 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:39:51,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:38:31" (3/4) ... [2018-12-02 20:39:51,572 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:39:51,648 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f504cb6-0e00-4ff8-a736-4ceef42c786a/bin-2019/utaipan/witness.graphml [2018-12-02 20:39:51,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:39:51,649 INFO L168 Benchmark]: Toolchain (without parser) took 80588.25 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 952.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,649 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:39:51,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,650 INFO L168 Benchmark]: Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:39:51,650 INFO L168 Benchmark]: RCFGBuilder took 347.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,650 INFO L168 Benchmark]: TraceAbstraction took 79750.99 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,650 INFO L168 Benchmark]: Witness Printer took 78.12 ms. Allocated memory is still 6.4 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2018-12-02 20:39:51,651 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79750.99 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 78.12 ms. Allocated memory is still 6.4 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 64.2 MB). Peak memory consumption was 64.2 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: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1122; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1122, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1123; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1123, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1124; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1124, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 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=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 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 [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 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 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -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) [L811] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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)) [L812] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -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)) [L813] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -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)) [L814] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -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)) [L815] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -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)) [L816] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -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)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 79.6s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7166 SDtfs, 8039 SDslu, 15927 SDs, 0 SdLazy, 5636 SolverSat, 440 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 263 GetRequests, 78 SyntacticMatches, 21 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186425occurred in iteration=3, 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: 40.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 596805 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2374 NumberOfCodeBlocks, 2374 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 491233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...