./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_tso.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_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/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 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 01:43:17,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:43:17,178 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:43:17,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:43:17,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:43:17,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:43:17,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:43:17,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:43:17,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:43:17,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:43:17,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:43:17,188 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:43:17,189 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:43:17,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:43:17,190 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:43:17,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:43:17,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:43:17,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:43:17,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:43:17,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:43:17,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:43:17,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:43:17,195 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:43:17,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:43:17,196 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:43:17,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:43:17,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:43:17,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:43:17,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:43:17,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:43:17,198 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:43:17,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:43:17,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:43:17,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:43:17,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:43:17,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:43:17,200 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:43:17,207 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:43:17,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:43:17,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:43:17,208 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:43:17,208 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:43:17,208 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:43:17,208 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:43:17,209 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:43:17,210 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:43:17,210 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:43:17,210 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:43:17,210 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:43:17,211 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:43:17,212 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:43:17,212 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:43:17,212 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:43:17,213 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:43:17,213 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:43:17,213 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:43:17,213 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_a6fd64a0-0b6f-464c-be67-afd04706dcb6/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 -> 5e09268fb712cd64b95667f17ecc6d5ef1ed6f24 [2018-12-02 01:43:17,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:43:17,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:43:17,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:43:17,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:43:17,240 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:43:17,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-02 01:43:17,274 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/data/4bc7d9620/270330fa79f840f0ac95e7888f1731d6/FLAG3c9f6a30d [2018-12-02 01:43:17,695 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:43:17,695 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/sv-benchmarks/c/pthread-wmm/mix042_tso.opt_false-unreach-call.i [2018-12-02 01:43:17,703 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/data/4bc7d9620/270330fa79f840f0ac95e7888f1731d6/FLAG3c9f6a30d [2018-12-02 01:43:17,711 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/data/4bc7d9620/270330fa79f840f0ac95e7888f1731d6 [2018-12-02 01:43:17,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:43:17,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:43:17,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:43:17,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:43:17,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:43:17,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:43:17" (1/1) ... [2018-12-02 01:43:17,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:17, skipping insertion in model container [2018-12-02 01:43:17,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:43:17" (1/1) ... [2018-12-02 01:43:17,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:43:17,745 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:43:17,926 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:43:17,935 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:43:18,018 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:43:18,051 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:43:18,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18 WrapperNode [2018-12-02 01:43:18,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:43:18,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:43:18,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:43:18,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:43:18,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:43:18,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:43:18,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:43:18,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:43:18,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... [2018-12-02 01:43:18,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:43:18,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:43:18,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:43:18,113 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:43:18,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/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 01:43:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:43:18,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 01:43:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 01:43:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 01:43:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 01:43:18,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:43:18,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:43:18,148 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 01:43:18,461 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:43:18,461 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 01:43:18,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:43:18 BoogieIcfgContainer [2018-12-02 01:43:18,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:43:18,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:43:18,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:43:18,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:43:18,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:43:17" (1/3) ... [2018-12-02 01:43:18,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cdcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:43:18, skipping insertion in model container [2018-12-02 01:43:18,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:43:18" (2/3) ... [2018-12-02 01:43:18,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cdcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:43:18, skipping insertion in model container [2018-12-02 01:43:18,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:43:18" (3/3) ... [2018-12-02 01:43:18,466 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_tso.opt_false-unreach-call.i [2018-12-02 01:43:18,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,488 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,488 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,489 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,490 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,491 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,493 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,494 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,495 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,496 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 01:43:18,502 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 01:43:18,502 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:43:18,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 01:43:18,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 01:43:18,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:43:18,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:43:18,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:43:18,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:43:18,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:43:18,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:43:18,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:43:18,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:43:18,540 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-02 01:43:32,365 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-02 01:43:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-02 01:43:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 01:43:32,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:43:32,375 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 01:43:32,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:43:32,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:43:32,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-02 01:43:32,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:43:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:32,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:43:32,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:32,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:43:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:43:32,545 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 01:43:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:43:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:43:32,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:43:32,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:43:32,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:43:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:43:32,560 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-02 01:43:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:43:33,919 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-02 01:43:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:43:33,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 01:43:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:43:36,601 INFO L225 Difference]: With dead ends: 233475 [2018-12-02 01:43:36,601 INFO L226 Difference]: Without dead ends: 203725 [2018-12-02 01:43:36,603 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 01:43:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-02 01:43:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-02 01:43:39,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 01:43:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-02 01:43:39,988 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-02 01:43:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:43:39,989 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-02 01:43:39,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:43:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-02 01:43:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 01:43:39,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:43:39,997 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 01:43:39,997 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:43:39,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:43:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-02 01:43:39,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:43:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:43:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:40,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:43:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:43:40,043 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 01:43:40,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:43:40,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:43:40,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:43:40,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:43:40,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:43:40,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:43:40,045 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-02 01:43:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:43:41,092 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-02 01:43:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:43:41,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 01:43:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:43:41,413 INFO L225 Difference]: With dead ends: 118895 [2018-12-02 01:43:41,414 INFO L226 Difference]: Without dead ends: 118895 [2018-12-02 01:43:41,414 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 01:43:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-02 01:43:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-02 01:43:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 01:43:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-02 01:43:45,702 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-02 01:43:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:43:45,702 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-02 01:43:45,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:43:45,702 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-02 01:43:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 01:43:45,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:43:45,706 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 01:43:45,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:43:45,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:43:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-02 01:43:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:43:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:45,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:43:45,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:45,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:43:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:43:45,764 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 01:43:45,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:43:45,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:43:45,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:43:45,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:43:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:43:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:43:45,765 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-02 01:43:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:43:47,551 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-02 01:43:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:43:47,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 01:43:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:43:49,033 INFO L225 Difference]: With dead ends: 325275 [2018-12-02 01:43:49,033 INFO L226 Difference]: Without dead ends: 324275 [2018-12-02 01:43:49,033 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 01:43:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-02 01:43:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-02 01:43:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-02 01:43:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-02 01:43:56,222 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-02 01:43:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:43:56,223 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-02 01:43:56,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:43:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-02 01:43:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 01:43:56,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:43:56,228 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 01:43:56,229 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:43:56,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:43:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-02 01:43:56,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:43:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:43:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:43:56,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:43:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:43:56,278 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 01:43:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:43:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:43:56,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:43:56,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:43:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:43:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:43:56,279 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 5 states. [2018-12-02 01:43:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:43:58,529 INFO L93 Difference]: Finished difference Result 334055 states and 1500996 transitions. [2018-12-02 01:43:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:43:58,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 01:43:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:43:59,440 INFO L225 Difference]: With dead ends: 334055 [2018-12-02 01:43:59,440 INFO L226 Difference]: Without dead ends: 333005 [2018-12-02 01:43:59,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 01:44:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333005 states. [2018-12-02 01:44:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333005 to 194885. [2018-12-02 01:44:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 01:44:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876475 transitions. [2018-12-02 01:44:07,665 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876475 transitions. Word has length 54 [2018-12-02 01:44:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:07,666 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876475 transitions. [2018-12-02 01:44:07,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:44:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876475 transitions. [2018-12-02 01:44:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 01:44:07,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:07,691 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] [2018-12-02 01:44:07,691 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:07,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1926060511, now seen corresponding path program 1 times [2018-12-02 01:44:07,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:07,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:07,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:07,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:07,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:44:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:44:07,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:44:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:44:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:44:07,734 INFO L87 Difference]: Start difference. First operand 194885 states and 876475 transitions. Second operand 3 states. [2018-12-02 01:44:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:44:08,659 INFO L93 Difference]: Finished difference Result 194885 states and 876430 transitions. [2018-12-02 01:44:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:44:08,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-02 01:44:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:44:09,165 INFO L225 Difference]: With dead ends: 194885 [2018-12-02 01:44:09,165 INFO L226 Difference]: Without dead ends: 194885 [2018-12-02 01:44:09,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:44:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194885 states. [2018-12-02 01:44:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194885 to 194885. [2018-12-02 01:44:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 01:44:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876430 transitions. [2018-12-02 01:44:13,718 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876430 transitions. Word has length 61 [2018-12-02 01:44:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:13,718 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876430 transitions. [2018-12-02 01:44:13,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:44:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876430 transitions. [2018-12-02 01:44:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 01:44:13,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:13,744 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] [2018-12-02 01:44:13,744 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:13,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash -183250176, now seen corresponding path program 1 times [2018-12-02 01:44:13,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:13,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:13,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:44:13,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:13,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:44:13,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:13,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:44:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:44:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:44:13,824 INFO L87 Difference]: Start difference. First operand 194885 states and 876430 transitions. Second operand 6 states. [2018-12-02 01:44:16,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:44:16,255 INFO L93 Difference]: Finished difference Result 342295 states and 1509933 transitions. [2018-12-02 01:44:16,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:44:16,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 01:44:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:44:20,044 INFO L225 Difference]: With dead ends: 342295 [2018-12-02 01:44:20,044 INFO L226 Difference]: Without dead ends: 341295 [2018-12-02 01:44:20,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 01:44:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341295 states. [2018-12-02 01:44:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341295 to 189135. [2018-12-02 01:44:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189135 states. [2018-12-02 01:44:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189135 states to 189135 states and 850630 transitions. [2018-12-02 01:44:24,925 INFO L78 Accepts]: Start accepts. Automaton has 189135 states and 850630 transitions. Word has length 61 [2018-12-02 01:44:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:24,925 INFO L480 AbstractCegarLoop]: Abstraction has 189135 states and 850630 transitions. [2018-12-02 01:44:24,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:44:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 189135 states and 850630 transitions. [2018-12-02 01:44:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 01:44:24,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:24,999 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 01:44:24,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:24,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:24,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1250958823, now seen corresponding path program 1 times [2018-12-02 01:44:25,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:25,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:25,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:25,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:25,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:25,053 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 01:44:25,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:25,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:44:25,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:25,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:44:25,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:44:25,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:44:25,054 INFO L87 Difference]: Start difference. First operand 189135 states and 850630 transitions. Second operand 6 states. [2018-12-02 01:44:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:44:27,651 INFO L93 Difference]: Finished difference Result 402825 states and 1786032 transitions. [2018-12-02 01:44:27,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 01:44:27,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-02 01:44:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:44:29,321 INFO L225 Difference]: With dead ends: 402825 [2018-12-02 01:44:29,321 INFO L226 Difference]: Without dead ends: 401225 [2018-12-02 01:44:29,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:44:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401225 states. [2018-12-02 01:44:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401225 to 224570. [2018-12-02 01:44:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224570 states. [2018-12-02 01:44:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224570 states to 224570 states and 1000348 transitions. [2018-12-02 01:44:35,773 INFO L78 Accepts]: Start accepts. Automaton has 224570 states and 1000348 transitions. Word has length 68 [2018-12-02 01:44:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:35,773 INFO L480 AbstractCegarLoop]: Abstraction has 224570 states and 1000348 transitions. [2018-12-02 01:44:35,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:44:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 224570 states and 1000348 transitions. [2018-12-02 01:44:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 01:44:35,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:35,876 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] [2018-12-02 01:44:35,877 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:35,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 587746263, now seen corresponding path program 1 times [2018-12-02 01:44:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:35,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:35,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:35,911 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 01:44:35,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:35,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:44:35,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:35,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:44:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:44:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:44:35,912 INFO L87 Difference]: Start difference. First operand 224570 states and 1000348 transitions. Second operand 3 states. [2018-12-02 01:44:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:44:37,276 INFO L93 Difference]: Finished difference Result 283190 states and 1243374 transitions. [2018-12-02 01:44:37,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:44:37,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-02 01:44:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:44:40,877 INFO L225 Difference]: With dead ends: 283190 [2018-12-02 01:44:40,878 INFO L226 Difference]: Without dead ends: 283190 [2018-12-02 01:44:40,878 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 01:44:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283190 states. [2018-12-02 01:44:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283190 to 245735. [2018-12-02 01:44:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245735 states. [2018-12-02 01:44:46,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245735 states to 245735 states and 1089140 transitions. [2018-12-02 01:44:46,113 INFO L78 Accepts]: Start accepts. Automaton has 245735 states and 1089140 transitions. Word has length 70 [2018-12-02 01:44:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:46,113 INFO L480 AbstractCegarLoop]: Abstraction has 245735 states and 1089140 transitions. [2018-12-02 01:44:46,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:44:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 245735 states and 1089140 transitions. [2018-12-02 01:44:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 01:44:46,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:46,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:44:46,261 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:46,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:46,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1385046795, now seen corresponding path program 1 times [2018-12-02 01:44:46,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:46,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:46,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:46,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:46,708 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 01:44:46,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:46,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:44:46,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:46,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:44:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:44:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:44:46,710 INFO L87 Difference]: Start difference. First operand 245735 states and 1089140 transitions. Second operand 7 states. [2018-12-02 01:44:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:44:49,813 INFO L93 Difference]: Finished difference Result 448855 states and 1963116 transitions. [2018-12-02 01:44:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:44:49,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 01:44:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:44:51,186 INFO L225 Difference]: With dead ends: 448855 [2018-12-02 01:44:51,186 INFO L226 Difference]: Without dead ends: 447255 [2018-12-02 01:44:51,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:44:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447255 states. [2018-12-02 01:44:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447255 to 253355. [2018-12-02 01:44:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253355 states. [2018-12-02 01:44:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253355 states to 253355 states and 1121646 transitions. [2018-12-02 01:44:58,223 INFO L78 Accepts]: Start accepts. Automaton has 253355 states and 1121646 transitions. Word has length 74 [2018-12-02 01:44:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:44:58,224 INFO L480 AbstractCegarLoop]: Abstraction has 253355 states and 1121646 transitions. [2018-12-02 01:44:58,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:44:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 253355 states and 1121646 transitions. [2018-12-02 01:44:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 01:44:58,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:44:58,843 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] [2018-12-02 01:44:58,844 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:44:58,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:44:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 782165715, now seen corresponding path program 1 times [2018-12-02 01:44:58,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:44:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:58,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:44:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:44:58,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:44:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:44:58,872 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 01:44:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:44:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:44:58,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:44:58,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:44:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:44:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:44:58,872 INFO L87 Difference]: Start difference. First operand 253355 states and 1121646 transitions. Second operand 4 states. [2018-12-02 01:45:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:04,042 INFO L93 Difference]: Finished difference Result 378280 states and 1665596 transitions. [2018-12-02 01:45:04,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:45:04,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-02 01:45:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:05,072 INFO L225 Difference]: With dead ends: 378280 [2018-12-02 01:45:05,072 INFO L226 Difference]: Without dead ends: 375320 [2018-12-02 01:45:05,072 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 01:45:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375320 states. [2018-12-02 01:45:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375320 to 317205. [2018-12-02 01:45:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317205 states. [2018-12-02 01:45:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317205 states to 317205 states and 1406261 transitions. [2018-12-02 01:45:12,209 INFO L78 Accepts]: Start accepts. Automaton has 317205 states and 1406261 transitions. Word has length 75 [2018-12-02 01:45:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:12,209 INFO L480 AbstractCegarLoop]: Abstraction has 317205 states and 1406261 transitions. [2018-12-02 01:45:12,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:45:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 317205 states and 1406261 transitions. [2018-12-02 01:45:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 01:45:12,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:12,438 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] [2018-12-02 01:45:12,438 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:45:12,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2135475412, now seen corresponding path program 1 times [2018-12-02 01:45:12,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:12,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:12,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:12,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:12,975 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 01:45:12,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:12,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:45:12,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:12,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:45:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:45:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:45:12,976 INFO L87 Difference]: Start difference. First operand 317205 states and 1406261 transitions. Second operand 7 states. [2018-12-02 01:45:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:16,208 INFO L93 Difference]: Finished difference Result 455310 states and 2000550 transitions. [2018-12-02 01:45:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:45:16,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-02 01:45:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:17,581 INFO L225 Difference]: With dead ends: 455310 [2018-12-02 01:45:17,581 INFO L226 Difference]: Without dead ends: 453960 [2018-12-02 01:45:17,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-02 01:45:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453960 states. [2018-12-02 01:45:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453960 to 321680. [2018-12-02 01:45:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321680 states. [2018-12-02 01:45:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321680 states to 321680 states and 1424261 transitions. [2018-12-02 01:45:25,958 INFO L78 Accepts]: Start accepts. Automaton has 321680 states and 1424261 transitions. Word has length 75 [2018-12-02 01:45:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:25,959 INFO L480 AbstractCegarLoop]: Abstraction has 321680 states and 1424261 transitions. [2018-12-02 01:45:25,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:45:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 321680 states and 1424261 transitions. [2018-12-02 01:45:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 01:45:26,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:26,227 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] [2018-12-02 01:45:26,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:45:26,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1218293327, now seen corresponding path program 1 times [2018-12-02 01:45:26,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:26,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:26,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:26,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:26,303 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 01:45:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:45:26,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:26,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:45:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:45:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:45:26,304 INFO L87 Difference]: Start difference. First operand 321680 states and 1424261 transitions. Second operand 6 states. [2018-12-02 01:45:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:31,278 INFO L93 Difference]: Finished difference Result 397725 states and 1743892 transitions. [2018-12-02 01:45:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:45:31,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-02 01:45:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:32,737 INFO L225 Difference]: With dead ends: 397725 [2018-12-02 01:45:32,737 INFO L226 Difference]: Without dead ends: 393715 [2018-12-02 01:45:32,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:45:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393715 states. [2018-12-02 01:45:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393715 to 326395. [2018-12-02 01:45:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326395 states. [2018-12-02 01:45:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326395 states to 326395 states and 1442053 transitions. [2018-12-02 01:45:40,236 INFO L78 Accepts]: Start accepts. Automaton has 326395 states and 1442053 transitions. Word has length 77 [2018-12-02 01:45:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:40,236 INFO L480 AbstractCegarLoop]: Abstraction has 326395 states and 1442053 transitions. [2018-12-02 01:45:40,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:45:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 326395 states and 1442053 transitions. [2018-12-02 01:45:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 01:45:40,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:40,516 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] [2018-12-02 01:45:40,516 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:45:40,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059952, now seen corresponding path program 1 times [2018-12-02 01:45:40,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:40,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:40,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:40,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:40,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:40,582 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 01:45:40,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:45:40,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:40,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:45:40,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:45:40,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:45:40,583 INFO L87 Difference]: Start difference. First operand 326395 states and 1442053 transitions. Second operand 7 states. [2018-12-02 01:45:44,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:45:44,314 INFO L93 Difference]: Finished difference Result 477435 states and 2056850 transitions. [2018-12-02 01:45:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:45:44,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-12-02 01:45:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:45:45,707 INFO L225 Difference]: With dead ends: 477435 [2018-12-02 01:45:45,707 INFO L226 Difference]: Without dead ends: 477435 [2018-12-02 01:45:45,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 01:45:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477435 states. [2018-12-02 01:45:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477435 to 435770. [2018-12-02 01:45:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435770 states. [2018-12-02 01:45:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435770 states to 435770 states and 1891113 transitions. [2018-12-02 01:45:59,485 INFO L78 Accepts]: Start accepts. Automaton has 435770 states and 1891113 transitions. Word has length 77 [2018-12-02 01:45:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:45:59,485 INFO L480 AbstractCegarLoop]: Abstraction has 435770 states and 1891113 transitions. [2018-12-02 01:45:59,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:45:59,485 INFO L276 IsEmpty]: Start isEmpty. Operand 435770 states and 1891113 transitions. [2018-12-02 01:45:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 01:45:59,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:45:59,929 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] [2018-12-02 01:45:59,929 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:45:59,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:45:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -870295471, now seen corresponding path program 1 times [2018-12-02 01:45:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:45:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:45:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:45:59,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:45:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:45:59,960 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 01:45:59,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:45:59,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:45:59,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:45:59,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:45:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:45:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:45:59,961 INFO L87 Difference]: Start difference. First operand 435770 states and 1891113 transitions. Second operand 4 states. [2018-12-02 01:46:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:02,377 INFO L93 Difference]: Finished difference Result 376005 states and 1609116 transitions. [2018-12-02 01:46:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:46:02,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-02 01:46:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:03,409 INFO L225 Difference]: With dead ends: 376005 [2018-12-02 01:46:03,409 INFO L226 Difference]: Without dead ends: 373300 [2018-12-02 01:46:03,409 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 01:46:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373300 states. [2018-12-02 01:46:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373300 to 373300. [2018-12-02 01:46:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373300 states. [2018-12-02 01:46:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373300 states to 373300 states and 1600154 transitions. [2018-12-02 01:46:11,726 INFO L78 Accepts]: Start accepts. Automaton has 373300 states and 1600154 transitions. Word has length 77 [2018-12-02 01:46:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:11,726 INFO L480 AbstractCegarLoop]: Abstraction has 373300 states and 1600154 transitions. [2018-12-02 01:46:11,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 373300 states and 1600154 transitions. [2018-12-02 01:46:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 01:46:12,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:12,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:46:12,080 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:12,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:12,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1063574811, now seen corresponding path program 1 times [2018-12-02 01:46:12,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:12,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:12,106 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 01:46:12,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:12,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:46:12,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:12,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:46:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:46:12,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:46:12,107 INFO L87 Difference]: Start difference. First operand 373300 states and 1600154 transitions. Second operand 5 states. [2018-12-02 01:46:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:12,557 INFO L93 Difference]: Finished difference Result 104404 states and 415166 transitions. [2018-12-02 01:46:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:46:12,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-12-02 01:46:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:12,785 INFO L225 Difference]: With dead ends: 104404 [2018-12-02 01:46:12,785 INFO L226 Difference]: Without dead ends: 102012 [2018-12-02 01:46:12,786 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 01:46:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102012 states. [2018-12-02 01:46:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102012 to 101952. [2018-12-02 01:46:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101952 states. [2018-12-02 01:46:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101952 states to 101952 states and 406002 transitions. [2018-12-02 01:46:17,327 INFO L78 Accepts]: Start accepts. Automaton has 101952 states and 406002 transitions. Word has length 78 [2018-12-02 01:46:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:17,327 INFO L480 AbstractCegarLoop]: Abstraction has 101952 states and 406002 transitions. [2018-12-02 01:46:17,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:46:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 101952 states and 406002 transitions. [2018-12-02 01:46:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 01:46:17,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:17,421 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] [2018-12-02 01:46:17,421 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:17,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash 326154353, now seen corresponding path program 1 times [2018-12-02 01:46:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:17,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:17,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:46:17,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:17,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:17,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:17,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:17,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:17,462 INFO L87 Difference]: Start difference. First operand 101952 states and 406002 transitions. Second operand 4 states. [2018-12-02 01:46:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:18,332 INFO L93 Difference]: Finished difference Result 137720 states and 542591 transitions. [2018-12-02 01:46:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:46:18,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 01:46:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:18,632 INFO L225 Difference]: With dead ends: 137720 [2018-12-02 01:46:18,632 INFO L226 Difference]: Without dead ends: 137720 [2018-12-02 01:46:18,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 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 01:46:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137720 states. [2018-12-02 01:46:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137720 to 107480. [2018-12-02 01:46:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107480 states. [2018-12-02 01:46:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107480 states to 107480 states and 426735 transitions. [2018-12-02 01:46:20,779 INFO L78 Accepts]: Start accepts. Automaton has 107480 states and 426735 transitions. Word has length 88 [2018-12-02 01:46:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:20,780 INFO L480 AbstractCegarLoop]: Abstraction has 107480 states and 426735 transitions. [2018-12-02 01:46:20,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 107480 states and 426735 transitions. [2018-12-02 01:46:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 01:46:20,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:20,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:46:20,879 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:20,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1316182289, now seen corresponding path program 1 times [2018-12-02 01:46:20,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:20,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:20,916 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 01:46:20,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:20,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:20,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:20,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:20,916 INFO L87 Difference]: Start difference. First operand 107480 states and 426735 transitions. Second operand 4 states. [2018-12-02 01:46:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:21,826 INFO L93 Difference]: Finished difference Result 147543 states and 578741 transitions. [2018-12-02 01:46:21,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:46:21,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 01:46:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:22,157 INFO L225 Difference]: With dead ends: 147543 [2018-12-02 01:46:22,158 INFO L226 Difference]: Without dead ends: 147543 [2018-12-02 01:46:22,158 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 01:46:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147543 states. [2018-12-02 01:46:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147543 to 134136. [2018-12-02 01:46:24,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134136 states. [2018-12-02 01:46:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134136 states to 134136 states and 529007 transitions. [2018-12-02 01:46:24,963 INFO L78 Accepts]: Start accepts. Automaton has 134136 states and 529007 transitions. Word has length 88 [2018-12-02 01:46:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:24,964 INFO L480 AbstractCegarLoop]: Abstraction has 134136 states and 529007 transitions. [2018-12-02 01:46:24,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 134136 states and 529007 transitions. [2018-12-02 01:46:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 01:46:25,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:25,083 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] [2018-12-02 01:46:25,083 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:25,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:25,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1645948050, now seen corresponding path program 1 times [2018-12-02 01:46:25,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:25,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:25,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:25,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:25,172 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 01:46:25,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 01:46:25,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:25,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 01:46:25,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 01:46:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:46:25,172 INFO L87 Difference]: Start difference. First operand 134136 states and 529007 transitions. Second operand 8 states. [2018-12-02 01:46:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:26,779 INFO L93 Difference]: Finished difference Result 196170 states and 756695 transitions. [2018-12-02 01:46:26,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 01:46:26,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-12-02 01:46:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:27,222 INFO L225 Difference]: With dead ends: 196170 [2018-12-02 01:46:27,222 INFO L226 Difference]: Without dead ends: 194570 [2018-12-02 01:46:27,223 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 01:46:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194570 states. [2018-12-02 01:46:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194570 to 145961. [2018-12-02 01:46:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145961 states. [2018-12-02 01:46:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145961 states to 145961 states and 572957 transitions. [2018-12-02 01:46:30,333 INFO L78 Accepts]: Start accepts. Automaton has 145961 states and 572957 transitions. Word has length 88 [2018-12-02 01:46:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:30,333 INFO L480 AbstractCegarLoop]: Abstraction has 145961 states and 572957 transitions. [2018-12-02 01:46:30,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 01:46:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 145961 states and 572957 transitions. [2018-12-02 01:46:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 01:46:30,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:30,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] [2018-12-02 01:46:30,473 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:30,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 801476179, now seen corresponding path program 1 times [2018-12-02 01:46:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:30,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:30,516 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 01:46:30,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:30,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:46:30,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:30,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:46:30,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:46:30,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:46:30,517 INFO L87 Difference]: Start difference. First operand 145961 states and 572957 transitions. Second operand 6 states. [2018-12-02 01:46:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:30,594 INFO L93 Difference]: Finished difference Result 22153 states and 74477 transitions. [2018-12-02 01:46:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:46:30,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2018-12-02 01:46:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:30,621 INFO L225 Difference]: With dead ends: 22153 [2018-12-02 01:46:30,621 INFO L226 Difference]: Without dead ends: 19123 [2018-12-02 01:46:30,621 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 01:46:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19123 states. [2018-12-02 01:46:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19123 to 17883. [2018-12-02 01:46:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17883 states. [2018-12-02 01:46:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17883 states to 17883 states and 60376 transitions. [2018-12-02 01:46:30,827 INFO L78 Accepts]: Start accepts. Automaton has 17883 states and 60376 transitions. Word has length 88 [2018-12-02 01:46:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:30,827 INFO L480 AbstractCegarLoop]: Abstraction has 17883 states and 60376 transitions. [2018-12-02 01:46:30,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:46:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 17883 states and 60376 transitions. [2018-12-02 01:46:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:46:30,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:30,843 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 01:46:30,843 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:30,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash 632352529, now seen corresponding path program 1 times [2018-12-02 01:46:30,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:30,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:30,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:30,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:30,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:30,875 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 01:46:30,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:30,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:30,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:30,877 INFO L87 Difference]: Start difference. First operand 17883 states and 60376 transitions. Second operand 4 states. [2018-12-02 01:46:30,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:30,993 INFO L93 Difference]: Finished difference Result 20589 states and 68728 transitions. [2018-12-02 01:46:30,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:46:30,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:46:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:31,018 INFO L225 Difference]: With dead ends: 20589 [2018-12-02 01:46:31,018 INFO L226 Difference]: Without dead ends: 20449 [2018-12-02 01:46:31,018 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 01:46:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20449 states. [2018-12-02 01:46:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20449 to 20216. [2018-12-02 01:46:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20216 states. [2018-12-02 01:46:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20216 states to 20216 states and 67696 transitions. [2018-12-02 01:46:31,235 INFO L78 Accepts]: Start accepts. Automaton has 20216 states and 67696 transitions. Word has length 101 [2018-12-02 01:46:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:31,235 INFO L480 AbstractCegarLoop]: Abstraction has 20216 states and 67696 transitions. [2018-12-02 01:46:31,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20216 states and 67696 transitions. [2018-12-02 01:46:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:46:31,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:31,253 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 01:46:31,253 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:31,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1601933552, now seen corresponding path program 1 times [2018-12-02 01:46:31,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:31,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:31,300 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 01:46:31,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:31,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:31,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:31,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:31,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:31,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:31,301 INFO L87 Difference]: Start difference. First operand 20216 states and 67696 transitions. Second operand 4 states. [2018-12-02 01:46:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:31,503 INFO L93 Difference]: Finished difference Result 24660 states and 82838 transitions. [2018-12-02 01:46:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:46:31,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:46:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:31,538 INFO L225 Difference]: With dead ends: 24660 [2018-12-02 01:46:31,538 INFO L226 Difference]: Without dead ends: 24660 [2018-12-02 01:46:31,538 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 01:46:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2018-12-02 01:46:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 19541. [2018-12-02 01:46:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19541 states. [2018-12-02 01:46:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 65261 transitions. [2018-12-02 01:46:32,026 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 65261 transitions. Word has length 101 [2018-12-02 01:46:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:32,026 INFO L480 AbstractCegarLoop]: Abstraction has 19541 states and 65261 transitions. [2018-12-02 01:46:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 65261 transitions. [2018-12-02 01:46:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:46:32,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:32,043 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 01:46:32,044 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:32,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash 866090626, now seen corresponding path program 2 times [2018-12-02 01:46:32,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:32,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:32,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:32,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:32,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:32,088 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 01:46:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:32,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:46:32,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:32,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:46:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:46:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:46:32,089 INFO L87 Difference]: Start difference. First operand 19541 states and 65261 transitions. Second operand 5 states. [2018-12-02 01:46:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:32,236 INFO L93 Difference]: Finished difference Result 21587 states and 71630 transitions. [2018-12-02 01:46:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:46:32,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-02 01:46:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:32,262 INFO L225 Difference]: With dead ends: 21587 [2018-12-02 01:46:32,262 INFO L226 Difference]: Without dead ends: 21447 [2018-12-02 01:46:32,263 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 01:46:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21447 states. [2018-12-02 01:46:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21447 to 19566. [2018-12-02 01:46:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19566 states. [2018-12-02 01:46:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19566 states to 19566 states and 65291 transitions. [2018-12-02 01:46:32,485 INFO L78 Accepts]: Start accepts. Automaton has 19566 states and 65291 transitions. Word has length 101 [2018-12-02 01:46:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:32,485 INFO L480 AbstractCegarLoop]: Abstraction has 19566 states and 65291 transitions. [2018-12-02 01:46:32,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:46:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19566 states and 65291 transitions. [2018-12-02 01:46:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:46:32,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:32,502 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 01:46:32,502 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:32,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1977214670, now seen corresponding path program 1 times [2018-12-02 01:46:32,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:32,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:46:32,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:32,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:32,541 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 01:46:32,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:32,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:46:32,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:32,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:46:32,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:46:32,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:46:32,542 INFO L87 Difference]: Start difference. First operand 19566 states and 65291 transitions. Second operand 4 states. [2018-12-02 01:46:32,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:32,707 INFO L93 Difference]: Finished difference Result 34741 states and 116437 transitions. [2018-12-02 01:46:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:46:32,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 01:46:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:32,758 INFO L225 Difference]: With dead ends: 34741 [2018-12-02 01:46:32,758 INFO L226 Difference]: Without dead ends: 34601 [2018-12-02 01:46:32,758 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 01:46:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34601 states. [2018-12-02 01:46:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34601 to 19176. [2018-12-02 01:46:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2018-12-02 01:46:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 63809 transitions. [2018-12-02 01:46:33,051 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 63809 transitions. Word has length 103 [2018-12-02 01:46:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:33,051 INFO L480 AbstractCegarLoop]: Abstraction has 19176 states and 63809 transitions. [2018-12-02 01:46:33,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:46:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 63809 transitions. [2018-12-02 01:46:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:46:33,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:33,067 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 01:46:33,068 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:33,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1987986865, now seen corresponding path program 1 times [2018-12-02 01:46:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:33,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:33,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:33,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:46:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:33,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 01:46:33,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:33,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:46:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:46:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:46:33,133 INFO L87 Difference]: Start difference. First operand 19176 states and 63809 transitions. Second operand 7 states. [2018-12-02 01:46:33,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:33,305 INFO L93 Difference]: Finished difference Result 21055 states and 69635 transitions. [2018-12-02 01:46:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:46:33,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 01:46:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:33,329 INFO L225 Difference]: With dead ends: 21055 [2018-12-02 01:46:33,329 INFO L226 Difference]: Without dead ends: 21055 [2018-12-02 01:46:33,330 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 01:46:33,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21055 states. [2018-12-02 01:46:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21055 to 19631. [2018-12-02 01:46:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19631 states. [2018-12-02 01:46:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19631 states to 19631 states and 65043 transitions. [2018-12-02 01:46:33,536 INFO L78 Accepts]: Start accepts. Automaton has 19631 states and 65043 transitions. Word has length 103 [2018-12-02 01:46:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:33,536 INFO L480 AbstractCegarLoop]: Abstraction has 19631 states and 65043 transitions. [2018-12-02 01:46:33,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:46:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19631 states and 65043 transitions. [2018-12-02 01:46:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:46:33,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:33,552 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 01:46:33,552 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:33,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1123633134, now seen corresponding path program 1 times [2018-12-02 01:46:33,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:33,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:33,605 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 01:46:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:33,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:46:33,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:33,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:46:33,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:46:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:46:33,606 INFO L87 Difference]: Start difference. First operand 19631 states and 65043 transitions. Second operand 5 states. [2018-12-02 01:46:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:33,704 INFO L93 Difference]: Finished difference Result 17370 states and 57797 transitions. [2018-12-02 01:46:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:46:33,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-02 01:46:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:33,725 INFO L225 Difference]: With dead ends: 17370 [2018-12-02 01:46:33,725 INFO L226 Difference]: Without dead ends: 17370 [2018-12-02 01:46:33,725 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 01:46:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17370 states. [2018-12-02 01:46:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17370 to 16910. [2018-12-02 01:46:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16910 states. [2018-12-02 01:46:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16910 states to 16910 states and 56484 transitions. [2018-12-02 01:46:34,049 INFO L78 Accepts]: Start accepts. Automaton has 16910 states and 56484 transitions. Word has length 103 [2018-12-02 01:46:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:34,050 INFO L480 AbstractCegarLoop]: Abstraction has 16910 states and 56484 transitions. [2018-12-02 01:46:34,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:46:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16910 states and 56484 transitions. [2018-12-02 01:46:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:46:34,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:34,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, 1, 1] [2018-12-02 01:46:34,065 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:34,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:34,065 INFO L82 PathProgramCache]: Analyzing trace with hash 200949551, now seen corresponding path program 1 times [2018-12-02 01:46:34,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:34,142 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 01:46:34,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:46:34,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:34,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:46:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:46:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:46:34,143 INFO L87 Difference]: Start difference. First operand 16910 states and 56484 transitions. Second operand 6 states. [2018-12-02 01:46:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:34,274 INFO L93 Difference]: Finished difference Result 13838 states and 45284 transitions. [2018-12-02 01:46:34,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:46:34,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 01:46:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:34,290 INFO L225 Difference]: With dead ends: 13838 [2018-12-02 01:46:34,290 INFO L226 Difference]: Without dead ends: 13838 [2018-12-02 01:46:34,291 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 01:46:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13838 states. [2018-12-02 01:46:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13838 to 12349. [2018-12-02 01:46:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12349 states. [2018-12-02 01:46:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 40670 transitions. [2018-12-02 01:46:34,433 INFO L78 Accepts]: Start accepts. Automaton has 12349 states and 40670 transitions. Word has length 103 [2018-12-02 01:46:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:34,433 INFO L480 AbstractCegarLoop]: Abstraction has 12349 states and 40670 transitions. [2018-12-02 01:46:34,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:46:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 12349 states and 40670 transitions. [2018-12-02 01:46:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:34,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:34,444 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 01:46:34,444 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:34,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1076412754, now seen corresponding path program 1 times [2018-12-02 01:46:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:34,500 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 01:46:34,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:34,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:46:34,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:34,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:46:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:46:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:46:34,501 INFO L87 Difference]: Start difference. First operand 12349 states and 40670 transitions. Second operand 6 states. [2018-12-02 01:46:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:34,567 INFO L93 Difference]: Finished difference Result 13074 states and 42480 transitions. [2018-12-02 01:46:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:46:34,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 01:46:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:34,581 INFO L225 Difference]: With dead ends: 13074 [2018-12-02 01:46:34,581 INFO L226 Difference]: Without dead ends: 12849 [2018-12-02 01:46:34,581 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 01:46:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12849 states. [2018-12-02 01:46:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12849 to 12214. [2018-12-02 01:46:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2018-12-02 01:46:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 40137 transitions. [2018-12-02 01:46:34,701 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 40137 transitions. Word has length 105 [2018-12-02 01:46:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:34,701 INFO L480 AbstractCegarLoop]: Abstraction has 12214 states and 40137 transitions. [2018-12-02 01:46:34,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:46:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 40137 transitions. [2018-12-02 01:46:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:34,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:34,710 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 01:46:34,710 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:34,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash -859247533, now seen corresponding path program 1 times [2018-12-02 01:46:34,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:34,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:34,777 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 01:46:34,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:34,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:46:34,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:34,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:46:34,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:46:34,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:46:34,778 INFO L87 Difference]: Start difference. First operand 12214 states and 40137 transitions. Second operand 5 states. [2018-12-02 01:46:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:34,927 INFO L93 Difference]: Finished difference Result 14006 states and 45897 transitions. [2018-12-02 01:46:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 01:46:34,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 01:46:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:34,944 INFO L225 Difference]: With dead ends: 14006 [2018-12-02 01:46:34,944 INFO L226 Difference]: Without dead ends: 13878 [2018-12-02 01:46:34,944 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 01:46:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13878 states. [2018-12-02 01:46:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13878 to 11363. [2018-12-02 01:46:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11363 states. [2018-12-02 01:46:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 37397 transitions. [2018-12-02 01:46:35,079 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 37397 transitions. Word has length 105 [2018-12-02 01:46:35,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:35,079 INFO L480 AbstractCegarLoop]: Abstraction has 11363 states and 37397 transitions. [2018-12-02 01:46:35,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:46:35,079 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 37397 transitions. [2018-12-02 01:46:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:35,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:35,089 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 01:46:35,090 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:35,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 385516948, now seen corresponding path program 1 times [2018-12-02 01:46:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:35,144 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 01:46:35,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:35,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:46:35,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:35,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:46:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:46:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:46:35,145 INFO L87 Difference]: Start difference. First operand 11363 states and 37397 transitions. Second operand 5 states. [2018-12-02 01:46:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:35,199 INFO L93 Difference]: Finished difference Result 18171 states and 60562 transitions. [2018-12-02 01:46:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:46:35,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 01:46:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:35,223 INFO L225 Difference]: With dead ends: 18171 [2018-12-02 01:46:35,223 INFO L226 Difference]: Without dead ends: 18171 [2018-12-02 01:46:35,223 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 01:46:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2018-12-02 01:46:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 11243. [2018-12-02 01:46:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11243 states. [2018-12-02 01:46:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11243 states to 11243 states and 36776 transitions. [2018-12-02 01:46:35,379 INFO L78 Accepts]: Start accepts. Automaton has 11243 states and 36776 transitions. Word has length 105 [2018-12-02 01:46:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:35,379 INFO L480 AbstractCegarLoop]: Abstraction has 11243 states and 36776 transitions. [2018-12-02 01:46:35,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:46:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11243 states and 36776 transitions. [2018-12-02 01:46:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:35,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:35,389 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 01:46:35,389 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:35,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1355097971, now seen corresponding path program 1 times [2018-12-02 01:46:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:35,458 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 01:46:35,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:35,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 01:46:35,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:35,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:46:35,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:46:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:46:35,459 INFO L87 Difference]: Start difference. First operand 11243 states and 36776 transitions. Second operand 9 states. [2018-12-02 01:46:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:35,604 INFO L93 Difference]: Finished difference Result 20983 states and 69321 transitions. [2018-12-02 01:46:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:46:35,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 01:46:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:35,616 INFO L225 Difference]: With dead ends: 20983 [2018-12-02 01:46:35,616 INFO L226 Difference]: Without dead ends: 10583 [2018-12-02 01:46:35,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 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 01:46:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2018-12-02 01:46:35,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10583. [2018-12-02 01:46:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10583 states. [2018-12-02 01:46:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 34856 transitions. [2018-12-02 01:46:35,734 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 34856 transitions. Word has length 105 [2018-12-02 01:46:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:35,734 INFO L480 AbstractCegarLoop]: Abstraction has 10583 states and 34856 transitions. [2018-12-02 01:46:35,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:46:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 34856 transitions. [2018-12-02 01:46:35,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:35,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:35,744 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 01:46:35,744 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:35,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1863121905, now seen corresponding path program 2 times [2018-12-02 01:46:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:46:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:35,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:35,855 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 01:46:35,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:35,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 01:46:35,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:35,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 01:46:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 01:46:35,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 01:46:35,856 INFO L87 Difference]: Start difference. First operand 10583 states and 34856 transitions. Second operand 9 states. [2018-12-02 01:46:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:35,978 INFO L93 Difference]: Finished difference Result 17971 states and 59941 transitions. [2018-12-02 01:46:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 01:46:35,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 01:46:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:35,987 INFO L225 Difference]: With dead ends: 17971 [2018-12-02 01:46:35,987 INFO L226 Difference]: Without dead ends: 7632 [2018-12-02 01:46:35,987 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 01:46:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7632 states. [2018-12-02 01:46:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7632 to 7632. [2018-12-02 01:46:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7632 states. [2018-12-02 01:46:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7632 states to 7632 states and 25729 transitions. [2018-12-02 01:46:36,064 INFO L78 Accepts]: Start accepts. Automaton has 7632 states and 25729 transitions. Word has length 105 [2018-12-02 01:46:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:36,064 INFO L480 AbstractCegarLoop]: Abstraction has 7632 states and 25729 transitions. [2018-12-02 01:46:36,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 01:46:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 7632 states and 25729 transitions. [2018-12-02 01:46:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:36,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:36,071 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 01:46:36,071 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:36,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:36,071 INFO L82 PathProgramCache]: Analyzing trace with hash -486297935, now seen corresponding path program 3 times [2018-12-02 01:46:36,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:36,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:46:36,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:36,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:46:36,191 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 01:46:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:46:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 01:46:36,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:46:36,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 01:46:36,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 01:46:36,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:46:36,192 INFO L87 Difference]: Start difference. First operand 7632 states and 25729 transitions. Second operand 12 states. [2018-12-02 01:46:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:46:36,534 INFO L93 Difference]: Finished difference Result 14700 states and 49790 transitions. [2018-12-02 01:46:36,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 01:46:36,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 01:46:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:46:36,547 INFO L225 Difference]: With dead ends: 14700 [2018-12-02 01:46:36,547 INFO L226 Difference]: Without dead ends: 10156 [2018-12-02 01:46:36,547 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 01:46:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2018-12-02 01:46:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9548. [2018-12-02 01:46:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9548 states. [2018-12-02 01:46:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9548 states to 9548 states and 31622 transitions. [2018-12-02 01:46:36,655 INFO L78 Accepts]: Start accepts. Automaton has 9548 states and 31622 transitions. Word has length 105 [2018-12-02 01:46:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:46:36,655 INFO L480 AbstractCegarLoop]: Abstraction has 9548 states and 31622 transitions. [2018-12-02 01:46:36,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 01:46:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 9548 states and 31622 transitions. [2018-12-02 01:46:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:46:36,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:46:36,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:46:36,664 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:46:36,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:46:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1610066251, now seen corresponding path program 4 times [2018-12-02 01:46:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:46:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:36,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:46:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:46:36,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:46:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:46:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:46:36,705 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:46:36,778 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 01:46:36,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:46:36 BasicIcfg [2018-12-02 01:46:36,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:46:36,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:46:36,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:46:36,780 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:46:36,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:43:18" (3/4) ... [2018-12-02 01:46:36,783 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 01:46:36,862 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a6fd64a0-0b6f-464c-be67-afd04706dcb6/bin-2019/utaipan/witness.graphml [2018-12-02 01:46:36,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:46:36,863 INFO L168 Benchmark]: Toolchain (without parser) took 199149.00 ms. Allocated memory was 1.0 GB in the beginning and 10.3 GB in the end (delta: 9.3 GB). Free memory was 950.6 MB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,864 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:46:36,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,864 INFO L168 Benchmark]: Boogie Preprocessor took 20.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,865 INFO L168 Benchmark]: RCFGBuilder took 348.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,865 INFO L168 Benchmark]: TraceAbstraction took 198317.89 ms. Allocated memory was 1.1 GB in the beginning and 10.3 GB in the end (delta: 9.2 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,865 INFO L168 Benchmark]: Witness Printer took 82.32 ms. Allocated memory is still 10.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-02 01:46:36,866 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 348.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198317.89 ms. Allocated memory was 1.1 GB in the beginning and 10.3 GB in the end (delta: 9.2 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.5 GB). Peak memory consumption was 5.7 GB. Max. memory is 11.5 GB. * Witness Printer took 82.32 ms. Allocated memory is still 10.3 GB. Free memory was 4.5 GB in the beginning and 4.5 GB in the end (delta: 28.4 MB). Peak memory consumption was 28.4 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 t1128; 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(&t1128, ((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 t1129; 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(&t1129, ((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 t1130; 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(&t1130, ((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] [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=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] [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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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, 198.2s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 66.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9016 SDtfs, 10467 SDslu, 21333 SDs, 0 SdLazy, 7660 SolverSat, 511 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 92 SyntacticMatches, 20 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435770occurred in iteration=13, 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: 111.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 1350623 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2801 NumberOfCodeBlocks, 2801 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2664 ConstructedInterpolants, 0 QuantifiedInterpolants, 542729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...