./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_power.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_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/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 38746a35588728e2d7ff474f85640a9981680619 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 10:18:39,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:18:39,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:18:39,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:18:39,997 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:18:39,998 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:18:39,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:18:40,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:18:40,001 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:18:40,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:18:40,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:18:40,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:18:40,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:18:40,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:18:40,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:18:40,005 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:18:40,006 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:18:40,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:18:40,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:18:40,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:18:40,010 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:18:40,011 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:18:40,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:18:40,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:18:40,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:18:40,014 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:18:40,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:18:40,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:18:40,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:18:40,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:18:40,016 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:18:40,017 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:18:40,017 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:18:40,017 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:18:40,018 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:18:40,018 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:18:40,018 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 10:18:40,028 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:18:40,028 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:18:40,029 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:18:40,029 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:18:40,029 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 10:18:40,029 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 10:18:40,029 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 10:18:40,030 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 10:18:40,031 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:18:40,031 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:18:40,031 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:18:40,031 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:18:40,031 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:18:40,032 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:18:40,032 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:18:40,033 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:18:40,033 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:18:40,034 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 10:18:40,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:18:40,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 10:18:40,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 10:18:40,034 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_f925364b-5651-4a74-a477-7ef0ebd4b5b8/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 -> 38746a35588728e2d7ff474f85640a9981680619 [2018-12-02 10:18:40,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:18:40,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:18:40,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:18:40,068 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:18:40,068 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:18:40,069 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i [2018-12-02 10:18:40,106 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/data/207fd83de/8017a07878004e8ab17996cd01204f6a/FLAG640514b0b [2018-12-02 10:18:40,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:18:40,533 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/sv-benchmarks/c/pthread-wmm/mix042_power.opt_false-unreach-call.i [2018-12-02 10:18:40,540 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/data/207fd83de/8017a07878004e8ab17996cd01204f6a/FLAG640514b0b [2018-12-02 10:18:40,548 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/data/207fd83de/8017a07878004e8ab17996cd01204f6a [2018-12-02 10:18:40,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:18:40,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:18:40,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:18:40,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:18:40,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:18:40,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40, skipping insertion in model container [2018-12-02 10:18:40,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:18:40,585 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:18:40,777 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:18:40,819 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:18:40,866 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:18:40,913 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:18:40,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40 WrapperNode [2018-12-02 10:18:40,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:18:40,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:18:40,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:18:40,914 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:18:40,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:18:40,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:18:40,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:18:40,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:18:40,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... [2018-12-02 10:18:40,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:18:40,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:18:40,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:18:40,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:18:40,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:18:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 10:18:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 10:18:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 10:18:41,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 10:18:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 10:18:41,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 10:18:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 10:18:41,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 10:18:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 10:18:41,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 10:18:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 10:18:41,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:18:41,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:18:41,025 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 10:18:41,345 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:18:41,345 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 10:18:41,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:18:41 BoogieIcfgContainer [2018-12-02 10:18:41,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:18:41,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:18:41,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:18:41,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:18:41,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:18:40" (1/3) ... [2018-12-02 10:18:41,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4771a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:18:41, skipping insertion in model container [2018-12-02 10:18:41,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:18:40" (2/3) ... [2018-12-02 10:18:41,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c4771a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:18:41, skipping insertion in model container [2018-12-02 10:18:41,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:18:41" (3/3) ... [2018-12-02 10:18:41,352 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_power.opt_false-unreach-call.i [2018-12-02 10:18:41,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,381 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,381 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,381 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,382 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,383 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,384 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,385 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,386 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,387 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,388 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,388 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,388 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,388 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,389 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,389 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,390 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,391 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,392 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,393 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,394 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 10:18:41,399 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 10:18:41,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:18:41,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 10:18:41,421 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 10:18:41,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:18:41,442 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:18:41,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:18:41,442 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:18:41,442 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:18:41,442 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:18:41,442 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:18:41,442 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:18:41,451 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-02 10:18:54,660 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-02 10:18:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-02 10:18:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 10:18:54,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:18:54,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:18:54,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:18:54,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:18:54,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-02 10:18:54,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:18:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:18:54,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:18:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:18:54,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:18:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:18:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:18:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:18:54,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:18:54,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:18:54,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:18:54,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:18:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:18:54,846 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-02 10:18:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:18:56,068 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-02 10:18:56,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:18:56,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 10:18:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:18:58,509 INFO L225 Difference]: With dead ends: 233475 [2018-12-02 10:18:58,509 INFO L226 Difference]: Without dead ends: 203725 [2018-12-02 10:18:58,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:18:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-02 10:19:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-02 10:19:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 10:19:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-02 10:19:01,879 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-02 10:19:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:01,880 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-02 10:19:01,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:19:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-02 10:19:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 10:19:01,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:01,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:01,887 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:01,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:01,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-02 10:19:01,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:01,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:01,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:01,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:01,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:01,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:19:01,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:01,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:19:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:19:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:19:01,932 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 3 states. [2018-12-02 10:19:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:02,465 INFO L93 Difference]: Finished difference Result 118895 states and 557818 transitions. [2018-12-02 10:19:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:19:02,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-02 10:19:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:03,244 INFO L225 Difference]: With dead ends: 118895 [2018-12-02 10:19:03,244 INFO L226 Difference]: Without dead ends: 118895 [2018-12-02 10:19:03,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:19:04,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118895 states. [2018-12-02 10:19:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118895 to 118895. [2018-12-02 10:19:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-02 10:19:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 557818 transitions. [2018-12-02 10:19:07,838 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 557818 transitions. Word has length 53 [2018-12-02 10:19:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:07,838 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 557818 transitions. [2018-12-02 10:19:07,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:19:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 557818 transitions. [2018-12-02 10:19:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 10:19:07,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:07,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:07,842 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:07,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1856976386, now seen corresponding path program 1 times [2018-12-02 10:19:07,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:07,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:07,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:07,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:07,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:07,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:19:07,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:07,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:19:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:19:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:19:07,899 INFO L87 Difference]: Start difference. First operand 118895 states and 557818 transitions. Second operand 5 states. [2018-12-02 10:19:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:09,542 INFO L93 Difference]: Finished difference Result 325275 states and 1468252 transitions. [2018-12-02 10:19:09,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:19:09,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-02 10:19:09,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:10,446 INFO L225 Difference]: With dead ends: 325275 [2018-12-02 10:19:10,446 INFO L226 Difference]: Without dead ends: 324275 [2018-12-02 10:19:10,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:19:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-02 10:19:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-02 10:19:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-02 10:19:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 840917 transitions. [2018-12-02 10:19:15,854 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 840917 transitions. Word has length 53 [2018-12-02 10:19:15,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:15,855 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 840917 transitions. [2018-12-02 10:19:15,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:19:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 840917 transitions. [2018-12-02 10:19:15,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 10:19:15,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:15,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:15,863 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:15,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:15,863 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-02 10:19:15,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:15,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:15,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:15,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:15,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:15,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:15,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:19:15,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:15,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:19:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:19:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:19:15,914 INFO L87 Difference]: Start difference. First operand 186425 states and 840917 transitions. Second operand 5 states. [2018-12-02 10:19:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:17,586 INFO L93 Difference]: Finished difference Result 334055 states and 1500996 transitions. [2018-12-02 10:19:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:19:17,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 10:19:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:21,656 INFO L225 Difference]: With dead ends: 334055 [2018-12-02 10:19:21,656 INFO L226 Difference]: Without dead ends: 333005 [2018-12-02 10:19:21,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:19:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333005 states. [2018-12-02 10:19:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333005 to 194885. [2018-12-02 10:19:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 10:19:26,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876475 transitions. [2018-12-02 10:19:26,813 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876475 transitions. Word has length 54 [2018-12-02 10:19:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:26,813 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876475 transitions. [2018-12-02 10:19:26,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:19:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876475 transitions. [2018-12-02 10:19:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 10:19:26,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:26,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:26,836 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:26,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1926060511, now seen corresponding path program 1 times [2018-12-02 10:19:26,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:26,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:26,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:26,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:26,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:19:26,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:19:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:19:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:19:26,889 INFO L87 Difference]: Start difference. First operand 194885 states and 876475 transitions. Second operand 3 states. [2018-12-02 10:19:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:27,752 INFO L93 Difference]: Finished difference Result 194885 states and 876430 transitions. [2018-12-02 10:19:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:19:27,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2018-12-02 10:19:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:28,250 INFO L225 Difference]: With dead ends: 194885 [2018-12-02 10:19:28,250 INFO L226 Difference]: Without dead ends: 194885 [2018-12-02 10:19:28,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:19:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194885 states. [2018-12-02 10:19:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194885 to 194885. [2018-12-02 10:19:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194885 states. [2018-12-02 10:19:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194885 states to 194885 states and 876430 transitions. [2018-12-02 10:19:34,464 INFO L78 Accepts]: Start accepts. Automaton has 194885 states and 876430 transitions. Word has length 61 [2018-12-02 10:19:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:34,465 INFO L480 AbstractCegarLoop]: Abstraction has 194885 states and 876430 transitions. [2018-12-02 10:19:34,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:19:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 194885 states and 876430 transitions. [2018-12-02 10:19:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 10:19:34,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:34,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:34,488 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:34,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash -183250176, now seen corresponding path program 1 times [2018-12-02 10:19:34,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:34,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:34,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:34,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:19:34,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:34,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:19:34,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:19:34,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:19:34,537 INFO L87 Difference]: Start difference. First operand 194885 states and 876430 transitions. Second operand 4 states. [2018-12-02 10:19:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:35,554 INFO L93 Difference]: Finished difference Result 172221 states and 761292 transitions. [2018-12-02 10:19:35,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:19:35,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 10:19:35,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:35,977 INFO L225 Difference]: With dead ends: 172221 [2018-12-02 10:19:35,977 INFO L226 Difference]: Without dead ends: 169616 [2018-12-02 10:19:35,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:19:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169616 states. [2018-12-02 10:19:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169616 to 169616. [2018-12-02 10:19:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-12-02 10:19:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 752620 transitions. [2018-12-02 10:19:39,742 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 752620 transitions. Word has length 61 [2018-12-02 10:19:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:39,742 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 752620 transitions. [2018-12-02 10:19:39,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:19:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 752620 transitions. [2018-12-02 10:19:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 10:19:39,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:39,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:19:39,763 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:39,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 771366836, now seen corresponding path program 1 times [2018-12-02 10:19:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:39,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:39,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:39,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:19:39,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:39,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:19:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:19:39,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:19:39,812 INFO L87 Difference]: Start difference. First operand 169616 states and 752620 transitions. Second operand 6 states. [2018-12-02 10:19:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:43,563 INFO L93 Difference]: Finished difference Result 292572 states and 1274469 transitions. [2018-12-02 10:19:43,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 10:19:43,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 10:19:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:44,316 INFO L225 Difference]: With dead ends: 292572 [2018-12-02 10:19:44,316 INFO L226 Difference]: Without dead ends: 291732 [2018-12-02 10:19:44,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-02 10:19:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291732 states. [2018-12-02 10:19:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291732 to 164648. [2018-12-02 10:19:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164648 states. [2018-12-02 10:19:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164648 states to 164648 states and 730626 transitions. [2018-12-02 10:19:48,827 INFO L78 Accepts]: Start accepts. Automaton has 164648 states and 730626 transitions. Word has length 62 [2018-12-02 10:19:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:48,827 INFO L480 AbstractCegarLoop]: Abstraction has 164648 states and 730626 transitions. [2018-12-02 10:19:48,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:19:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 164648 states and 730626 transitions. [2018-12-02 10:19:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 10:19:48,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:48,882 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] [2018-12-02 10:19:48,882 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:48,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1183833779, now seen corresponding path program 1 times [2018-12-02 10:19:48,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:48,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:48,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:48,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:48,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:19:48,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:48,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:19:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:19:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:19:48,982 INFO L87 Difference]: Start difference. First operand 164648 states and 730626 transitions. Second operand 6 states. [2018-12-02 10:19:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:19:51,070 INFO L93 Difference]: Finished difference Result 300884 states and 1315139 transitions. [2018-12-02 10:19:51,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:19:51,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 10:19:51,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:19:51,844 INFO L225 Difference]: With dead ends: 300884 [2018-12-02 10:19:51,844 INFO L226 Difference]: Without dead ends: 297668 [2018-12-02 10:19:51,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:19:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297668 states. [2018-12-02 10:19:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297668 to 251560. [2018-12-02 10:19:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251560 states. [2018-12-02 10:19:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251560 states to 251560 states and 1109866 transitions. [2018-12-02 10:19:57,916 INFO L78 Accepts]: Start accepts. Automaton has 251560 states and 1109866 transitions. Word has length 69 [2018-12-02 10:19:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:19:57,916 INFO L480 AbstractCegarLoop]: Abstraction has 251560 states and 1109866 transitions. [2018-12-02 10:19:57,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:19:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 251560 states and 1109866 transitions. [2018-12-02 10:19:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 10:19:58,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:19:58,029 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] [2018-12-02 10:19:58,029 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:19:58,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:19:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2051226827, now seen corresponding path program 1 times [2018-12-02 10:19:58,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:19:58,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:58,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:19:58,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:19:58,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:19:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:19:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:19:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:19:58,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:19:58,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:19:58,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:19:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:19:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:19:58,081 INFO L87 Difference]: Start difference. First operand 251560 states and 1109866 transitions. Second operand 6 states. [2018-12-02 10:20:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:03,372 INFO L93 Difference]: Finished difference Result 494808 states and 2157825 transitions. [2018-12-02 10:20:03,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 10:20:03,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 10:20:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:05,051 INFO L225 Difference]: With dead ends: 494808 [2018-12-02 10:20:05,051 INFO L226 Difference]: Without dead ends: 493528 [2018-12-02 10:20:05,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 10:20:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493528 states. [2018-12-02 10:20:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493528 to 289128. [2018-12-02 10:20:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289128 states. [2018-12-02 10:20:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289128 states to 289128 states and 1266394 transitions. [2018-12-02 10:20:12,614 INFO L78 Accepts]: Start accepts. Automaton has 289128 states and 1266394 transitions. Word has length 69 [2018-12-02 10:20:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 289128 states and 1266394 transitions. [2018-12-02 10:20:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:20:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 289128 states and 1266394 transitions. [2018-12-02 10:20:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 10:20:12,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:12,766 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] [2018-12-02 10:20:12,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:12,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1168168357, now seen corresponding path program 1 times [2018-12-02 10:20:12,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:12,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:12,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:12,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:12,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:12,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:20:12,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:12,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:20:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:20:12,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:20:12,793 INFO L87 Difference]: Start difference. First operand 289128 states and 1266394 transitions. Second operand 3 states. [2018-12-02 10:20:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:14,750 INFO L93 Difference]: Finished difference Result 345308 states and 1496961 transitions. [2018-12-02 10:20:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:20:14,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-02 10:20:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:19,371 INFO L225 Difference]: With dead ends: 345308 [2018-12-02 10:20:19,372 INFO L226 Difference]: Without dead ends: 345308 [2018-12-02 10:20:19,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:20:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345308 states. [2018-12-02 10:20:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345308 to 304840. [2018-12-02 10:20:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304840 states. [2018-12-02 10:20:25,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304840 states to 304840 states and 1331906 transitions. [2018-12-02 10:20:25,686 INFO L78 Accepts]: Start accepts. Automaton has 304840 states and 1331906 transitions. Word has length 71 [2018-12-02 10:20:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:25,686 INFO L480 AbstractCegarLoop]: Abstraction has 304840 states and 1331906 transitions. [2018-12-02 10:20:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:20:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 304840 states and 1331906 transitions. [2018-12-02 10:20:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 10:20:25,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:25,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:20:25,933 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:25,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1509216195, now seen corresponding path program 1 times [2018-12-02 10:20:25,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:25,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:25,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:26,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:26,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:20:26,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:26,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:20:26,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:20:26,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:20:26,003 INFO L87 Difference]: Start difference. First operand 304840 states and 1331906 transitions. Second operand 7 states. [2018-12-02 10:20:29,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:29,411 INFO L93 Difference]: Finished difference Result 534372 states and 2306534 transitions. [2018-12-02 10:20:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 10:20:29,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-02 10:20:29,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:31,440 INFO L225 Difference]: With dead ends: 534372 [2018-12-02 10:20:31,440 INFO L226 Difference]: Without dead ends: 533092 [2018-12-02 10:20:31,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-02 10:20:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533092 states. [2018-12-02 10:20:42,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533092 to 314072. [2018-12-02 10:20:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314072 states. [2018-12-02 10:20:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314072 states to 314072 states and 1369866 transitions. [2018-12-02 10:20:43,888 INFO L78 Accepts]: Start accepts. Automaton has 314072 states and 1369866 transitions. Word has length 75 [2018-12-02 10:20:43,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:43,888 INFO L480 AbstractCegarLoop]: Abstraction has 314072 states and 1369866 transitions. [2018-12-02 10:20:43,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:20:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 314072 states and 1369866 transitions. [2018-12-02 10:20:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 10:20:44,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:44,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] [2018-12-02 10:20:44,149 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:44,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1845742857, now seen corresponding path program 1 times [2018-12-02 10:20:44,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:44,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:44,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:44,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:44,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:44,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:20:44,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:44,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:20:44,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:20:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:20:44,189 INFO L87 Difference]: Start difference. First operand 314072 states and 1369866 transitions. Second operand 5 states. [2018-12-02 10:20:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:44,668 INFO L93 Difference]: Finished difference Result 115104 states and 456668 transitions. [2018-12-02 10:20:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 10:20:44,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-02 10:20:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:44,916 INFO L225 Difference]: With dead ends: 115104 [2018-12-02 10:20:44,916 INFO L226 Difference]: Without dead ends: 112792 [2018-12-02 10:20:44,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:20:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112792 states. [2018-12-02 10:20:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112792 to 112792. [2018-12-02 10:20:46,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112792 states. [2018-12-02 10:20:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112792 states to 112792 states and 448014 transitions. [2018-12-02 10:20:46,966 INFO L78 Accepts]: Start accepts. Automaton has 112792 states and 448014 transitions. Word has length 76 [2018-12-02 10:20:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:46,967 INFO L480 AbstractCegarLoop]: Abstraction has 112792 states and 448014 transitions. [2018-12-02 10:20:46,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:20:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 112792 states and 448014 transitions. [2018-12-02 10:20:47,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 10:20:47,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:47,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:20:47,044 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:47,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash -408653916, now seen corresponding path program 1 times [2018-12-02 10:20:47,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:47,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:47,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:47,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:20:47,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:47,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:20:47,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:20:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:20:47,083 INFO L87 Difference]: Start difference. First operand 112792 states and 448014 transitions. Second operand 4 states. [2018-12-02 10:20:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:48,266 INFO L93 Difference]: Finished difference Result 152977 states and 600861 transitions. [2018-12-02 10:20:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:20:48,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 10:20:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:48,595 INFO L225 Difference]: With dead ends: 152977 [2018-12-02 10:20:48,595 INFO L226 Difference]: Without dead ends: 152977 [2018-12-02 10:20:48,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:20:48,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152977 states. [2018-12-02 10:20:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152977 to 138716. [2018-12-02 10:20:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138716 states. [2018-12-02 10:20:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138716 states to 138716 states and 547833 transitions. [2018-12-02 10:20:50,970 INFO L78 Accepts]: Start accepts. Automaton has 138716 states and 547833 transitions. Word has length 82 [2018-12-02 10:20:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:50,970 INFO L480 AbstractCegarLoop]: Abstraction has 138716 states and 547833 transitions. [2018-12-02 10:20:50,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:20:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 138716 states and 547833 transitions. [2018-12-02 10:20:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 10:20:51,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:51,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:20:51,053 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:51,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:51,053 INFO L82 PathProgramCache]: Analyzing trace with hash -57853979, now seen corresponding path program 1 times [2018-12-02 10:20:51,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:51,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:51,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:51,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:51,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:20:51,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:51,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:20:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:20:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:20:51,141 INFO L87 Difference]: Start difference. First operand 138716 states and 547833 transitions. Second operand 6 states. [2018-12-02 10:20:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:51,929 INFO L93 Difference]: Finished difference Result 146264 states and 574325 transitions. [2018-12-02 10:20:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:20:51,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-02 10:20:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:52,545 INFO L225 Difference]: With dead ends: 146264 [2018-12-02 10:20:52,545 INFO L226 Difference]: Without dead ends: 146264 [2018-12-02 10:20:52,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:20:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146264 states. [2018-12-02 10:20:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146264 to 142096. [2018-12-02 10:20:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142096 states. [2018-12-02 10:20:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142096 states to 142096 states and 559493 transitions. [2018-12-02 10:20:54,965 INFO L78 Accepts]: Start accepts. Automaton has 142096 states and 559493 transitions. Word has length 82 [2018-12-02 10:20:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:20:54,965 INFO L480 AbstractCegarLoop]: Abstraction has 142096 states and 559493 transitions. [2018-12-02 10:20:54,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:20:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 142096 states and 559493 transitions. [2018-12-02 10:20:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 10:20:55,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:20:55,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:20:55,058 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:20:55,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:20:55,058 INFO L82 PathProgramCache]: Analyzing trace with hash 903760038, now seen corresponding path program 1 times [2018-12-02 10:20:55,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:20:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:55,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:20:55,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:20:55,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:20:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:20:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:20:55,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:20:55,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:20:55,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:20:55,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:20:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:20:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:20:55,112 INFO L87 Difference]: Start difference. First operand 142096 states and 559493 transitions. Second operand 7 states. [2018-12-02 10:20:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:20:56,174 INFO L93 Difference]: Finished difference Result 170048 states and 665197 transitions. [2018-12-02 10:20:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 10:20:56,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-02 10:20:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:20:56,557 INFO L225 Difference]: With dead ends: 170048 [2018-12-02 10:20:56,557 INFO L226 Difference]: Without dead ends: 169728 [2018-12-02 10:20:56,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 10:20:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169728 states. [2018-12-02 10:21:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169728 to 143120. [2018-12-02 10:21:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143120 states. [2018-12-02 10:21:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143120 states to 143120 states and 563173 transitions. [2018-12-02 10:21:01,411 INFO L78 Accepts]: Start accepts. Automaton has 143120 states and 563173 transitions. Word has length 82 [2018-12-02 10:21:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:01,412 INFO L480 AbstractCegarLoop]: Abstraction has 143120 states and 563173 transitions. [2018-12-02 10:21:01,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:21:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 143120 states and 563173 transitions. [2018-12-02 10:21:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 10:21:01,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:01,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:01,540 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:01,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1547781004, now seen corresponding path program 1 times [2018-12-02 10:21:01,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:01,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:01,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:01,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:01,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:01,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 10:21:01,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:01,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 10:21:01,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 10:21:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:21:01,631 INFO L87 Difference]: Start difference. First operand 143120 states and 563173 transitions. Second operand 10 states. [2018-12-02 10:21:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:03,400 INFO L93 Difference]: Finished difference Result 180672 states and 697501 transitions. [2018-12-02 10:21:03,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 10:21:03,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-02 10:21:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:04,011 INFO L225 Difference]: With dead ends: 180672 [2018-12-02 10:21:04,011 INFO L226 Difference]: Without dead ends: 180352 [2018-12-02 10:21:04,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 10:21:04,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180352 states. [2018-12-02 10:21:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180352 to 134400. [2018-12-02 10:21:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134400 states. [2018-12-02 10:21:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134400 states to 134400 states and 527629 transitions. [2018-12-02 10:21:06,521 INFO L78 Accepts]: Start accepts. Automaton has 134400 states and 527629 transitions. Word has length 88 [2018-12-02 10:21:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:06,521 INFO L480 AbstractCegarLoop]: Abstraction has 134400 states and 527629 transitions. [2018-12-02 10:21:06,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 10:21:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 134400 states and 527629 transitions. [2018-12-02 10:21:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 10:21:06,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:06,652 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] [2018-12-02 10:21:06,652 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:06,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash -857926826, now seen corresponding path program 1 times [2018-12-02 10:21:06,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:06,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:06,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:06,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:06,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:06,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:21:06,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:21:06,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:21:06,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:21:06,693 INFO L87 Difference]: Start difference. First operand 134400 states and 527629 transitions. Second operand 4 states. [2018-12-02 10:21:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:07,466 INFO L93 Difference]: Finished difference Result 158034 states and 614319 transitions. [2018-12-02 10:21:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 10:21:07,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-02 10:21:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:07,816 INFO L225 Difference]: With dead ends: 158034 [2018-12-02 10:21:07,816 INFO L226 Difference]: Without dead ends: 157074 [2018-12-02 10:21:07,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:21:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157074 states. [2018-12-02 10:21:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157074 to 150402. [2018-12-02 10:21:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150402 states. [2018-12-02 10:21:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150402 states to 150402 states and 586759 transitions. [2018-12-02 10:21:10,700 INFO L78 Accepts]: Start accepts. Automaton has 150402 states and 586759 transitions. Word has length 90 [2018-12-02 10:21:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:10,700 INFO L480 AbstractCegarLoop]: Abstraction has 150402 states and 586759 transitions. [2018-12-02 10:21:10,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:21:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 150402 states and 586759 transitions. [2018-12-02 10:21:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 10:21:10,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:10,862 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] [2018-12-02 10:21:10,862 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:10,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1501380183, now seen corresponding path program 1 times [2018-12-02 10:21:10,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:10,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:10,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:10,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:10,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:21:10,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:10,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:21:10,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:21:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:21:10,889 INFO L87 Difference]: Start difference. First operand 150402 states and 586759 transitions. Second operand 3 states. [2018-12-02 10:21:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:11,590 INFO L93 Difference]: Finished difference Result 158257 states and 616249 transitions. [2018-12-02 10:21:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:21:11,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-02 10:21:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:11,938 INFO L225 Difference]: With dead ends: 158257 [2018-12-02 10:21:11,938 INFO L226 Difference]: Without dead ends: 158257 [2018-12-02 10:21:11,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:21:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158257 states. [2018-12-02 10:21:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158257 to 154244. [2018-12-02 10:21:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154244 states. [2018-12-02 10:21:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154244 states to 154244 states and 601129 transitions. [2018-12-02 10:21:14,517 INFO L78 Accepts]: Start accepts. Automaton has 154244 states and 601129 transitions. Word has length 90 [2018-12-02 10:21:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:14,517 INFO L480 AbstractCegarLoop]: Abstraction has 154244 states and 601129 transitions. [2018-12-02 10:21:14,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:21:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 154244 states and 601129 transitions. [2018-12-02 10:21:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 10:21:14,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:14,693 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] [2018-12-02 10:21:14,694 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:14,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1760831503, now seen corresponding path program 1 times [2018-12-02 10:21:14,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:14,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:14,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:14,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:14,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:14,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:21:14,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:14,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:21:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:21:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:21:14,729 INFO L87 Difference]: Start difference. First operand 154244 states and 601129 transitions. Second operand 3 states. [2018-12-02 10:21:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:15,578 INFO L93 Difference]: Finished difference Result 141076 states and 547729 transitions. [2018-12-02 10:21:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:21:15,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-02 10:21:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:15,876 INFO L225 Difference]: With dead ends: 141076 [2018-12-02 10:21:15,876 INFO L226 Difference]: Without dead ends: 139940 [2018-12-02 10:21:15,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:21:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139940 states. [2018-12-02 10:21:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139940 to 137094. [2018-12-02 10:21:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137094 states. [2018-12-02 10:21:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137094 states to 137094 states and 533157 transitions. [2018-12-02 10:21:18,287 INFO L78 Accepts]: Start accepts. Automaton has 137094 states and 533157 transitions. Word has length 91 [2018-12-02 10:21:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:18,287 INFO L480 AbstractCegarLoop]: Abstraction has 137094 states and 533157 transitions. [2018-12-02 10:21:18,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:21:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 137094 states and 533157 transitions. [2018-12-02 10:21:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 10:21:18,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:18,420 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] [2018-12-02 10:21:18,421 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:18,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1422955889, now seen corresponding path program 1 times [2018-12-02 10:21:18,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:18,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:18,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:18,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:18,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:21:18,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:18,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:21:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:21:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:18,474 INFO L87 Difference]: Start difference. First operand 137094 states and 533157 transitions. Second operand 6 states. [2018-12-02 10:21:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:19,272 INFO L93 Difference]: Finished difference Result 145597 states and 562700 transitions. [2018-12-02 10:21:19,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:21:19,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 10:21:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:19,589 INFO L225 Difference]: With dead ends: 145597 [2018-12-02 10:21:19,590 INFO L226 Difference]: Without dead ends: 145597 [2018-12-02 10:21:19,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 10:21:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145597 states. [2018-12-02 10:21:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145597 to 137839. [2018-12-02 10:21:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137839 states. [2018-12-02 10:21:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137839 states to 137839 states and 535478 transitions. [2018-12-02 10:21:21,985 INFO L78 Accepts]: Start accepts. Automaton has 137839 states and 535478 transitions. Word has length 91 [2018-12-02 10:21:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:21,985 INFO L480 AbstractCegarLoop]: Abstraction has 137839 states and 535478 transitions. [2018-12-02 10:21:21,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:21:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 137839 states and 535478 transitions. [2018-12-02 10:21:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 10:21:22,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:22,123 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] [2018-12-02 10:21:22,123 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:22,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -512704398, now seen corresponding path program 1 times [2018-12-02 10:21:22,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:22,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:22,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:22,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:22,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:21:22,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:22,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:21:22,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:21:22,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:22,191 INFO L87 Difference]: Start difference. First operand 137839 states and 535478 transitions. Second operand 7 states. [2018-12-02 10:21:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:23,059 INFO L93 Difference]: Finished difference Result 147747 states and 570216 transitions. [2018-12-02 10:21:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:21:23,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 10:21:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:23,683 INFO L225 Difference]: With dead ends: 147747 [2018-12-02 10:21:23,683 INFO L226 Difference]: Without dead ends: 147747 [2018-12-02 10:21:23,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:21:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147747 states. [2018-12-02 10:21:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147747 to 139330. [2018-12-02 10:21:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139330 states. [2018-12-02 10:21:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139330 states to 139330 states and 539931 transitions. [2018-12-02 10:21:25,692 INFO L78 Accepts]: Start accepts. Automaton has 139330 states and 539931 transitions. Word has length 91 [2018-12-02 10:21:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:25,692 INFO L480 AbstractCegarLoop]: Abstraction has 139330 states and 539931 transitions. [2018-12-02 10:21:25,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:21:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 139330 states and 539931 transitions. [2018-12-02 10:21:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 10:21:25,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:25,832 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] [2018-12-02 10:21:25,832 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:25,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash -182938637, now seen corresponding path program 1 times [2018-12-02 10:21:25,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:25,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:25,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:25,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:25,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-02 10:21:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:21:25,865 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:25,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:21:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:21:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:25,866 INFO L87 Difference]: Start difference. First operand 139330 states and 539931 transitions. Second operand 6 states. [2018-12-02 10:21:26,052 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-12-02 10:21:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:26,160 INFO L93 Difference]: Finished difference Result 18690 states and 61579 transitions. [2018-12-02 10:21:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:21:26,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 10:21:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:26,181 INFO L225 Difference]: With dead ends: 18690 [2018-12-02 10:21:26,181 INFO L226 Difference]: Without dead ends: 16038 [2018-12-02 10:21:26,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:21:26,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16038 states. [2018-12-02 10:21:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16038 to 15533. [2018-12-02 10:21:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15533 states. [2018-12-02 10:21:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15533 states to 15533 states and 51148 transitions. [2018-12-02 10:21:26,353 INFO L78 Accepts]: Start accepts. Automaton has 15533 states and 51148 transitions. Word has length 91 [2018-12-02 10:21:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 15533 states and 51148 transitions. [2018-12-02 10:21:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:21:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15533 states and 51148 transitions. [2018-12-02 10:21:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 10:21:26,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:26,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:26,368 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:26,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash 638002360, now seen corresponding path program 1 times [2018-12-02 10:21:26,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:26,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:26,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:26,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:21:26,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:26,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:21:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:21:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:26,423 INFO L87 Difference]: Start difference. First operand 15533 states and 51148 transitions. Second operand 7 states. [2018-12-02 10:21:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:26,635 INFO L93 Difference]: Finished difference Result 17432 states and 57040 transitions. [2018-12-02 10:21:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:21:26,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 10:21:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:26,654 INFO L225 Difference]: With dead ends: 17432 [2018-12-02 10:21:26,654 INFO L226 Difference]: Without dead ends: 17432 [2018-12-02 10:21:26,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17432 states. [2018-12-02 10:21:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17432 to 15898. [2018-12-02 10:21:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15898 states. [2018-12-02 10:21:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 52215 transitions. [2018-12-02 10:21:26,817 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 52215 transitions. Word has length 103 [2018-12-02 10:21:26,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:26,817 INFO L480 AbstractCegarLoop]: Abstraction has 15898 states and 52215 transitions. [2018-12-02 10:21:26,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:21:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 52215 transitions. [2018-12-02 10:21:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 10:21:26,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:26,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:26,830 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:26,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1607583383, now seen corresponding path program 1 times [2018-12-02 10:21:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:26,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:21:26,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:26,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:21:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:21:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:26,918 INFO L87 Difference]: Start difference. First operand 15898 states and 52215 transitions. Second operand 7 states. [2018-12-02 10:21:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:27,170 INFO L93 Difference]: Finished difference Result 21554 states and 68742 transitions. [2018-12-02 10:21:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 10:21:27,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-02 10:21:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:27,194 INFO L225 Difference]: With dead ends: 21554 [2018-12-02 10:21:27,194 INFO L226 Difference]: Without dead ends: 21394 [2018-12-02 10:21:27,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-02 10:21:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21394 states. [2018-12-02 10:21:27,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 16653. [2018-12-02 10:21:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16653 states. [2018-12-02 10:21:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16653 states to 16653 states and 54159 transitions. [2018-12-02 10:21:27,383 INFO L78 Accepts]: Start accepts. Automaton has 16653 states and 54159 transitions. Word has length 103 [2018-12-02 10:21:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:27,383 INFO L480 AbstractCegarLoop]: Abstraction has 16653 states and 54159 transitions. [2018-12-02 10:21:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:21:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16653 states and 54159 transitions. [2018-12-02 10:21:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 10:21:27,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:27,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:27,396 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:27,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:27,396 INFO L82 PathProgramCache]: Analyzing trace with hash -328076904, now seen corresponding path program 1 times [2018-12-02 10:21:27,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:27,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:27,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:27,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:27,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:27,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:21:27,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:27,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:21:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:21:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:27,467 INFO L87 Difference]: Start difference. First operand 16653 states and 54159 transitions. Second operand 6 states. [2018-12-02 10:21:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:27,637 INFO L93 Difference]: Finished difference Result 16793 states and 53916 transitions. [2018-12-02 10:21:27,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 10:21:27,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-02 10:21:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:27,655 INFO L225 Difference]: With dead ends: 16793 [2018-12-02 10:21:27,655 INFO L226 Difference]: Without dead ends: 16793 [2018-12-02 10:21:27,655 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-02 10:21:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16793 states. [2018-12-02 10:21:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16793 to 15578. [2018-12-02 10:21:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15578 states. [2018-12-02 10:21:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15578 states to 15578 states and 50519 transitions. [2018-12-02 10:21:27,818 INFO L78 Accepts]: Start accepts. Automaton has 15578 states and 50519 transitions. Word has length 103 [2018-12-02 10:21:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 15578 states and 50519 transitions. [2018-12-02 10:21:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:21:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15578 states and 50519 transitions. [2018-12-02 10:21:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:27,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:27,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:27,831 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:27,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash -110554694, now seen corresponding path program 1 times [2018-12-02 10:21:27,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:27,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:27,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:27,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:21:27,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:27,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:21:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:21:27,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:27,867 INFO L87 Difference]: Start difference. First operand 15578 states and 50519 transitions. Second operand 6 states. [2018-12-02 10:21:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:28,080 INFO L93 Difference]: Finished difference Result 19767 states and 63270 transitions. [2018-12-02 10:21:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 10:21:28,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 10:21:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:28,101 INFO L225 Difference]: With dead ends: 19767 [2018-12-02 10:21:28,101 INFO L226 Difference]: Without dead ends: 19767 [2018-12-02 10:21:28,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:21:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19767 states. [2018-12-02 10:21:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19767 to 16718. [2018-12-02 10:21:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16718 states. [2018-12-02 10:21:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16718 states to 16718 states and 54136 transitions. [2018-12-02 10:21:28,285 INFO L78 Accepts]: Start accepts. Automaton has 16718 states and 54136 transitions. Word has length 105 [2018-12-02 10:21:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:28,285 INFO L480 AbstractCegarLoop]: Abstraction has 16718 states and 54136 transitions. [2018-12-02 10:21:28,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:21:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 16718 states and 54136 transitions. [2018-12-02 10:21:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:28,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:28,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:28,298 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:28,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:28,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1159044518, now seen corresponding path program 1 times [2018-12-02 10:21:28,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:28,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:28,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:28,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:21:28,347 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:28,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:21:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:21:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:28,348 INFO L87 Difference]: Start difference. First operand 16718 states and 54136 transitions. Second operand 6 states. [2018-12-02 10:21:28,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:28,422 INFO L93 Difference]: Finished difference Result 16233 states and 52193 transitions. [2018-12-02 10:21:28,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:21:28,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-02 10:21:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:28,439 INFO L225 Difference]: With dead ends: 16233 [2018-12-02 10:21:28,439 INFO L226 Difference]: Without dead ends: 16143 [2018-12-02 10:21:28,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16143 states. [2018-12-02 10:21:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16143 to 15343. [2018-12-02 10:21:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15343 states. [2018-12-02 10:21:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15343 states to 15343 states and 49681 transitions. [2018-12-02 10:21:28,599 INFO L78 Accepts]: Start accepts. Automaton has 15343 states and 49681 transitions. Word has length 105 [2018-12-02 10:21:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:28,599 INFO L480 AbstractCegarLoop]: Abstraction has 15343 states and 49681 transitions. [2018-12-02 10:21:28,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:21:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15343 states and 49681 transitions. [2018-12-02 10:21:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:28,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:28,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:28,612 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:28,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2046214981, now seen corresponding path program 1 times [2018-12-02 10:21:28,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:28,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:28,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:28,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:28,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 10:21:28,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:28,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 10:21:28,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 10:21:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 10:21:28,637 INFO L87 Difference]: Start difference. First operand 15343 states and 49681 transitions. Second operand 4 states. [2018-12-02 10:21:28,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:28,707 INFO L93 Difference]: Finished difference Result 14703 states and 47345 transitions. [2018-12-02 10:21:28,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:21:28,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 10:21:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:28,723 INFO L225 Difference]: With dead ends: 14703 [2018-12-02 10:21:28,723 INFO L226 Difference]: Without dead ends: 14703 [2018-12-02 10:21:28,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:21:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14703 states. [2018-12-02 10:21:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14703 to 13649. [2018-12-02 10:21:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13649 states. [2018-12-02 10:21:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13649 states to 13649 states and 44178 transitions. [2018-12-02 10:21:28,865 INFO L78 Accepts]: Start accepts. Automaton has 13649 states and 44178 transitions. Word has length 105 [2018-12-02 10:21:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:28,865 INFO L480 AbstractCegarLoop]: Abstraction has 13649 states and 44178 transitions. [2018-12-02 10:21:28,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 10:21:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 13649 states and 44178 transitions. [2018-12-02 10:21:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:28,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:28,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:28,876 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:28,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1200262491, now seen corresponding path program 1 times [2018-12-02 10:21:28,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:28,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:28,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:28,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:28,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:21:28,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:28,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:21:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:21:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:21:28,965 INFO L87 Difference]: Start difference. First operand 13649 states and 44178 transitions. Second operand 5 states. [2018-12-02 10:21:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:29,093 INFO L93 Difference]: Finished difference Result 15441 states and 49938 transitions. [2018-12-02 10:21:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:21:29,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 10:21:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:29,110 INFO L225 Difference]: With dead ends: 15441 [2018-12-02 10:21:29,110 INFO L226 Difference]: Without dead ends: 15313 [2018-12-02 10:21:29,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:21:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2018-12-02 10:21:29,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 13841. [2018-12-02 10:21:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13841 states. [2018-12-02 10:21:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13841 states to 13841 states and 44738 transitions. [2018-12-02 10:21:29,265 INFO L78 Accepts]: Start accepts. Automaton has 13841 states and 44738 transitions. Word has length 105 [2018-12-02 10:21:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:29,265 INFO L480 AbstractCegarLoop]: Abstraction has 13841 states and 44738 transitions. [2018-12-02 10:21:29,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:21:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 13841 states and 44738 transitions. [2018-12-02 10:21:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:29,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:29,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:29,276 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1849940324, now seen corresponding path program 1 times [2018-12-02 10:21:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:29,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:29,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:21:29,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:29,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:21:29,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:21:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:21:29,338 INFO L87 Difference]: Start difference. First operand 13841 states and 44738 transitions. Second operand 5 states. [2018-12-02 10:21:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:29,403 INFO L93 Difference]: Finished difference Result 20629 states and 67822 transitions. [2018-12-02 10:21:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:21:29,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 10:21:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:29,427 INFO L225 Difference]: With dead ends: 20629 [2018-12-02 10:21:29,427 INFO L226 Difference]: Without dead ends: 20629 [2018-12-02 10:21:29,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:29,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20629 states. [2018-12-02 10:21:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20629 to 13201. [2018-12-02 10:21:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13201 states. [2018-12-02 10:21:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13201 states to 13201 states and 42611 transitions. [2018-12-02 10:21:29,598 INFO L78 Accepts]: Start accepts. Automaton has 13201 states and 42611 transitions. Word has length 105 [2018-12-02 10:21:29,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:29,599 INFO L480 AbstractCegarLoop]: Abstraction has 13201 states and 42611 transitions. [2018-12-02 10:21:29,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:21:29,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13201 states and 42611 transitions. [2018-12-02 10:21:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:29,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:29,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:29,610 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:29,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -880359301, now seen corresponding path program 1 times [2018-12-02 10:21:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:29,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:29,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:29,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:29,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:21:29,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:29,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:21:29,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:21:29,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:21:29,683 INFO L87 Difference]: Start difference. First operand 13201 states and 42611 transitions. Second operand 9 states. [2018-12-02 10:21:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:29,832 INFO L93 Difference]: Finished difference Result 24725 states and 80418 transitions. [2018-12-02 10:21:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:21:29,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 10:21:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:29,847 INFO L225 Difference]: With dead ends: 24725 [2018-12-02 10:21:29,847 INFO L226 Difference]: Without dead ends: 12605 [2018-12-02 10:21:29,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 10:21:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12605 states. [2018-12-02 10:21:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12605 to 12605. [2018-12-02 10:21:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12605 states. [2018-12-02 10:21:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12605 states to 12605 states and 40875 transitions. [2018-12-02 10:21:29,977 INFO L78 Accepts]: Start accepts. Automaton has 12605 states and 40875 transitions. Word has length 105 [2018-12-02 10:21:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:29,977 INFO L480 AbstractCegarLoop]: Abstraction has 12605 states and 40875 transitions. [2018-12-02 10:21:29,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:21:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12605 states and 40875 transitions. [2018-12-02 10:21:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:29,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:29,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:29,988 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:29,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash -287902169, now seen corresponding path program 2 times [2018-12-02 10:21:29,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:29,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:30,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:30,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:21:30,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:30,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:21:30,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:21:30,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:21:30,066 INFO L87 Difference]: Start difference. First operand 12605 states and 40875 transitions. Second operand 9 states. [2018-12-02 10:21:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:30,196 INFO L93 Difference]: Finished difference Result 20589 states and 67655 transitions. [2018-12-02 10:21:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:21:30,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-02 10:21:30,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:30,206 INFO L225 Difference]: With dead ends: 20589 [2018-12-02 10:21:30,206 INFO L226 Difference]: Without dead ends: 8278 [2018-12-02 10:21:30,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 10:21:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2018-12-02 10:21:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 8278. [2018-12-02 10:21:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8278 states. [2018-12-02 10:21:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8278 states to 8278 states and 27564 transitions. [2018-12-02 10:21:30,291 INFO L78 Accepts]: Start accepts. Automaton has 8278 states and 27564 transitions. Word has length 105 [2018-12-02 10:21:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:30,291 INFO L480 AbstractCegarLoop]: Abstraction has 8278 states and 27564 transitions. [2018-12-02 10:21:30,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:21:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 8278 states and 27564 transitions. [2018-12-02 10:21:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:30,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:30,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:30,299 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:30,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:30,299 INFO L82 PathProgramCache]: Analyzing trace with hash -817088528, now seen corresponding path program 1 times [2018-12-02 10:21:30,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:30,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:21:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:30,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:30,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:30,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 10:21:30,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:30,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 10:21:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 10:21:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 10:21:30,345 INFO L87 Difference]: Start difference. First operand 8278 states and 27564 transitions. Second operand 5 states. [2018-12-02 10:21:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:30,424 INFO L93 Difference]: Finished difference Result 9715 states and 31700 transitions. [2018-12-02 10:21:30,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 10:21:30,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-02 10:21:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:30,435 INFO L225 Difference]: With dead ends: 9715 [2018-12-02 10:21:30,435 INFO L226 Difference]: Without dead ends: 9635 [2018-12-02 10:21:30,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:21:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9635 states. [2018-12-02 10:21:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9635 to 8340. [2018-12-02 10:21:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8340 states. [2018-12-02 10:21:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8340 states to 8340 states and 27733 transitions. [2018-12-02 10:21:30,520 INFO L78 Accepts]: Start accepts. Automaton has 8340 states and 27733 transitions. Word has length 105 [2018-12-02 10:21:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:30,521 INFO L480 AbstractCegarLoop]: Abstraction has 8340 states and 27733 transitions. [2018-12-02 10:21:30,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 10:21:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8340 states and 27733 transitions. [2018-12-02 10:21:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:30,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:30,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:30,528 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:30,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138289, now seen corresponding path program 3 times [2018-12-02 10:21:30,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:21:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:30,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:21:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:21:30,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:21:30,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 10:21:30,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:21:30,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 10:21:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 10:21:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 10:21:30,632 INFO L87 Difference]: Start difference. First operand 8340 states and 27733 transitions. Second operand 12 states. [2018-12-02 10:21:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:21:31,081 INFO L93 Difference]: Finished difference Result 15960 states and 53352 transitions. [2018-12-02 10:21:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 10:21:31,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 10:21:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:21:31,093 INFO L225 Difference]: With dead ends: 15960 [2018-12-02 10:21:31,093 INFO L226 Difference]: Without dead ends: 11416 [2018-12-02 10:21:31,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 10:21:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11416 states. [2018-12-02 10:21:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11416 to 10736. [2018-12-02 10:21:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10736 states. [2018-12-02 10:21:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10736 states to 10736 states and 34978 transitions. [2018-12-02 10:21:31,200 INFO L78 Accepts]: Start accepts. Automaton has 10736 states and 34978 transitions. Word has length 105 [2018-12-02 10:21:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:21:31,200 INFO L480 AbstractCegarLoop]: Abstraction has 10736 states and 34978 transitions. [2018-12-02 10:21:31,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 10:21:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10736 states and 34978 transitions. [2018-12-02 10:21:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 10:21:31,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:21:31,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:21:31,209 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:21:31,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:21:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash 653369973, now seen corresponding path program 4 times [2018-12-02 10:21:31,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:21:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:31,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 10:21:31,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:21:31,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:21:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:21:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 10:21:31,259 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 10:21:31,344 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 10:21:31,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:21:31 BasicIcfg [2018-12-02 10:21:31,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 10:21:31,346 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 10:21:31,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 10:21:31,346 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 10:21:31,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:18:41" (3/4) ... [2018-12-02 10:21:31,348 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 10:21:31,424 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f925364b-5651-4a74-a477-7ef0ebd4b5b8/bin-2019/utaipan/witness.graphml [2018-12-02 10:21:31,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 10:21:31,425 INFO L168 Benchmark]: Toolchain (without parser) took 170875.21 ms. Allocated memory was 1.0 GB in the beginning and 9.4 GB in the end (delta: 8.3 GB). Free memory was 947.0 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 6.5 GB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,426 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-02 10:21:31,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.39 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,426 INFO L168 Benchmark]: Boogie Preprocessor took 27.33 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-02 10:21:31,426 INFO L168 Benchmark]: RCFGBuilder took 361.85 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,426 INFO L168 Benchmark]: TraceAbstraction took 169998.99 ms. Allocated memory was 1.1 GB in the beginning and 9.4 GB in the end (delta: 8.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,427 INFO L168 Benchmark]: Witness Printer took 79.15 ms. Allocated memory is still 9.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2018-12-02 10:21:31,428 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 362.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.39 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.33 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 361.85 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: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 169998.99 ms. Allocated memory was 1.1 GB in the beginning and 9.4 GB in the end (delta: 8.2 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 6.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.15 ms. Allocated memory is still 9.4 GB. Free memory was 2.8 GB in the beginning and 2.8 GB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1110; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1110, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1111; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1111, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1112; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1112, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 169.9s OverallTime, 35 OverallIterations, 1 TraceHistogramMax, 58.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9281 SDtfs, 10699 SDslu, 23912 SDs, 0 SdLazy, 8438 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 100 SyntacticMatches, 22 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314072occurred in iteration=11, 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: 93.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 1142348 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2987 NumberOfCodeBlocks, 2987 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2848 ConstructedInterpolants, 0 QuantifiedInterpolants, 593611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...