./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/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 6e0509072627462b1b2a882e317e2a071d382ef5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 08:57:49,032 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:57:49,033 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:57:49,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:57:49,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:57:49,040 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:57:49,041 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:57:49,042 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:57:49,043 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:57:49,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:57:49,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:57:49,044 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:57:49,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:57:49,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:57:49,045 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:57:49,046 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:57:49,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:57:49,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:57:49,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:57:49,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:57:49,049 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:57:49,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:57:49,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:57:49,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:57:49,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:57:49,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:57:49,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:57:49,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:57:49,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:57:49,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:57:49,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:57:49,054 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:57:49,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:57:49,055 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:57:49,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:57:49,055 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:57:49,056 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 08:57:49,063 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:57:49,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:57:49,064 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:57:49,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:57:49,064 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:57:49,065 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:57:49,065 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:57:49,065 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:57:49,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:57:49,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:57:49,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:57:49,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:57:49,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:57:49,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:57:49,067 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 08:57:49,067 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_d844f2d2-a6ac-4971-b67d-533ef814cdba/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 -> 6e0509072627462b1b2a882e317e2a071d382ef5 [2018-12-02 08:57:49,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:57:49,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:57:49,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:57:49,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:57:49,094 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:57:49,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i [2018-12-02 08:57:49,129 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/data/562ffc6d3/a48dc6c4941042ea933228f9e3fe348c/FLAG52c59a169 [2018-12-02 08:57:49,609 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:57:49,609 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/sv-benchmarks/c/pthread-wmm/rfi007_tso.opt_false-unreach-call.i [2018-12-02 08:57:49,617 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/data/562ffc6d3/a48dc6c4941042ea933228f9e3fe348c/FLAG52c59a169 [2018-12-02 08:57:49,626 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/data/562ffc6d3/a48dc6c4941042ea933228f9e3fe348c [2018-12-02 08:57:49,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:57:49,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:57:49,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:57:49,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:57:49,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:57:49,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:57:49" (1/1) ... [2018-12-02 08:57:49,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:49, skipping insertion in model container [2018-12-02 08:57:49,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:57:49" (1/1) ... [2018-12-02 08:57:49,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:57:49,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:57:49,907 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:57:49,916 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:57:50,028 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:57:50,063 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:57:50,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50 WrapperNode [2018-12-02 08:57:50,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:57:50,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:57:50,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:57:50,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:57:50,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:57:50,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:57:50,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:57:50,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:57:50,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... [2018-12-02 08:57:50,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:57:50,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:57:50,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:57:50,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:57:50,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/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 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 08:57:50,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 08:57:50,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 08:57:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 08:57:50,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 08:57:50,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:57:50,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:57:50,163 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 08:57:50,585 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:57:50,586 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 08:57:50,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:50 BoogieIcfgContainer [2018-12-02 08:57:50,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:57:50,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:57:50,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:57:50,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:57:50,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:57:49" (1/3) ... [2018-12-02 08:57:50,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528de17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:57:50, skipping insertion in model container [2018-12-02 08:57:50,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:57:50" (2/3) ... [2018-12-02 08:57:50,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528de17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:57:50, skipping insertion in model container [2018-12-02 08:57:50,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:50" (3/3) ... [2018-12-02 08:57:50,591 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.opt_false-unreach-call.i [2018-12-02 08:57:50,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,620 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,621 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,622 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,623 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,624 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,625 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,626 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,626 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,627 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,628 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,629 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,630 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,631 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,632 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,633 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,634 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,635 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,636 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,637 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,638 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,639 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,640 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,641 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,642 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,643 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,644 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,645 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,646 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,647 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,648 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 08:57:50,652 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 08:57:50,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:57:50,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 08:57:50,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 08:57:50,694 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:57:50,694 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:57:50,694 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:57:50,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:57:50,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:57:50,694 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:57:50,695 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:57:50,695 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:57:50,705 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-02 08:57:55,160 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-02 08:57:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-02 08:57:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 08:57:55,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:57:55,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:57:55,169 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:57:55,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:57:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash 210414996, now seen corresponding path program 1 times [2018-12-02 08:57:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:57:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:57:55,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:57:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:57:55,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:57:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:57:55,323 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 08:57:55,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:57:55,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:57:55,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:57:55,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:57:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:57:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:57:55,338 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-02 08:57:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:57:56,194 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-02 08:57:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:57:56,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 08:57:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:57:56,824 INFO L225 Difference]: With dead ends: 142996 [2018-12-02 08:57:56,824 INFO L226 Difference]: Without dead ends: 126812 [2018-12-02 08:57:56,825 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 08:57:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-02 08:57:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-02 08:57:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-02 08:57:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-02 08:57:59,372 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-02 08:57:59,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:57:59,372 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-02 08:57:59,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:57:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-02 08:57:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 08:57:59,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:57:59,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:57:59,375 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:57:59,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:57:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash -746847349, now seen corresponding path program 1 times [2018-12-02 08:57:59,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:57:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:57:59,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:57:59,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:57:59,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:57:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:57:59,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 08:57:59,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:57:59,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:57:59,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:57:59,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:57:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:57:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:57:59,424 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-02 08:58:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:00,557 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-02 08:58:00,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:00,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 08:58:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:02,691 INFO L225 Difference]: With dead ends: 201246 [2018-12-02 08:58:02,691 INFO L226 Difference]: Without dead ends: 201086 [2018-12-02 08:58:02,692 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 08:58:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-02 08:58:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-02 08:58:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-02 08:58:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-02 08:58:05,795 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-02 08:58:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:05,796 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-02 08:58:05,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-02 08:58:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 08:58:05,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:05,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:05,976 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:05,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 56283897, now seen corresponding path program 1 times [2018-12-02 08:58:05,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:05,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:05,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:05,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:05,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:06,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:06,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:06,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:06,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:06,010 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-02 08:58:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:06,086 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-02 08:58:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:06,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 08:58:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:06,123 INFO L225 Difference]: With dead ends: 26128 [2018-12-02 08:58:06,123 INFO L226 Difference]: Without dead ends: 24431 [2018-12-02 08:58:06,124 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 08:58:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-02 08:58:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-02 08:58:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-02 08:58:06,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-02 08:58:06,422 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-02 08:58:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:06,422 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-02 08:58:06,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-02 08:58:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 08:58:06,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:06,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:06,425 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:06,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -677750709, now seen corresponding path program 1 times [2018-12-02 08:58:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:06,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:06,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:06,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:06,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:06,481 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 08:58:06,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:06,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:06,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:06,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:06,481 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-02 08:58:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:06,741 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-02 08:58:06,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:06,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 08:58:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:06,786 INFO L225 Difference]: With dead ends: 33039 [2018-12-02 08:58:06,786 INFO L226 Difference]: Without dead ends: 33039 [2018-12-02 08:58:06,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-02 08:58:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-02 08:58:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-02 08:58:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-02 08:58:07,162 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-02 08:58:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:07,162 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-02 08:58:07,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-02 08:58:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 08:58:07,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:07,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:07,167 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:07,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:07,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1045055487, now seen corresponding path program 1 times [2018-12-02 08:58:07,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:07,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:07,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:07,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:07,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:07,216 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 08:58:07,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:07,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:07,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:07,217 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-02 08:58:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:07,740 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-02 08:58:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:07,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 08:58:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:07,787 INFO L225 Difference]: With dead ends: 34248 [2018-12-02 08:58:07,787 INFO L226 Difference]: Without dead ends: 34248 [2018-12-02 08:58:07,787 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 08:58:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-02 08:58:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-02 08:58:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-02 08:58:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-02 08:58:08,344 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-02 08:58:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:08,344 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-02 08:58:08,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-02 08:58:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 08:58:08,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:08,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:08,348 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:08,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1896602112, now seen corresponding path program 1 times [2018-12-02 08:58:08,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:08,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:08,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:08,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:08,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:08,403 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 08:58:08,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:08,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:08,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:08,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:08,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:08,404 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-02 08:58:09,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:09,266 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-02 08:58:09,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 08:58:09,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 08:58:09,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:09,330 INFO L225 Difference]: With dead ends: 46397 [2018-12-02 08:58:09,330 INFO L226 Difference]: Without dead ends: 46365 [2018-12-02 08:58:09,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 08:58:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-02 08:58:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-02 08:58:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-02 08:58:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-02 08:58:09,840 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-02 08:58:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:09,840 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-02 08:58:09,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-02 08:58:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 08:58:09,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:09,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:09,854 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:09,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -687839314, now seen corresponding path program 1 times [2018-12-02 08:58:09,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:09,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:09,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:09,909 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 08:58:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:09,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:09,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:09,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:09,910 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 5 states. [2018-12-02 08:58:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:09,952 INFO L93 Difference]: Finished difference Result 6357 states and 16810 transitions. [2018-12-02 08:58:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:58:09,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-12-02 08:58:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:09,956 INFO L225 Difference]: With dead ends: 6357 [2018-12-02 08:58:09,957 INFO L226 Difference]: Without dead ends: 5185 [2018-12-02 08:58:09,957 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 08:58:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5185 states. [2018-12-02 08:58:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5185 to 4549. [2018-12-02 08:58:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-12-02 08:58:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 11874 transitions. [2018-12-02 08:58:09,999 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 11874 transitions. Word has length 72 [2018-12-02 08:58:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:10,000 INFO L480 AbstractCegarLoop]: Abstraction has 4549 states and 11874 transitions. [2018-12-02 08:58:10,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 11874 transitions. [2018-12-02 08:58:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:10,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:10,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:10,004 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:10,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash -45620389, now seen corresponding path program 1 times [2018-12-02 08:58:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:10,079 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 08:58:10,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:10,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:10,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:10,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:10,080 INFO L87 Difference]: Start difference. First operand 4549 states and 11874 transitions. Second operand 6 states. [2018-12-02 08:58:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:10,493 INFO L93 Difference]: Finished difference Result 5873 states and 15097 transitions. [2018-12-02 08:58:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:10,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-02 08:58:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:10,497 INFO L225 Difference]: With dead ends: 5873 [2018-12-02 08:58:10,497 INFO L226 Difference]: Without dead ends: 5873 [2018-12-02 08:58:10,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 08:58:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2018-12-02 08:58:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 4775. [2018-12-02 08:58:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4775 states. [2018-12-02 08:58:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 12453 transitions. [2018-12-02 08:58:10,535 INFO L78 Accepts]: Start accepts. Automaton has 4775 states and 12453 transitions. Word has length 107 [2018-12-02 08:58:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:10,535 INFO L480 AbstractCegarLoop]: Abstraction has 4775 states and 12453 transitions. [2018-12-02 08:58:10,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:10,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4775 states and 12453 transitions. [2018-12-02 08:58:10,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:10,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:10,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:10,539 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:10,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1503837772, now seen corresponding path program 1 times [2018-12-02 08:58:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:10,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:10,636 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 08:58:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:10,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:10,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:10,637 INFO L87 Difference]: Start difference. First operand 4775 states and 12453 transitions. Second operand 7 states. [2018-12-02 08:58:10,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:10,881 INFO L93 Difference]: Finished difference Result 5412 states and 13965 transitions. [2018-12-02 08:58:10,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:10,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-02 08:58:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:10,885 INFO L225 Difference]: With dead ends: 5412 [2018-12-02 08:58:10,885 INFO L226 Difference]: Without dead ends: 5412 [2018-12-02 08:58:10,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2018-12-02 08:58:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 4833. [2018-12-02 08:58:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2018-12-02 08:58:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 12587 transitions. [2018-12-02 08:58:10,924 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 12587 transitions. Word has length 107 [2018-12-02 08:58:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:10,924 INFO L480 AbstractCegarLoop]: Abstraction has 4833 states and 12587 transitions. [2018-12-02 08:58:10,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 12587 transitions. [2018-12-02 08:58:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:10,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:10,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:10,928 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:10,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879546, now seen corresponding path program 1 times [2018-12-02 08:58:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:10,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:11,024 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 08:58:11,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:11,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:11,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:11,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:11,025 INFO L87 Difference]: Start difference. First operand 4833 states and 12587 transitions. Second operand 7 states. [2018-12-02 08:58:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:11,390 INFO L93 Difference]: Finished difference Result 5654 states and 14374 transitions. [2018-12-02 08:58:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 08:58:11,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-02 08:58:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:11,394 INFO L225 Difference]: With dead ends: 5654 [2018-12-02 08:58:11,395 INFO L226 Difference]: Without dead ends: 5654 [2018-12-02 08:58:11,395 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 08:58:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2018-12-02 08:58:11,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5056. [2018-12-02 08:58:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5056 states. [2018-12-02 08:58:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 13052 transitions. [2018-12-02 08:58:11,432 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 13052 transitions. Word has length 107 [2018-12-02 08:58:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:11,432 INFO L480 AbstractCegarLoop]: Abstraction has 5056 states and 13052 transitions. [2018-12-02 08:58:11,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 13052 transitions. [2018-12-02 08:58:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:11,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:11,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:11,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:11,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:11,437 INFO L82 PathProgramCache]: Analyzing trace with hash -71967975, now seen corresponding path program 1 times [2018-12-02 08:58:11,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:11,483 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 08:58:11,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:11,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:11,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:11,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:11,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:11,484 INFO L87 Difference]: Start difference. First operand 5056 states and 13052 transitions. Second operand 5 states. [2018-12-02 08:58:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:11,639 INFO L93 Difference]: Finished difference Result 5663 states and 14389 transitions. [2018-12-02 08:58:11,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:58:11,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-02 08:58:11,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:11,644 INFO L225 Difference]: With dead ends: 5663 [2018-12-02 08:58:11,644 INFO L226 Difference]: Without dead ends: 5663 [2018-12-02 08:58:11,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 08:58:11,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5663 states. [2018-12-02 08:58:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5663 to 5076. [2018-12-02 08:58:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2018-12-02 08:58:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 13094 transitions. [2018-12-02 08:58:11,680 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 13094 transitions. Word has length 107 [2018-12-02 08:58:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:11,681 INFO L480 AbstractCegarLoop]: Abstraction has 5076 states and 13094 transitions. [2018-12-02 08:58:11,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:11,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 13094 transitions. [2018-12-02 08:58:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:11,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:11,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:11,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:11,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1252469456, now seen corresponding path program 2 times [2018-12-02 08:58:11,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:11,742 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 08:58:11,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:11,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:11,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:11,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:11,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:11,743 INFO L87 Difference]: Start difference. First operand 5076 states and 13094 transitions. Second operand 4 states. [2018-12-02 08:58:11,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:11,831 INFO L93 Difference]: Finished difference Result 5600 states and 14309 transitions. [2018-12-02 08:58:11,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:58:11,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 08:58:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:11,837 INFO L225 Difference]: With dead ends: 5600 [2018-12-02 08:58:11,837 INFO L226 Difference]: Without dead ends: 5572 [2018-12-02 08:58:11,837 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 08:58:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2018-12-02 08:58:11,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5535. [2018-12-02 08:58:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2018-12-02 08:58:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 14185 transitions. [2018-12-02 08:58:11,878 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 14185 transitions. Word has length 107 [2018-12-02 08:58:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:11,879 INFO L480 AbstractCegarLoop]: Abstraction has 5535 states and 14185 transitions. [2018-12-02 08:58:11,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 14185 transitions. [2018-12-02 08:58:11,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:11,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:11,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:11,883 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:11,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash -282888433, now seen corresponding path program 1 times [2018-12-02 08:58:11,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:58:11,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:11,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:11,915 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 08:58:11,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:11,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:58:11,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:11,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:58:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:58:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:58:11,916 INFO L87 Difference]: Start difference. First operand 5535 states and 14185 transitions. Second operand 3 states. [2018-12-02 08:58:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:12,021 INFO L93 Difference]: Finished difference Result 6900 states and 17352 transitions. [2018-12-02 08:58:12,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:58:12,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-02 08:58:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:12,026 INFO L225 Difference]: With dead ends: 6900 [2018-12-02 08:58:12,026 INFO L226 Difference]: Without dead ends: 6900 [2018-12-02 08:58:12,026 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 08:58:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6900 states. [2018-12-02 08:58:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6900 to 6575. [2018-12-02 08:58:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6575 states. [2018-12-02 08:58:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6575 states to 6575 states and 16634 transitions. [2018-12-02 08:58:12,076 INFO L78 Accepts]: Start accepts. Automaton has 6575 states and 16634 transitions. Word has length 107 [2018-12-02 08:58:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:12,076 INFO L480 AbstractCegarLoop]: Abstraction has 6575 states and 16634 transitions. [2018-12-02 08:58:12,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:58:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 6575 states and 16634 transitions. [2018-12-02 08:58:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:12,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:12,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:12,082 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:12,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1937307839, now seen corresponding path program 2 times [2018-12-02 08:58:12,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:12,116 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 08:58:12,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:12,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:12,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:12,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:12,117 INFO L87 Difference]: Start difference. First operand 6575 states and 16634 transitions. Second operand 5 states. [2018-12-02 08:58:12,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:12,319 INFO L93 Difference]: Finished difference Result 7494 states and 18734 transitions. [2018-12-02 08:58:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:12,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-02 08:58:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:12,325 INFO L225 Difference]: With dead ends: 7494 [2018-12-02 08:58:12,325 INFO L226 Difference]: Without dead ends: 7466 [2018-12-02 08:58:12,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2018-12-02 08:58:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7045. [2018-12-02 08:58:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7045 states. [2018-12-02 08:58:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 17683 transitions. [2018-12-02 08:58:12,380 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 17683 transitions. Word has length 107 [2018-12-02 08:58:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:12,380 INFO L480 AbstractCegarLoop]: Abstraction has 7045 states and 17683 transitions. [2018-12-02 08:58:12,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 17683 transitions. [2018-12-02 08:58:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:12,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:12,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:12,386 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:12,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash -243074712, now seen corresponding path program 1 times [2018-12-02 08:58:12,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:58:12,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:12,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:12,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:12,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:12,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:12,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:12,418 INFO L87 Difference]: Start difference. First operand 7045 states and 17683 transitions. Second operand 4 states. [2018-12-02 08:58:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:12,605 INFO L93 Difference]: Finished difference Result 10125 states and 24913 transitions. [2018-12-02 08:58:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:12,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 08:58:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:12,613 INFO L225 Difference]: With dead ends: 10125 [2018-12-02 08:58:12,613 INFO L226 Difference]: Without dead ends: 10039 [2018-12-02 08:58:12,613 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 08:58:12,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-12-02 08:58:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 7655. [2018-12-02 08:58:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7655 states. [2018-12-02 08:58:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7655 states to 7655 states and 19220 transitions. [2018-12-02 08:58:12,680 INFO L78 Accepts]: Start accepts. Automaton has 7655 states and 19220 transitions. Word has length 107 [2018-12-02 08:58:12,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 7655 states and 19220 transitions. [2018-12-02 08:58:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7655 states and 19220 transitions. [2018-12-02 08:58:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 08:58:12,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:12,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:12,687 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:12,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:12,687 INFO L82 PathProgramCache]: Analyzing trace with hash 630903886, now seen corresponding path program 2 times [2018-12-02 08:58:12,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:12,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:12,727 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 08:58:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:58:12,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:12,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:58:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:58:12,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:12,728 INFO L87 Difference]: Start difference. First operand 7655 states and 19220 transitions. Second operand 4 states. [2018-12-02 08:58:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:12,822 INFO L93 Difference]: Finished difference Result 8379 states and 20869 transitions. [2018-12-02 08:58:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:58:12,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-02 08:58:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:12,828 INFO L225 Difference]: With dead ends: 8379 [2018-12-02 08:58:12,828 INFO L226 Difference]: Without dead ends: 8379 [2018-12-02 08:58:12,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:58:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8379 states. [2018-12-02 08:58:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8379 to 7448. [2018-12-02 08:58:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7448 states. [2018-12-02 08:58:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7448 states to 7448 states and 18747 transitions. [2018-12-02 08:58:12,888 INFO L78 Accepts]: Start accepts. Automaton has 7448 states and 18747 transitions. Word has length 107 [2018-12-02 08:58:12,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:12,888 INFO L480 AbstractCegarLoop]: Abstraction has 7448 states and 18747 transitions. [2018-12-02 08:58:12,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:58:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 7448 states and 18747 transitions. [2018-12-02 08:58:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:12,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:12,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:12,894 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:12,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:12,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1075946824, now seen corresponding path program 1 times [2018-12-02 08:58:12,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:58:12,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:12,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:12,988 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 08:58:12,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:12,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:12,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:12,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:12,989 INFO L87 Difference]: Start difference. First operand 7448 states and 18747 transitions. Second operand 7 states. [2018-12-02 08:58:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:13,164 INFO L93 Difference]: Finished difference Result 10201 states and 24982 transitions. [2018-12-02 08:58:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:13,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 08:58:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:13,172 INFO L225 Difference]: With dead ends: 10201 [2018-12-02 08:58:13,172 INFO L226 Difference]: Without dead ends: 10139 [2018-12-02 08:58:13,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:58:13,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10139 states. [2018-12-02 08:58:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10139 to 8356. [2018-12-02 08:58:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2018-12-02 08:58:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 20810 transitions. [2018-12-02 08:58:13,250 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 20810 transitions. Word has length 109 [2018-12-02 08:58:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:13,250 INFO L480 AbstractCegarLoop]: Abstraction has 8356 states and 20810 transitions. [2018-12-02 08:58:13,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 20810 transitions. [2018-12-02 08:58:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:13,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:13,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:13,257 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:13,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1742083243, now seen corresponding path program 1 times [2018-12-02 08:58:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:13,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:13,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:13,320 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 08:58:13,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:13,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:13,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:13,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:13,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:13,321 INFO L87 Difference]: Start difference. First operand 8356 states and 20810 transitions. Second operand 6 states. [2018-12-02 08:58:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:13,580 INFO L93 Difference]: Finished difference Result 10882 states and 26909 transitions. [2018-12-02 08:58:13,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:58:13,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 08:58:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:13,588 INFO L225 Difference]: With dead ends: 10882 [2018-12-02 08:58:13,588 INFO L226 Difference]: Without dead ends: 10850 [2018-12-02 08:58:13,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 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 08:58:13,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10850 states. [2018-12-02 08:58:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10850 to 9028. [2018-12-02 08:58:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2018-12-02 08:58:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 22586 transitions. [2018-12-02 08:58:13,667 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 22586 transitions. Word has length 109 [2018-12-02 08:58:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:13,667 INFO L480 AbstractCegarLoop]: Abstraction has 9028 states and 22586 transitions. [2018-12-02 08:58:13,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 22586 transitions. [2018-12-02 08:58:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:13,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:13,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:13,674 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:13,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash -780469226, now seen corresponding path program 1 times [2018-12-02 08:58:13,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:13,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:13,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:13,715 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 08:58:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:13,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:13,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:13,716 INFO L87 Difference]: Start difference. First operand 9028 states and 22586 transitions. Second operand 7 states. [2018-12-02 08:58:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:14,127 INFO L93 Difference]: Finished difference Result 10375 states and 25186 transitions. [2018-12-02 08:58:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:58:14,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 08:58:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:14,134 INFO L225 Difference]: With dead ends: 10375 [2018-12-02 08:58:14,134 INFO L226 Difference]: Without dead ends: 10324 [2018-12-02 08:58:14,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-02 08:58:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10324 states. [2018-12-02 08:58:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10324 to 7480. [2018-12-02 08:58:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2018-12-02 08:58:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 18543 transitions. [2018-12-02 08:58:14,200 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 18543 transitions. Word has length 109 [2018-12-02 08:58:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:14,200 INFO L480 AbstractCegarLoop]: Abstraction has 7480 states and 18543 transitions. [2018-12-02 08:58:14,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:14,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 18543 transitions. [2018-12-02 08:58:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:14,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:14,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:14,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:14,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash 794061016, now seen corresponding path program 1 times [2018-12-02 08:58:14,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:14,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:14,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:14,268 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 08:58:14,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:14,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:14,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:14,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:14,269 INFO L87 Difference]: Start difference. First operand 7480 states and 18543 transitions. Second operand 6 states. [2018-12-02 08:58:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:14,574 INFO L93 Difference]: Finished difference Result 9766 states and 23963 transitions. [2018-12-02 08:58:14,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:14,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 08:58:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:14,582 INFO L225 Difference]: With dead ends: 9766 [2018-12-02 08:58:14,582 INFO L226 Difference]: Without dead ends: 9716 [2018-12-02 08:58:14,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 08:58:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9716 states. [2018-12-02 08:58:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9716 to 8036. [2018-12-02 08:58:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8036 states. [2018-12-02 08:58:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8036 states to 8036 states and 19861 transitions. [2018-12-02 08:58:14,652 INFO L78 Accepts]: Start accepts. Automaton has 8036 states and 19861 transitions. Word has length 109 [2018-12-02 08:58:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:14,653 INFO L480 AbstractCegarLoop]: Abstraction has 8036 states and 19861 transitions. [2018-12-02 08:58:14,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8036 states and 19861 transitions. [2018-12-02 08:58:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:14,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:14,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:14,659 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:14,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1959966231, now seen corresponding path program 1 times [2018-12-02 08:58:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:14,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:14,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:14,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:14,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:14,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:14,737 INFO L87 Difference]: Start difference. First operand 8036 states and 19861 transitions. Second operand 7 states. [2018-12-02 08:58:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:15,140 INFO L93 Difference]: Finished difference Result 10719 states and 26153 transitions. [2018-12-02 08:58:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:58:15,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 08:58:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:15,148 INFO L225 Difference]: With dead ends: 10719 [2018-12-02 08:58:15,148 INFO L226 Difference]: Without dead ends: 10687 [2018-12-02 08:58:15,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:58:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10687 states. [2018-12-02 08:58:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10687 to 8137. [2018-12-02 08:58:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8137 states. [2018-12-02 08:58:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8137 states to 8137 states and 19939 transitions. [2018-12-02 08:58:15,223 INFO L78 Accepts]: Start accepts. Automaton has 8137 states and 19939 transitions. Word has length 109 [2018-12-02 08:58:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:15,223 INFO L480 AbstractCegarLoop]: Abstraction has 8137 states and 19939 transitions. [2018-12-02 08:58:15,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8137 states and 19939 transitions. [2018-12-02 08:58:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:15,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:15,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:15,230 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:15,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:15,230 INFO L82 PathProgramCache]: Analyzing trace with hash -128622567, now seen corresponding path program 1 times [2018-12-02 08:58:15,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:15,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:58:15,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:15,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:15,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:15,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:15,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:15,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:15,301 INFO L87 Difference]: Start difference. First operand 8137 states and 19939 transitions. Second operand 7 states. [2018-12-02 08:58:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:15,406 INFO L93 Difference]: Finished difference Result 11592 states and 28999 transitions. [2018-12-02 08:58:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:15,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-02 08:58:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:15,414 INFO L225 Difference]: With dead ends: 11592 [2018-12-02 08:58:15,415 INFO L226 Difference]: Without dead ends: 11592 [2018-12-02 08:58:15,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11592 states. [2018-12-02 08:58:15,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11592 to 8361. [2018-12-02 08:58:15,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8361 states. [2018-12-02 08:58:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 20435 transitions. [2018-12-02 08:58:15,488 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 20435 transitions. Word has length 109 [2018-12-02 08:58:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:15,488 INFO L480 AbstractCegarLoop]: Abstraction has 8361 states and 20435 transitions. [2018-12-02 08:58:15,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 20435 transitions. [2018-12-02 08:58:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:15,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:15,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:15,494 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:15,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:15,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2064282854, now seen corresponding path program 1 times [2018-12-02 08:58:15,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:15,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:15,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:15,553 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 08:58:15,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:15,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:15,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:15,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:15,554 INFO L87 Difference]: Start difference. First operand 8361 states and 20435 transitions. Second operand 5 states. [2018-12-02 08:58:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:15,590 INFO L93 Difference]: Finished difference Result 10140 states and 24867 transitions. [2018-12-02 08:58:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 08:58:15,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-02 08:58:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:15,601 INFO L225 Difference]: With dead ends: 10140 [2018-12-02 08:58:15,601 INFO L226 Difference]: Without dead ends: 10140 [2018-12-02 08:58:15,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 08:58:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10140 states. [2018-12-02 08:58:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10140 to 6625. [2018-12-02 08:58:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-12-02 08:58:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 15846 transitions. [2018-12-02 08:58:15,688 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 15846 transitions. Word has length 109 [2018-12-02 08:58:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:15,688 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 15846 transitions. [2018-12-02 08:58:15,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 15846 transitions. [2018-12-02 08:58:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 08:58:15,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:15,693 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:15,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:15,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1583566438, now seen corresponding path program 1 times [2018-12-02 08:58:15,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:15,747 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 08:58:15,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:15,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 08:58:15,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:15,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:58:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:58:15,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:58:15,748 INFO L87 Difference]: Start difference. First operand 6625 states and 15846 transitions. Second operand 6 states. [2018-12-02 08:58:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:15,863 INFO L93 Difference]: Finished difference Result 6417 states and 15118 transitions. [2018-12-02 08:58:15,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:15,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-02 08:58:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:15,868 INFO L225 Difference]: With dead ends: 6417 [2018-12-02 08:58:15,868 INFO L226 Difference]: Without dead ends: 6417 [2018-12-02 08:58:15,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:58:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6417 states. [2018-12-02 08:58:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6417 to 5048. [2018-12-02 08:58:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5048 states. [2018-12-02 08:58:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 12047 transitions. [2018-12-02 08:58:15,910 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 12047 transitions. Word has length 109 [2018-12-02 08:58:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:15,910 INFO L480 AbstractCegarLoop]: Abstraction has 5048 states and 12047 transitions. [2018-12-02 08:58:15,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:58:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 12047 transitions. [2018-12-02 08:58:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 08:58:15,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:15,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:15,914 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:15,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:15,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1006730931, now seen corresponding path program 1 times [2018-12-02 08:58:15,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:15,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:15,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:15,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:15,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 08:58:15,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:15,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:15,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:15,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:15,965 INFO L87 Difference]: Start difference. First operand 5048 states and 12047 transitions. Second operand 7 states. [2018-12-02 08:58:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:16,370 INFO L93 Difference]: Finished difference Result 9022 states and 20749 transitions. [2018-12-02 08:58:16,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 08:58:16,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 08:58:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:16,376 INFO L225 Difference]: With dead ends: 9022 [2018-12-02 08:58:16,376 INFO L226 Difference]: Without dead ends: 8990 [2018-12-02 08:58:16,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 08:58:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2018-12-02 08:58:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 6491. [2018-12-02 08:58:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6491 states. [2018-12-02 08:58:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 15317 transitions. [2018-12-02 08:58:16,433 INFO L78 Accepts]: Start accepts. Automaton has 6491 states and 15317 transitions. Word has length 111 [2018-12-02 08:58:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:16,433 INFO L480 AbstractCegarLoop]: Abstraction has 6491 states and 15317 transitions. [2018-12-02 08:58:16,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6491 states and 15317 transitions. [2018-12-02 08:58:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 08:58:16,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:16,438 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:16,438 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:16,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:16,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2043471884, now seen corresponding path program 1 times [2018-12-02 08:58:16,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:16,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:16,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:16,491 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 08:58:16,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:16,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 08:58:16,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:16,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 08:58:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 08:58:16,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:16,492 INFO L87 Difference]: Start difference. First operand 6491 states and 15317 transitions. Second operand 7 states. [2018-12-02 08:58:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:16,711 INFO L93 Difference]: Finished difference Result 7559 states and 17484 transitions. [2018-12-02 08:58:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 08:58:16,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 08:58:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:16,716 INFO L225 Difference]: With dead ends: 7559 [2018-12-02 08:58:16,716 INFO L226 Difference]: Without dead ends: 7559 [2018-12-02 08:58:16,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 08:58:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2018-12-02 08:58:16,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 6563. [2018-12-02 08:58:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6563 states. [2018-12-02 08:58:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 15457 transitions. [2018-12-02 08:58:16,766 INFO L78 Accepts]: Start accepts. Automaton has 6563 states and 15457 transitions. Word has length 111 [2018-12-02 08:58:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:16,767 INFO L480 AbstractCegarLoop]: Abstraction has 6563 states and 15457 transitions. [2018-12-02 08:58:16,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 08:58:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6563 states and 15457 transitions. [2018-12-02 08:58:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 08:58:16,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:16,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:16,771 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:16,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1336496692, now seen corresponding path program 1 times [2018-12-02 08:58:16,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:16,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:16,821 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 08:58:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:16,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:16,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:16,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:16,822 INFO L87 Difference]: Start difference. First operand 6563 states and 15457 transitions. Second operand 5 states. [2018-12-02 08:58:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:16,939 INFO L93 Difference]: Finished difference Result 6915 states and 16321 transitions. [2018-12-02 08:58:16,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:16,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 08:58:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:16,944 INFO L225 Difference]: With dead ends: 6915 [2018-12-02 08:58:16,944 INFO L226 Difference]: Without dead ends: 6883 [2018-12-02 08:58:16,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2018-12-02 08:58:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5869. [2018-12-02 08:58:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5869 states. [2018-12-02 08:58:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5869 states to 5869 states and 13792 transitions. [2018-12-02 08:58:16,992 INFO L78 Accepts]: Start accepts. Automaton has 5869 states and 13792 transitions. Word has length 111 [2018-12-02 08:58:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:16,993 INFO L480 AbstractCegarLoop]: Abstraction has 5869 states and 13792 transitions. [2018-12-02 08:58:16,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5869 states and 13792 transitions. [2018-12-02 08:58:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 08:58:16,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:16,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:16,997 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:16,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1713706123, now seen corresponding path program 1 times [2018-12-02 08:58:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:16,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:17,047 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 08:58:17,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:17,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:58:17,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:17,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 08:58:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 08:58:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:58:17,048 INFO L87 Difference]: Start difference. First operand 5869 states and 13792 transitions. Second operand 5 states. [2018-12-02 08:58:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:17,189 INFO L93 Difference]: Finished difference Result 7113 states and 16468 transitions. [2018-12-02 08:58:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:58:17,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 08:58:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:17,193 INFO L225 Difference]: With dead ends: 7113 [2018-12-02 08:58:17,193 INFO L226 Difference]: Without dead ends: 7113 [2018-12-02 08:58:17,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 08:58:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7113 states. [2018-12-02 08:58:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7113 to 5460. [2018-12-02 08:58:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5460 states. [2018-12-02 08:58:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 12829 transitions. [2018-12-02 08:58:17,234 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 12829 transitions. Word has length 111 [2018-12-02 08:58:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:17,234 INFO L480 AbstractCegarLoop]: Abstraction has 5460 states and 12829 transitions. [2018-12-02 08:58:17,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 08:58:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 12829 transitions. [2018-12-02 08:58:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 08:58:17,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:17,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:17,238 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:17,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2089905766, now seen corresponding path program 1 times [2018-12-02 08:58:17,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:17,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:17,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:58:17,314 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 08:58:17,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:58:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 08:58:17,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:58:17,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 08:58:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 08:58:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 08:58:17,315 INFO L87 Difference]: Start difference. First operand 5460 states and 12829 transitions. Second operand 10 states. [2018-12-02 08:58:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:58:17,557 INFO L93 Difference]: Finished difference Result 8124 states and 19634 transitions. [2018-12-02 08:58:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 08:58:17,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-02 08:58:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:58:17,559 INFO L225 Difference]: With dead ends: 8124 [2018-12-02 08:58:17,559 INFO L226 Difference]: Without dead ends: 2456 [2018-12-02 08:58:17,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2018-12-02 08:58:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2018-12-02 08:58:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2018-12-02 08:58:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2456 states. [2018-12-02 08:58:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 6129 transitions. [2018-12-02 08:58:17,582 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 6129 transitions. Word has length 113 [2018-12-02 08:58:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:58:17,582 INFO L480 AbstractCegarLoop]: Abstraction has 2456 states and 6129 transitions. [2018-12-02 08:58:17,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 08:58:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 6129 transitions. [2018-12-02 08:58:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 08:58:17,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:58:17,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:58:17,584 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:58:17,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:58:17,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1447618370, now seen corresponding path program 2 times [2018-12-02 08:58:17,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:58:17,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:17,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:58:17,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:58:17,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:58:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:58:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:58:17,646 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:58:17,720 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 08:58:17,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:58:17 BasicIcfg [2018-12-02 08:58:17,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:58:17,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:58:17,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:58:17,721 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:58:17,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:57:50" (3/4) ... [2018-12-02 08:58:17,723 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 08:58:17,798 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d844f2d2-a6ac-4971-b67d-533ef814cdba/bin-2019/utaipan/witness.graphml [2018-12-02 08:58:17,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:58:17,799 INFO L168 Benchmark]: Toolchain (without parser) took 28170.87 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 951.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,800 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:58:17,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,800 INFO L168 Benchmark]: Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,800 INFO L168 Benchmark]: RCFGBuilder took 462.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,801 INFO L168 Benchmark]: TraceAbstraction took 27134.41 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,801 INFO L168 Benchmark]: Witness Printer took 77.33 ms. Allocated memory is still 4.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:58:17,802 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 434.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 462.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27134.41 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 77.33 ms. Allocated memory is still 4.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 38.8 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] -1 pthread_t t1721; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] FCALL, FORK -1 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t1722; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$w_buff1 = y$w_buff0 [L722] 0 y$w_buff0 = 2 [L723] 0 y$w_buff1_used = y$w_buff0_used [L724] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L727] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L728] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L729] 0 y$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 y$flush_delayed = weak$$choice2 [L735] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 0 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L742] EXPR 0 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 y = y$flush_delayed ? y$mem_tmp : y [L745] 0 y$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L701] 1 x = 1 [L704] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1] [L707] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L708] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L753] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L754] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L782] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L783] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 y$flush_delayed = weak$$choice2 [L792] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L794] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L795] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L796] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y = y$flush_delayed ? y$mem_tmp : y [L802] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 27.0s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10045 SDtfs, 9806 SDslu, 21404 SDs, 0 SdLazy, 8571 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 280 GetRequests, 75 SyntacticMatches, 28 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 199624 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2877 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2735 ConstructedInterpolants, 0 QuantifiedInterpolants, 604887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...