./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_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_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/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 681e0475f78a5efa68ae10892d48464d4d57efbf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 04:02:43,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:02:43,018 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:02:43,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:02:43,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:02:43,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:02:43,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:02:43,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:02:43,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:02:43,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:02:43,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:02:43,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:02:43,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:02:43,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:02:43,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:02:43,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:02:43,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:02:43,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:02:43,032 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:02:43,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:02:43,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:02:43,034 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:02:43,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:02:43,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:02:43,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:02:43,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:02:43,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:02:43,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:02:43,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:02:43,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:02:43,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:02:43,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:02:43,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:02:43,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:02:43,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:02:43,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:02:43,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 04:02:43,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:02:43,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:02:43,048 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:02:43,048 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:02:43,048 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:02:43,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:02:43,048 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:02:43,049 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:02:43,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:02:43,050 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:02:43,051 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:02:43,051 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:02:43,052 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:02:43,052 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:02:43,052 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_ae342c0c-7923-4551-82b8-b806e67c51d6/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 -> 681e0475f78a5efa68ae10892d48464d4d57efbf [2018-12-03 04:02:43,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:02:43,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:02:43,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:02:43,080 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:02:43,080 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:02:43,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-03 04:02:43,117 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/data/78c09603b/a6417a11c2c94eeca4ec7882d34ff082/FLAGb42c19f3b [2018-12-03 04:02:43,443 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:02:43,444 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-03 04:02:43,451 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/data/78c09603b/a6417a11c2c94eeca4ec7882d34ff082/FLAGb42c19f3b [2018-12-03 04:02:43,460 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/data/78c09603b/a6417a11c2c94eeca4ec7882d34ff082 [2018-12-03 04:02:43,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:02:43,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:02:43,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:02:43,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:02:43,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:02:43,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43, skipping insertion in model container [2018-12-03 04:02:43,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:02:43,497 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:02:43,683 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:02:43,690 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:02:43,765 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:02:43,795 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:02:43,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43 WrapperNode [2018-12-03 04:02:43,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:02:43,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:02:43,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:02:43,796 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:02:43,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:02:43,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:02:43,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:02:43,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:02:43,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... [2018-12-03 04:02:43,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:02:43,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:02:43,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:02:43,850 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:02:43,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/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-03 04:02:43,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 04:02:43,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 04:02:43,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 04:02:43,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 04:02:43,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 04:02:43,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:02:43,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:02:43,885 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 04:02:44,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:02:44,215 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 04:02:44,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:02:44 BoogieIcfgContainer [2018-12-03 04:02:44,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:02:44,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:02:44,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:02:44,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:02:44,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:02:43" (1/3) ... [2018-12-03 04:02:44,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313c43d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:02:44, skipping insertion in model container [2018-12-03 04:02:44,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:02:43" (2/3) ... [2018-12-03 04:02:44,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313c43d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:02:44, skipping insertion in model container [2018-12-03 04:02:44,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:02:44" (3/3) ... [2018-12-03 04:02:44,220 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt_false-unreach-call.i [2018-12-03 04:02:44,241 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,242 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,243 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,244 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,245 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,246 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,247 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,248 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,249 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 04:02:44,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 04:02:44,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:02:44,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 04:02:44,270 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 04:02:44,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:02:44,285 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:02:44,285 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:02:44,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:02:44,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:02:44,285 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:02:44,285 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:02:44,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:02:44,293 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-03 04:02:58,483 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-03 04:02:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-03 04:02:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 04:02:58,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:02:58,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:02:58,493 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:02:58,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:02:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-03 04:02:58,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:02:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:02:58,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:02:58,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:02:58,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:02:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:02:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:02:58,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:02:58,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:02:58,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:02:58,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:02:58,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:02:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:02:58,650 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-03 04:03:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:00,048 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-03 04:03:00,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:03:00,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-03 04:03:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:00,828 INFO L225 Difference]: With dead ends: 233474 [2018-12-03 04:03:00,828 INFO L226 Difference]: Without dead ends: 203724 [2018-12-03 04:03:00,829 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-03 04:03:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-03 04:03:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-03 04:03:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-03 04:03:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-03 04:03:06,293 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-03 04:03:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:06,294 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-03 04:03:06,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:03:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-03 04:03:06,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 04:03:06,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:06,301 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] [2018-12-03 04:03:06,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:06,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-03 04:03:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:06,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:06,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:06,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:06,351 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-03 04:03:06,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:06,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:03:06,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:06,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:03:06,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:03:06,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:03:06,354 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-03 04:03:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:06,897 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-03 04:03:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:03:06,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 04:03:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:07,260 INFO L225 Difference]: With dead ends: 118894 [2018-12-03 04:03:07,260 INFO L226 Difference]: Without dead ends: 118894 [2018-12-03 04:03:07,260 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-03 04:03:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-03 04:03:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-03 04:03:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-03 04:03:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-03 04:03:10,006 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-03 04:03:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:10,006 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-03 04:03:10,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:03:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-03 04:03:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 04:03:10,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:10,010 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] [2018-12-03 04:03:10,010 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:10,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-03 04:03:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:10,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:10,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:10,068 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-03 04:03:10,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:10,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:10,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:10,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:10,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:10,069 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-03 04:03:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:12,117 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-03 04:03:12,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:12,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 04:03:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:12,987 INFO L225 Difference]: With dead ends: 325274 [2018-12-03 04:03:12,987 INFO L226 Difference]: Without dead ends: 324274 [2018-12-03 04:03:12,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:03:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-03 04:03:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-03 04:03:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-03 04:03:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-03 04:03:20,792 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-03 04:03:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:20,792 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-03 04:03:20,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-03 04:03:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 04:03:20,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:20,799 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-03 04:03:20,799 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:20,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-03 04:03:20,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:20,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:20,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:20,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:20,833 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-03 04:03:20,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:20,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:03:20,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:20,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:03:20,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:03:20,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:03:20,835 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 4 states. [2018-12-03 04:03:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:21,580 INFO L93 Difference]: Finished difference Result 163600 states and 725474 transitions. [2018-12-03 04:03:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:03:21,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-03 04:03:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:21,979 INFO L225 Difference]: With dead ends: 163600 [2018-12-03 04:03:21,979 INFO L226 Difference]: Without dead ends: 160995 [2018-12-03 04:03:21,980 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-03 04:03:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-03 04:03:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-03 04:03:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-03 04:03:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716802 transitions. [2018-12-03 04:03:28,263 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716802 transitions. Word has length 53 [2018-12-03 04:03:28,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:28,263 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716802 transitions. [2018-12-03 04:03:28,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:03:28,263 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716802 transitions. [2018-12-03 04:03:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 04:03:28,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:28,268 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-03 04:03:28,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:28,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1135621285, now seen corresponding path program 1 times [2018-12-03 04:03:28,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:28,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:28,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:28,298 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-03 04:03:28,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:03:28,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:28,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:03:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:03:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:03:28,299 INFO L87 Difference]: Start difference. First operand 160995 states and 716802 transitions. Second operand 3 states. [2018-12-03 04:03:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:29,009 INFO L93 Difference]: Finished difference Result 160995 states and 716766 transitions. [2018-12-03 04:03:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:03:29,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 04:03:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:29,401 INFO L225 Difference]: With dead ends: 160995 [2018-12-03 04:03:29,402 INFO L226 Difference]: Without dead ends: 160995 [2018-12-03 04:03:29,402 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-03 04:03:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-03 04:03:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-03 04:03:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-03 04:03:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716766 transitions. [2018-12-03 04:03:32,978 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716766 transitions. Word has length 54 [2018-12-03 04:03:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:32,979 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716766 transitions. [2018-12-03 04:03:32,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:03:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716766 transitions. [2018-12-03 04:03:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 04:03:32,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:32,983 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-03 04:03:32,983 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:32,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1416535676, now seen corresponding path program 1 times [2018-12-03 04:03:32,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:32,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:32,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:33,023 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-03 04:03:33,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:33,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:33,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:33,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:33,024 INFO L87 Difference]: Start difference. First operand 160995 states and 716766 transitions. Second operand 5 states. [2018-12-03 04:03:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:34,419 INFO L93 Difference]: Finished difference Result 289851 states and 1285659 transitions. [2018-12-03 04:03:34,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:34,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-03 04:03:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:37,733 INFO L225 Difference]: With dead ends: 289851 [2018-12-03 04:03:37,733 INFO L226 Difference]: Without dead ends: 289011 [2018-12-03 04:03:37,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:03:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289011 states. [2018-12-03 04:03:41,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289011 to 169615. [2018-12-03 04:03:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-12-03 04:03:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752619 transitions. [2018-12-03 04:03:41,799 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752619 transitions. Word has length 54 [2018-12-03 04:03:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:41,799 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752619 transitions. [2018-12-03 04:03:41,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752619 transitions. [2018-12-03 04:03:41,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 04:03:41,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:41,819 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-03 04:03:41,819 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:41,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1663856536, now seen corresponding path program 1 times [2018-12-03 04:03:41,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:41,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:41,865 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-03 04:03:41,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:41,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:41,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:41,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:41,866 INFO L87 Difference]: Start difference. First operand 169615 states and 752619 transitions. Second operand 5 states. [2018-12-03 04:03:42,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:42,107 INFO L93 Difference]: Finished difference Result 59119 states and 239395 transitions. [2018-12-03 04:03:42,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:03:42,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-03 04:03:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:42,223 INFO L225 Difference]: With dead ends: 59119 [2018-12-03 04:03:42,223 INFO L226 Difference]: Without dead ends: 56807 [2018-12-03 04:03:42,223 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-03 04:03:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56807 states. [2018-12-03 04:03:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56807 to 56807. [2018-12-03 04:03:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56807 states. [2018-12-03 04:03:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56807 states to 56807 states and 230741 transitions. [2018-12-03 04:03:43,363 INFO L78 Accepts]: Start accepts. Automaton has 56807 states and 230741 transitions. Word has length 61 [2018-12-03 04:03:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:43,363 INFO L480 AbstractCegarLoop]: Abstraction has 56807 states and 230741 transitions. [2018-12-03 04:03:43,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 56807 states and 230741 transitions. [2018-12-03 04:03:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 04:03:43,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:43,372 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] [2018-12-03 04:03:43,372 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:43,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2018-12-03 04:03:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:43,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:43,418 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-03 04:03:43,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:43,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:03:43,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:43,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:03:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:03:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:03:43,419 INFO L87 Difference]: Start difference. First operand 56807 states and 230741 transitions. Second operand 4 states. [2018-12-03 04:03:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:43,779 INFO L93 Difference]: Finished difference Result 78971 states and 316066 transitions. [2018-12-03 04:03:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:03:43,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 04:03:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:43,929 INFO L225 Difference]: With dead ends: 78971 [2018-12-03 04:03:43,929 INFO L226 Difference]: Without dead ends: 78971 [2018-12-03 04:03:43,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-12-03 04:03:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 61563. [2018-12-03 04:03:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61563 states. [2018-12-03 04:03:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61563 states to 61563 states and 248434 transitions. [2018-12-03 04:03:45,166 INFO L78 Accepts]: Start accepts. Automaton has 61563 states and 248434 transitions. Word has length 67 [2018-12-03 04:03:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:45,167 INFO L480 AbstractCegarLoop]: Abstraction has 61563 states and 248434 transitions. [2018-12-03 04:03:45,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:03:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61563 states and 248434 transitions. [2018-12-03 04:03:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 04:03:45,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:45,178 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] [2018-12-03 04:03:45,179 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:45,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2018-12-03 04:03:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:45,224 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-03 04:03:45,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:45,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:45,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:45,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:45,225 INFO L87 Difference]: Start difference. First operand 61563 states and 248434 transitions. Second operand 6 states. [2018-12-03 04:03:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:45,279 INFO L93 Difference]: Finished difference Result 12219 states and 41890 transitions. [2018-12-03 04:03:45,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:03:45,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 04:03:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:45,292 INFO L225 Difference]: With dead ends: 12219 [2018-12-03 04:03:45,292 INFO L226 Difference]: Without dead ends: 10507 [2018-12-03 04:03:45,292 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-03 04:03:45,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-12-03 04:03:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 9992. [2018-12-03 04:03:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9992 states. [2018-12-03 04:03:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9992 states to 9992 states and 34194 transitions. [2018-12-03 04:03:45,401 INFO L78 Accepts]: Start accepts. Automaton has 9992 states and 34194 transitions. Word has length 67 [2018-12-03 04:03:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:45,401 INFO L480 AbstractCegarLoop]: Abstraction has 9992 states and 34194 transitions. [2018-12-03 04:03:45,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9992 states and 34194 transitions. [2018-12-03 04:03:45,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 04:03:45,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:45,413 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] [2018-12-03 04:03:45,413 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:45,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2144628424, now seen corresponding path program 1 times [2018-12-03 04:03:45,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:45,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:45,462 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-03 04:03:45,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:45,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:45,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:45,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:45,463 INFO L87 Difference]: Start difference. First operand 9992 states and 34194 transitions. Second operand 5 states. [2018-12-03 04:03:45,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:45,627 INFO L93 Difference]: Finished difference Result 11722 states and 39578 transitions. [2018-12-03 04:03:45,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:03:45,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-03 04:03:45,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:45,640 INFO L225 Difference]: With dead ends: 11722 [2018-12-03 04:03:45,640 INFO L226 Difference]: Without dead ends: 11722 [2018-12-03 04:03:45,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11722 states. [2018-12-03 04:03:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11722 to 10677. [2018-12-03 04:03:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10677 states. [2018-12-03 04:03:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10677 states to 10677 states and 36362 transitions. [2018-12-03 04:03:45,755 INFO L78 Accepts]: Start accepts. Automaton has 10677 states and 36362 transitions. Word has length 100 [2018-12-03 04:03:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:45,755 INFO L480 AbstractCegarLoop]: Abstraction has 10677 states and 36362 transitions. [2018-12-03 04:03:45,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10677 states and 36362 transitions. [2018-12-03 04:03:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 04:03:45,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:45,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:03:45,767 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:45,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1838316113, now seen corresponding path program 1 times [2018-12-03 04:03:45,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:45,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:45,817 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-03 04:03:45,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:45,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:03:45,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:45,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:03:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:03:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:03:45,818 INFO L87 Difference]: Start difference. First operand 10677 states and 36362 transitions. Second operand 4 states. [2018-12-03 04:03:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:45,933 INFO L93 Difference]: Finished difference Result 12847 states and 43198 transitions. [2018-12-03 04:03:45,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:03:45,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 04:03:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:45,948 INFO L225 Difference]: With dead ends: 12847 [2018-12-03 04:03:45,949 INFO L226 Difference]: Without dead ends: 12847 [2018-12-03 04:03:45,949 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-03 04:03:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12847 states. [2018-12-03 04:03:46,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12847 to 11177. [2018-12-03 04:03:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11177 states. [2018-12-03 04:03:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11177 states to 11177 states and 37897 transitions. [2018-12-03 04:03:46,073 INFO L78 Accepts]: Start accepts. Automaton has 11177 states and 37897 transitions. Word has length 100 [2018-12-03 04:03:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:46,073 INFO L480 AbstractCegarLoop]: Abstraction has 11177 states and 37897 transitions. [2018-12-03 04:03:46,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:03:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 11177 states and 37897 transitions. [2018-12-03 04:03:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 04:03:46,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:46,086 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] [2018-12-03 04:03:46,086 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:46,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1487070160, now seen corresponding path program 1 times [2018-12-03 04:03:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:46,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:46,121 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-03 04:03:46,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:46,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:03:46,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:46,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:03:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:03:46,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:03:46,122 INFO L87 Difference]: Start difference. First operand 11177 states and 37897 transitions. Second operand 4 states. [2018-12-03 04:03:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:46,282 INFO L93 Difference]: Finished difference Result 15057 states and 51129 transitions. [2018-12-03 04:03:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:03:46,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 04:03:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:46,300 INFO L225 Difference]: With dead ends: 15057 [2018-12-03 04:03:46,300 INFO L226 Difference]: Without dead ends: 15057 [2018-12-03 04:03:46,300 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-03 04:03:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2018-12-03 04:03:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 10812. [2018-12-03 04:03:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10812 states. [2018-12-03 04:03:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 36420 transitions. [2018-12-03 04:03:46,434 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 36420 transitions. Word has length 100 [2018-12-03 04:03:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:46,435 INFO L480 AbstractCegarLoop]: Abstraction has 10812 states and 36420 transitions. [2018-12-03 04:03:46,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:03:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 36420 transitions. [2018-12-03 04:03:46,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 04:03:46,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:46,447 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] [2018-12-03 04:03:46,447 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:46,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:46,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2072054210, now seen corresponding path program 2 times [2018-12-03 04:03:46,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:46,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:46,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:46,503 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-03 04:03:46,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:46,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:46,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:46,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:46,504 INFO L87 Difference]: Start difference. First operand 10812 states and 36420 transitions. Second operand 5 states. [2018-12-03 04:03:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:46,652 INFO L93 Difference]: Finished difference Result 12267 states and 41039 transitions. [2018-12-03 04:03:46,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:46,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-03 04:03:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:46,666 INFO L225 Difference]: With dead ends: 12267 [2018-12-03 04:03:46,666 INFO L226 Difference]: Without dead ends: 12267 [2018-12-03 04:03:46,666 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-03 04:03:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2018-12-03 04:03:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 10302. [2018-12-03 04:03:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2018-12-03 04:03:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 34832 transitions. [2018-12-03 04:03:46,778 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 34832 transitions. Word has length 100 [2018-12-03 04:03:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:46,778 INFO L480 AbstractCegarLoop]: Abstraction has 10302 states and 34832 transitions. [2018-12-03 04:03:46,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 34832 transitions. [2018-12-03 04:03:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:03:46,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:46,789 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] [2018-12-03 04:03:46,789 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1807291188, now seen corresponding path program 1 times [2018-12-03 04:03:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:03:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:46,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:46,836 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-03 04:03:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:46,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:46,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:46,836 INFO L87 Difference]: Start difference. First operand 10302 states and 34832 transitions. Second operand 6 states. [2018-12-03 04:03:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:47,057 INFO L93 Difference]: Finished difference Result 11702 states and 38802 transitions. [2018-12-03 04:03:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:03:47,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 04:03:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:47,069 INFO L225 Difference]: With dead ends: 11702 [2018-12-03 04:03:47,069 INFO L226 Difference]: Without dead ends: 11352 [2018-12-03 04:03:47,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 04:03:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11352 states. [2018-12-03 04:03:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11352 to 11027. [2018-12-03 04:03:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11027 states. [2018-12-03 04:03:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 36927 transitions. [2018-12-03 04:03:47,183 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 36927 transitions. Word has length 102 [2018-12-03 04:03:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:47,183 INFO L480 AbstractCegarLoop]: Abstraction has 11027 states and 36927 transitions. [2018-12-03 04:03:47,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 36927 transitions. [2018-12-03 04:03:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:03:47,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:47,194 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] [2018-12-03 04:03:47,194 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:47,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash -786935629, now seen corresponding path program 1 times [2018-12-03 04:03:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:47,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:47,252 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-03 04:03:47,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:47,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:03:47,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:47,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:03:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:03:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:03:47,254 INFO L87 Difference]: Start difference. First operand 11027 states and 36927 transitions. Second operand 7 states. [2018-12-03 04:03:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:47,538 INFO L93 Difference]: Finished difference Result 12230 states and 40760 transitions. [2018-12-03 04:03:47,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:03:47,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 04:03:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:47,550 INFO L225 Difference]: With dead ends: 12230 [2018-12-03 04:03:47,550 INFO L226 Difference]: Without dead ends: 12230 [2018-12-03 04:03:47,551 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-03 04:03:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12230 states. [2018-12-03 04:03:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12230 to 11002. [2018-12-03 04:03:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11002 states. [2018-12-03 04:03:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 36867 transitions. [2018-12-03 04:03:47,659 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 36867 transitions. Word has length 102 [2018-12-03 04:03:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:47,659 INFO L480 AbstractCegarLoop]: Abstraction has 11002 states and 36867 transitions. [2018-12-03 04:03:47,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:03:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 36867 transitions. [2018-12-03 04:03:47,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:03:47,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:47,670 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] [2018-12-03 04:03:47,670 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:47,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash 623943891, now seen corresponding path program 1 times [2018-12-03 04:03:47,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:47,735 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-03 04:03:47,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:47,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:47,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:47,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:47,736 INFO L87 Difference]: Start difference. First operand 11002 states and 36867 transitions. Second operand 5 states. [2018-12-03 04:03:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:47,842 INFO L93 Difference]: Finished difference Result 9795 states and 32513 transitions. [2018-12-03 04:03:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:03:47,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 04:03:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:47,857 INFO L225 Difference]: With dead ends: 9795 [2018-12-03 04:03:47,857 INFO L226 Difference]: Without dead ends: 9795 [2018-12-03 04:03:47,857 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-03 04:03:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2018-12-03 04:03:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9760. [2018-12-03 04:03:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2018-12-03 04:03:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 32415 transitions. [2018-12-03 04:03:47,961 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 32415 transitions. Word has length 102 [2018-12-03 04:03:47,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:47,961 INFO L480 AbstractCegarLoop]: Abstraction has 9760 states and 32415 transitions. [2018-12-03 04:03:47,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 32415 transitions. [2018-12-03 04:03:47,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 04:03:47,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:47,972 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] [2018-12-03 04:03:47,972 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:47,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:47,972 INFO L82 PathProgramCache]: Analyzing trace with hash 175247252, now seen corresponding path program 1 times [2018-12-03 04:03:47,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:47,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:47,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:48,055 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-03 04:03:48,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:48,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:48,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:48,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:48,057 INFO L87 Difference]: Start difference. First operand 9760 states and 32415 transitions. Second operand 6 states. [2018-12-03 04:03:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:48,149 INFO L93 Difference]: Finished difference Result 8608 states and 27967 transitions. [2018-12-03 04:03:48,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:03:48,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 04:03:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:48,162 INFO L225 Difference]: With dead ends: 8608 [2018-12-03 04:03:48,162 INFO L226 Difference]: Without dead ends: 8608 [2018-12-03 04:03:48,163 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-03 04:03:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2018-12-03 04:03:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 7183. [2018-12-03 04:03:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-12-03 04:03:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 23561 transitions. [2018-12-03 04:03:48,243 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 23561 transitions. Word has length 102 [2018-12-03 04:03:48,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:48,244 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 23561 transitions. [2018-12-03 04:03:48,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 23561 transitions. [2018-12-03 04:03:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:48,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:48,250 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] [2018-12-03 04:03:48,250 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:48,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:48,250 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2018-12-03 04:03:48,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:48,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:48,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:03:48,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:48,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:03:48,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:48,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:03:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:03:48,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:03:48,311 INFO L87 Difference]: Start difference. First operand 7183 states and 23561 transitions. Second operand 7 states. [2018-12-03 04:03:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:48,652 INFO L93 Difference]: Finished difference Result 13310 states and 43019 transitions. [2018-12-03 04:03:48,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 04:03:48,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-03 04:03:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:48,666 INFO L225 Difference]: With dead ends: 13310 [2018-12-03 04:03:48,666 INFO L226 Difference]: Without dead ends: 13310 [2018-12-03 04:03:48,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-03 04:03:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2018-12-03 04:03:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10245. [2018-12-03 04:03:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2018-12-03 04:03:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 33633 transitions. [2018-12-03 04:03:48,779 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 33633 transitions. Word has length 104 [2018-12-03 04:03:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:48,779 INFO L480 AbstractCegarLoop]: Abstraction has 10245 states and 33633 transitions. [2018-12-03 04:03:48,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:03:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 33633 transitions. [2018-12-03 04:03:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:48,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:48,788 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] [2018-12-03 04:03:48,788 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:48,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2018-12-03 04:03:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:48,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:48,850 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-03 04:03:48,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:48,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:48,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:48,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:48,851 INFO L87 Difference]: Start difference. First operand 10245 states and 33633 transitions. Second operand 6 states. [2018-12-03 04:03:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:48,942 INFO L93 Difference]: Finished difference Result 10435 states and 33930 transitions. [2018-12-03 04:03:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:03:48,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 04:03:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:48,953 INFO L225 Difference]: With dead ends: 10435 [2018-12-03 04:03:48,954 INFO L226 Difference]: Without dead ends: 10435 [2018-12-03 04:03:48,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 04:03:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2018-12-03 04:03:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 10170. [2018-12-03 04:03:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2018-12-03 04:03:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 33203 transitions. [2018-12-03 04:03:49,060 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 33203 transitions. Word has length 104 [2018-12-03 04:03:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:49,060 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 33203 transitions. [2018-12-03 04:03:49,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 33203 transitions. [2018-12-03 04:03:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:49,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:49,070 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] [2018-12-03 04:03:49,071 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:49,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2018-12-03 04:03:49,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:49,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:03:49,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:49,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:49,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:49,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:49,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:49,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:49,138 INFO L87 Difference]: Start difference. First operand 10170 states and 33203 transitions. Second operand 5 states. [2018-12-03 04:03:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:49,264 INFO L93 Difference]: Finished difference Result 11450 states and 37363 transitions. [2018-12-03 04:03:49,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:03:49,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 04:03:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:49,276 INFO L225 Difference]: With dead ends: 11450 [2018-12-03 04:03:49,276 INFO L226 Difference]: Without dead ends: 11450 [2018-12-03 04:03:49,277 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-03 04:03:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2018-12-03 04:03:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 9027. [2018-12-03 04:03:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9027 states. [2018-12-03 04:03:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 29584 transitions. [2018-12-03 04:03:49,379 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 29584 transitions. Word has length 104 [2018-12-03 04:03:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 9027 states and 29584 transitions. [2018-12-03 04:03:49,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 29584 transitions. [2018-12-03 04:03:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:49,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:49,388 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] [2018-12-03 04:03:49,388 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:49,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1146708689, now seen corresponding path program 1 times [2018-12-03 04:03:49,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:49,457 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-03 04:03:49,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:49,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:03:49,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:49,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:03:49,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:03:49,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:03:49,459 INFO L87 Difference]: Start difference. First operand 9027 states and 29584 transitions. Second operand 5 states. [2018-12-03 04:03:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:49,507 INFO L93 Difference]: Finished difference Result 9027 states and 29549 transitions. [2018-12-03 04:03:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:03:49,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-03 04:03:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:49,517 INFO L225 Difference]: With dead ends: 9027 [2018-12-03 04:03:49,517 INFO L226 Difference]: Without dead ends: 9027 [2018-12-03 04:03:49,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9027 states. [2018-12-03 04:03:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9027 to 9027. [2018-12-03 04:03:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9027 states. [2018-12-03 04:03:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 29549 transitions. [2018-12-03 04:03:49,598 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 29549 transitions. Word has length 104 [2018-12-03 04:03:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:49,598 INFO L480 AbstractCegarLoop]: Abstraction has 9027 states and 29549 transitions. [2018-12-03 04:03:49,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:03:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 29549 transitions. [2018-12-03 04:03:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:49,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:49,606 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] [2018-12-03 04:03:49,606 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:49,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-03 04:03:49,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:49,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:49,731 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-03 04:03:49,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:49,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 04:03:49,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:49,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 04:03:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 04:03:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 04:03:49,732 INFO L87 Difference]: Start difference. First operand 9027 states and 29549 transitions. Second operand 10 states. [2018-12-03 04:03:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:50,058 INFO L93 Difference]: Finished difference Result 16915 states and 55801 transitions. [2018-12-03 04:03:50,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:03:50,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-03 04:03:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:50,067 INFO L225 Difference]: With dead ends: 16915 [2018-12-03 04:03:50,067 INFO L226 Difference]: Without dead ends: 8303 [2018-12-03 04:03:50,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 04:03:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2018-12-03 04:03:50,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 8303. [2018-12-03 04:03:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8303 states. [2018-12-03 04:03:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8303 states to 8303 states and 27421 transitions. [2018-12-03 04:03:50,142 INFO L78 Accepts]: Start accepts. Automaton has 8303 states and 27421 transitions. Word has length 104 [2018-12-03 04:03:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:50,142 INFO L480 AbstractCegarLoop]: Abstraction has 8303 states and 27421 transitions. [2018-12-03 04:03:50,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 04:03:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 8303 states and 27421 transitions. [2018-12-03 04:03:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:50,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:50,149 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] [2018-12-03 04:03:50,149 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:50,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-03 04:03:50,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:50,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:50,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:50,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:50,330 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-03 04:03:50,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:50,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:03:50,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:50,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:03:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:03:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:03:50,331 INFO L87 Difference]: Start difference. First operand 8303 states and 27421 transitions. Second operand 7 states. [2018-12-03 04:03:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:50,590 INFO L93 Difference]: Finished difference Result 15253 states and 51102 transitions. [2018-12-03 04:03:50,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:50,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-03 04:03:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:50,599 INFO L225 Difference]: With dead ends: 15253 [2018-12-03 04:03:50,599 INFO L226 Difference]: Without dead ends: 7183 [2018-12-03 04:03:50,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:03:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2018-12-03 04:03:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7183. [2018-12-03 04:03:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-12-03 04:03:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 24291 transitions. [2018-12-03 04:03:50,669 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 24291 transitions. Word has length 104 [2018-12-03 04:03:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:50,669 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 24291 transitions. [2018-12-03 04:03:50,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:03:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 24291 transitions. [2018-12-03 04:03:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:50,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:50,676 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] [2018-12-03 04:03:50,676 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:50,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:50,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-03 04:03:50,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:50,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:03:50,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:50,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:03:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:50,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:50,737 INFO L87 Difference]: Start difference. First operand 7183 states and 24291 transitions. Second operand 6 states. [2018-12-03 04:03:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:50,928 INFO L93 Difference]: Finished difference Result 8103 states and 26833 transitions. [2018-12-03 04:03:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:50,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 04:03:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:50,937 INFO L225 Difference]: With dead ends: 8103 [2018-12-03 04:03:50,937 INFO L226 Difference]: Without dead ends: 8103 [2018-12-03 04:03:50,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:03:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2018-12-03 04:03:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 7363. [2018-12-03 04:03:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7363 states. [2018-12-03 04:03:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 24774 transitions. [2018-12-03 04:03:51,009 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 24774 transitions. Word has length 104 [2018-12-03 04:03:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:51,009 INFO L480 AbstractCegarLoop]: Abstraction has 7363 states and 24774 transitions. [2018-12-03 04:03:51,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:51,009 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 24774 transitions. [2018-12-03 04:03:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:51,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:51,015 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] [2018-12-03 04:03:51,015 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:51,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:51,015 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-03 04:03:51,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:51,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:51,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:51,104 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-03 04:03:51,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:51,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:51,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:51,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:51,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:51,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:51,105 INFO L87 Difference]: Start difference. First operand 7363 states and 24774 transitions. Second operand 6 states. [2018-12-03 04:03:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:51,221 INFO L93 Difference]: Finished difference Result 7423 states and 24911 transitions. [2018-12-03 04:03:51,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 04:03:51,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 04:03:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:51,229 INFO L225 Difference]: With dead ends: 7423 [2018-12-03 04:03:51,230 INFO L226 Difference]: Without dead ends: 7343 [2018-12-03 04:03:51,230 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-03 04:03:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-12-03 04:03:51,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7151. [2018-12-03 04:03:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2018-12-03 04:03:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 24187 transitions. [2018-12-03 04:03:51,297 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 24187 transitions. Word has length 104 [2018-12-03 04:03:51,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:51,297 INFO L480 AbstractCegarLoop]: Abstraction has 7151 states and 24187 transitions. [2018-12-03 04:03:51,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 24187 transitions. [2018-12-03 04:03:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:51,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:51,303 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] [2018-12-03 04:03:51,303 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:51,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 2 times [2018-12-03 04:03:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:51,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:03:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:03:51,380 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-03 04:03:51,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:03:51,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:03:51,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:03:51,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:03:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:03:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:03:51,381 INFO L87 Difference]: Start difference. First operand 7151 states and 24187 transitions. Second operand 6 states. [2018-12-03 04:03:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:03:51,535 INFO L93 Difference]: Finished difference Result 7319 states and 24597 transitions. [2018-12-03 04:03:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 04:03:51,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-03 04:03:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:03:51,543 INFO L225 Difference]: With dead ends: 7319 [2018-12-03 04:03:51,543 INFO L226 Difference]: Without dead ends: 7319 [2018-12-03 04:03:51,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:03:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-12-03 04:03:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 7291. [2018-12-03 04:03:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2018-12-03 04:03:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 24524 transitions. [2018-12-03 04:03:51,619 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 24524 transitions. Word has length 104 [2018-12-03 04:03:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:03:51,620 INFO L480 AbstractCegarLoop]: Abstraction has 7291 states and 24524 transitions. [2018-12-03 04:03:51,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:03:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 24524 transitions. [2018-12-03 04:03:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:03:51,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:03:51,627 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] [2018-12-03 04:03:51,627 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:03:51,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:03:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-03 04:03:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:03:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 04:03:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:03:51,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:03:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:03:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:03:51,680 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 04:03:51,779 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 04:03:51,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:03:51 BasicIcfg [2018-12-03 04:03:51,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:03:51,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:03:51,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:03:51,781 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:03:51,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:02:44" (3/4) ... [2018-12-03 04:03:51,783 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 04:03:51,875 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae342c0c-7923-4551-82b8-b806e67c51d6/bin-2019/utaipan/witness.graphml [2018-12-03 04:03:51,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:03:51,876 INFO L168 Benchmark]: Toolchain (without parser) took 68414.02 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 947.0 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,877 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:03:51,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.66 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,878 INFO L168 Benchmark]: Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:03:51,878 INFO L168 Benchmark]: RCFGBuilder took 365.51 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,878 INFO L168 Benchmark]: TraceAbstraction took 67564.45 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,878 INFO L168 Benchmark]: Witness Printer took 94.50 ms. Allocated memory is still 7.2 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:03:51,880 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.66 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 365.51 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: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 67564.45 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 94.50 ms. Allocated memory is still 7.2 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=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] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=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] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=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] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=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] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=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] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=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] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=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}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=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] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=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] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=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] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=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] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L786] -1 pthread_t t1216; VAL [__unbuffered_cnt=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] [L787] FCALL, FORK -1 pthread_create(&t1216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L788] -1 pthread_t t1217; VAL [__unbuffered_cnt=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] [L789] FCALL, FORK -1 pthread_create(&t1217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L790] -1 pthread_t t1218; VAL [__unbuffered_cnt=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] [L791] FCALL, FORK -1 pthread_create(&t1218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=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] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=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] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=1, 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] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __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=2, 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] [L729] 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_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=2, 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] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __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=2, 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, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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_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=2, 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_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 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) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __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=2, 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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] 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=1, __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=2, 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_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] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_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=2, 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_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] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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_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] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L766] 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L731] 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] 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=1, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L733] 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L797] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L797] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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$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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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$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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L808] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L808] -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) [L809] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] [L809] -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)) [L810] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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$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)) [L811] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_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)) [L812] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_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)) [L813] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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$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)) [L814] 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_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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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$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)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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 = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_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=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, 200 locations, 3 error locations. UNSAFE Result, 67.5s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 17.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5737 SDtfs, 5610 SDslu, 11109 SDs, 0 SdLazy, 3788 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 70 SyntacticMatches, 15 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 34.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 378650 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2353 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 501126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...