./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/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 161431ae511029eac1804f53f2ab38c8cf6e5b8e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:01:21,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 19:01:21,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 19:01:21,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 19:01:21,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 19:01:21,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 19:01:21,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 19:01:21,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 19:01:21,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 19:01:21,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 19:01:21,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 19:01:21,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 19:01:21,241 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 19:01:21,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 19:01:21,242 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 19:01:21,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 19:01:21,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 19:01:21,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 19:01:21,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 19:01:21,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 19:01:21,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 19:01:21,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 19:01:21,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 19:01:21,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 19:01:21,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 19:01:21,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 19:01:21,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 19:01:21,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 19:01:21,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 19:01:21,251 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 19:01:21,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 19:01:21,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 19:01:21,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 19:01:21,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 19:01:21,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 19:01:21,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 19:01:21,252 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 19:01:21,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 19:01:21,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 19:01:21,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 19:01:21,260 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 19:01:21,260 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 19:01:21,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 19:01:21,261 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 19:01:21,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 19:01:21,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 19:01:21,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:01:21,263 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 19:01:21,263 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 19:01:21,264 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_3137f350-6054-4ebe-80ca-67f7ab3e8376/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 -> 161431ae511029eac1804f53f2ab38c8cf6e5b8e [2018-12-02 19:01:21,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 19:01:21,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 19:01:21,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 19:01:21,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 19:01:21,290 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 19:01:21,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_false-unreach-call.i [2018-12-02 19:01:21,326 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/data/8ff1ff09d/a5d15bbcde234a64baaea72140ddf13b/FLAG36db0d79e [2018-12-02 19:01:21,727 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 19:01:21,728 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_false-unreach-call.i [2018-12-02 19:01:21,735 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/data/8ff1ff09d/a5d15bbcde234a64baaea72140ddf13b/FLAG36db0d79e [2018-12-02 19:01:22,069 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/data/8ff1ff09d/a5d15bbcde234a64baaea72140ddf13b [2018-12-02 19:01:22,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 19:01:22,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 19:01:22,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 19:01:22,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 19:01:22,074 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 19:01:22,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf327e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22, skipping insertion in model container [2018-12-02 19:01:22,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 19:01:22,114 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 19:01:22,321 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:01:22,328 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 19:01:22,399 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:01:22,428 INFO L195 MainTranslator]: Completed translation [2018-12-02 19:01:22,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22 WrapperNode [2018-12-02 19:01:22,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 19:01:22,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 19:01:22,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 19:01:22,429 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 19:01:22,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 19:01:22,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 19:01:22,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 19:01:22,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 19:01:22,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... [2018-12-02 19:01:22,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 19:01:22,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 19:01:22,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 19:01:22,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 19:01:22,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/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 19:01:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 19:01:22,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 19:01:22,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 19:01:22,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 19:01:22,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 19:01:22,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 19:01:22,515 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 19:01:22,816 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 19:01:22,816 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 19:01:22,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:22 BoogieIcfgContainer [2018-12-02 19:01:22,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 19:01:22,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 19:01:22,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 19:01:22,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 19:01:22,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:01:22" (1/3) ... [2018-12-02 19:01:22,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3ad0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:01:22, skipping insertion in model container [2018-12-02 19:01:22,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:22" (2/3) ... [2018-12-02 19:01:22,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3ad0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:01:22, skipping insertion in model container [2018-12-02 19:01:22,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:22" (3/3) ... [2018-12-02 19:01:22,821 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_false-unreach-call.i [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,843 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,844 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,845 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,846 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,847 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,848 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,849 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,850 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:01:22,853 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 19:01:22,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 19:01:22,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 19:01:22,867 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 19:01:22,882 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 19:01:22,882 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 19:01:22,882 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 19:01:22,882 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 19:01:22,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 19:01:22,883 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 19:01:22,883 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 19:01:22,883 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 19:01:22,889 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 19:01:23,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-02 19:01:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-02 19:01:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 19:01:23,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:23,822 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] [2018-12-02 19:01:23,824 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:23,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:23,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-02 19:01:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:23,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:23,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:23,978 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 19:01:23,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:23,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:23,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:23,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:23,994 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-02 19:01:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:24,324 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-02 19:01:24,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:24,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 19:01:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:24,490 INFO L225 Difference]: With dead ends: 45389 [2018-12-02 19:01:24,490 INFO L226 Difference]: Without dead ends: 40629 [2018-12-02 19:01:24,491 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 19:01:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-02 19:01:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-02 19:01:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 19:01:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-02 19:01:25,164 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-02 19:01:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:25,165 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-02 19:01:25,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-02 19:01:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 19:01:25,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:25,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] [2018-12-02 19:01:25,168 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:25,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-02 19:01:25,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:25,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:25,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:25,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:25,207 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 19:01:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:25,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 19:01:25,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:25,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:01:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:01:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:01:25,209 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-02 19:01:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:25,350 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-02 19:01:25,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:01:25,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 19:01:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:25,402 INFO L225 Difference]: With dead ends: 23663 [2018-12-02 19:01:25,402 INFO L226 Difference]: Without dead ends: 23663 [2018-12-02 19:01:25,403 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 19:01:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-02 19:01:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-02 19:01:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 19:01:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-02 19:01:25,840 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-02 19:01:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:25,840 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-02 19:01:25,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:01:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-02 19:01:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 19:01:25,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:25,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:01:25,842 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:25,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-02 19:01:25,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:25,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:25,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:25,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:25,890 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 19:01:25,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:25,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:25,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:25,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:25,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:25,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:25,890 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-02 19:01:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:26,449 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-02 19:01:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:01:26,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 19:01:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:26,573 INFO L225 Difference]: With dead ends: 64831 [2018-12-02 19:01:26,573 INFO L226 Difference]: Without dead ends: 64671 [2018-12-02 19:01:26,573 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 19:01:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-02 19:01:27,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-02 19:01:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 19:01:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-02 19:01:27,337 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-02 19:01:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:27,338 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-02 19:01:27,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-02 19:01:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 19:01:27,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:27,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:01:27,341 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:27,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-02 19:01:27,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:27,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:27,371 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 19:01:27,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:27,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 19:01:27,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:27,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 19:01:27,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 19:01:27,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 19:01:27,373 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-02 19:01:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:27,620 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-02 19:01:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 19:01:27,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 19:01:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:27,683 INFO L225 Difference]: With dead ends: 37143 [2018-12-02 19:01:27,683 INFO L226 Difference]: Without dead ends: 37143 [2018-12-02 19:01:27,683 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 19:01:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-02 19:01:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-02 19:01:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 19:01:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-02 19:01:28,237 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-02 19:01:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:28,238 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-02 19:01:28,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 19:01:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-02 19:01:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 19:01:28,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:28,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:01:28,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:28,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1106347019, now seen corresponding path program 1 times [2018-12-02 19:01:28,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:28,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:28,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:28,282 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 19:01:28,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:28,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:28,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:28,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:28,283 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 4 states. [2018-12-02 19:01:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:28,334 INFO L93 Difference]: Finished difference Result 12365 states and 41168 transitions. [2018-12-02 19:01:28,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:01:28,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 19:01:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:28,350 INFO L225 Difference]: With dead ends: 12365 [2018-12-02 19:01:28,350 INFO L226 Difference]: Without dead ends: 11844 [2018-12-02 19:01:28,350 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 19:01:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-02 19:01:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-02 19:01:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-02 19:01:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39616 transitions. [2018-12-02 19:01:28,572 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39616 transitions. Word has length 46 [2018-12-02 19:01:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:28,572 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39616 transitions. [2018-12-02 19:01:28,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39616 transitions. [2018-12-02 19:01:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 19:01:28,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:28,575 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] [2018-12-02 19:01:28,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:28,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash 597708037, now seen corresponding path program 1 times [2018-12-02 19:01:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:28,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:28,619 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 19:01:28,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:28,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:28,620 INFO L87 Difference]: Start difference. First operand 11844 states and 39616 transitions. Second operand 4 states. [2018-12-02 19:01:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:28,769 INFO L93 Difference]: Finished difference Result 17020 states and 55692 transitions. [2018-12-02 19:01:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:01:28,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 19:01:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:28,791 INFO L225 Difference]: With dead ends: 17020 [2018-12-02 19:01:28,791 INFO L226 Difference]: Without dead ends: 17020 [2018-12-02 19:01:28,791 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 19:01:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-02 19:01:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-02 19:01:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-02 19:01:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42719 transitions. [2018-12-02 19:01:28,949 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42719 transitions. Word has length 59 [2018-12-02 19:01:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:28,949 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42719 transitions. [2018-12-02 19:01:28,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42719 transitions. [2018-12-02 19:01:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 19:01:28,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:28,952 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] [2018-12-02 19:01:28,952 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:28,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:28,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1954448924, now seen corresponding path program 1 times [2018-12-02 19:01:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:28,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:28,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 19:01:28,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:28,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:28,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:28,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:28,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:28,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:28,989 INFO L87 Difference]: Start difference. First operand 12880 states and 42719 transitions. Second operand 4 states. [2018-12-02 19:01:29,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:29,674 INFO L93 Difference]: Finished difference Result 18387 states and 59996 transitions. [2018-12-02 19:01:29,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:01:29,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 19:01:29,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:29,701 INFO L225 Difference]: With dead ends: 18387 [2018-12-02 19:01:29,701 INFO L226 Difference]: Without dead ends: 18387 [2018-12-02 19:01:29,701 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 19:01:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18387 states. [2018-12-02 19:01:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18387 to 16344. [2018-12-02 19:01:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2018-12-02 19:01:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 53813 transitions. [2018-12-02 19:01:29,886 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 53813 transitions. Word has length 59 [2018-12-02 19:01:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:29,887 INFO L480 AbstractCegarLoop]: Abstraction has 16344 states and 53813 transitions. [2018-12-02 19:01:29,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 53813 transitions. [2018-12-02 19:01:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 19:01:29,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:29,891 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] [2018-12-02 19:01:29,891 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:29,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -601139227, now seen corresponding path program 1 times [2018-12-02 19:01:29,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:29,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:29,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:29,935 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 19:01:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:29,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:29,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:29,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:29,935 INFO L87 Difference]: Start difference. First operand 16344 states and 53813 transitions. Second operand 5 states. [2018-12-02 19:01:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:29,974 INFO L93 Difference]: Finished difference Result 2852 states and 7522 transitions. [2018-12-02 19:01:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:01:29,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-02 19:01:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:29,976 INFO L225 Difference]: With dead ends: 2852 [2018-12-02 19:01:29,977 INFO L226 Difference]: Without dead ends: 2352 [2018-12-02 19:01:29,977 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 19:01:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2018-12-02 19:01:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2245. [2018-12-02 19:01:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2018-12-02 19:01:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 5897 transitions. [2018-12-02 19:01:29,992 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 5897 transitions. Word has length 59 [2018-12-02 19:01:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 2245 states and 5897 transitions. [2018-12-02 19:01:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 5897 transitions. [2018-12-02 19:01:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 19:01:29,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:29,995 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] [2018-12-02 19:01:29,995 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:29,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash -226906360, now seen corresponding path program 1 times [2018-12-02 19:01:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:29,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:29,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,030 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 19:01:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:30,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:30,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:30,031 INFO L87 Difference]: Start difference. First operand 2245 states and 5897 transitions. Second operand 4 states. [2018-12-02 19:01:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:30,120 INFO L93 Difference]: Finished difference Result 2767 states and 7108 transitions. [2018-12-02 19:01:30,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:30,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 19:01:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:30,122 INFO L225 Difference]: With dead ends: 2767 [2018-12-02 19:01:30,123 INFO L226 Difference]: Without dead ends: 2739 [2018-12-02 19:01:30,123 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 19:01:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2018-12-02 19:01:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2382. [2018-12-02 19:01:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2018-12-02 19:01:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 6202 transitions. [2018-12-02 19:01:30,141 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 6202 transitions. Word has length 92 [2018-12-02 19:01:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:30,141 INFO L480 AbstractCegarLoop]: Abstraction has 2382 states and 6202 transitions. [2018-12-02 19:01:30,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 6202 transitions. [2018-12-02 19:01:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 19:01:30,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:30,144 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] [2018-12-02 19:01:30,144 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:30,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:30,145 INFO L82 PathProgramCache]: Analyzing trace with hash 742674663, now seen corresponding path program 1 times [2018-12-02 19:01:30,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:30,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,178 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 19:01:30,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:30,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:30,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:30,179 INFO L87 Difference]: Start difference. First operand 2382 states and 6202 transitions. Second operand 4 states. [2018-12-02 19:01:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:30,307 INFO L93 Difference]: Finished difference Result 3290 states and 8632 transitions. [2018-12-02 19:01:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:30,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 19:01:30,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:30,310 INFO L225 Difference]: With dead ends: 3290 [2018-12-02 19:01:30,310 INFO L226 Difference]: Without dead ends: 3290 [2018-12-02 19:01:30,310 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 19:01:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2018-12-02 19:01:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2263. [2018-12-02 19:01:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-12-02 19:01:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 5847 transitions. [2018-12-02 19:01:30,329 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 5847 transitions. Word has length 92 [2018-12-02 19:01:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:30,329 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 5847 transitions. [2018-12-02 19:01:30,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 5847 transitions. [2018-12-02 19:01:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 19:01:30,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:30,331 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] [2018-12-02 19:01:30,331 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:30,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash 6831737, now seen corresponding path program 2 times [2018-12-02 19:01:30,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,375 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 19:01:30,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:30,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:30,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:30,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:30,375 INFO L87 Difference]: Start difference. First operand 2263 states and 5847 transitions. Second operand 5 states. [2018-12-02 19:01:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:30,496 INFO L93 Difference]: Finished difference Result 2653 states and 6764 transitions. [2018-12-02 19:01:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:01:30,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 19:01:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:30,498 INFO L225 Difference]: With dead ends: 2653 [2018-12-02 19:01:30,498 INFO L226 Difference]: Without dead ends: 2625 [2018-12-02 19:01:30,499 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 19:01:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2018-12-02 19:01:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2256. [2018-12-02 19:01:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2018-12-02 19:01:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 5823 transitions. [2018-12-02 19:01:30,516 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 5823 transitions. Word has length 92 [2018-12-02 19:01:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:30,516 INFO L480 AbstractCegarLoop]: Abstraction has 2256 states and 5823 transitions. [2018-12-02 19:01:30,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 5823 transitions. [2018-12-02 19:01:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:30,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:30,519 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] [2018-12-02 19:01:30,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:30,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1380045558, now seen corresponding path program 1 times [2018-12-02 19:01:30,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:01:30,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,561 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 19:01:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:30,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:30,562 INFO L87 Difference]: Start difference. First operand 2256 states and 5823 transitions. Second operand 4 states. [2018-12-02 19:01:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:30,639 INFO L93 Difference]: Finished difference Result 4123 states and 10774 transitions. [2018-12-02 19:01:30,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:30,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 19:01:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:30,642 INFO L225 Difference]: With dead ends: 4123 [2018-12-02 19:01:30,642 INFO L226 Difference]: Without dead ends: 4095 [2018-12-02 19:01:30,642 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 19:01:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2018-12-02 19:01:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 2182. [2018-12-02 19:01:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-12-02 19:01:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 5597 transitions. [2018-12-02 19:01:30,661 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 5597 transitions. Word has length 94 [2018-12-02 19:01:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:30,662 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 5597 transitions. [2018-12-02 19:01:30,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 5597 transitions. [2018-12-02 19:01:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:30,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:30,663 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] [2018-12-02 19:01:30,664 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:30,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1050279797, now seen corresponding path program 1 times [2018-12-02 19:01:30,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:30,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,709 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 19:01:30,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:01:30,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:01:30,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:01:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:01:30,710 INFO L87 Difference]: Start difference. First operand 2182 states and 5597 transitions. Second operand 6 states. [2018-12-02 19:01:30,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:30,919 INFO L93 Difference]: Finished difference Result 2496 states and 6214 transitions. [2018-12-02 19:01:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:01:30,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 19:01:30,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:30,922 INFO L225 Difference]: With dead ends: 2496 [2018-12-02 19:01:30,922 INFO L226 Difference]: Without dead ends: 2425 [2018-12-02 19:01:30,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:01:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2018-12-02 19:01:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2336. [2018-12-02 19:01:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-12-02 19:01:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 5899 transitions. [2018-12-02 19:01:30,938 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 5899 transitions. Word has length 94 [2018-12-02 19:01:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:30,938 INFO L480 AbstractCegarLoop]: Abstraction has 2336 states and 5899 transitions. [2018-12-02 19:01:30,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:01:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 5899 transitions. [2018-12-02 19:01:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:30,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:30,940 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] [2018-12-02 19:01:30,941 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:30,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:30,941 INFO L82 PathProgramCache]: Analyzing trace with hash 650460682, now seen corresponding path program 1 times [2018-12-02 19:01:30,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:30,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:30,997 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 19:01:30,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:30,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:01:30,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:30,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 19:01:30,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 19:01:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:01:30,998 INFO L87 Difference]: Start difference. First operand 2336 states and 5899 transitions. Second operand 7 states. [2018-12-02 19:01:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:31,124 INFO L93 Difference]: Finished difference Result 2551 states and 6435 transitions. [2018-12-02 19:01:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:01:31,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 19:01:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:31,127 INFO L225 Difference]: With dead ends: 2551 [2018-12-02 19:01:31,127 INFO L226 Difference]: Without dead ends: 2551 [2018-12-02 19:01:31,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:01:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2018-12-02 19:01:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2315. [2018-12-02 19:01:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-12-02 19:01:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 5859 transitions. [2018-12-02 19:01:31,143 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 5859 transitions. Word has length 94 [2018-12-02 19:01:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:31,143 INFO L480 AbstractCegarLoop]: Abstraction has 2315 states and 5859 transitions. [2018-12-02 19:01:31,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 19:01:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 5859 transitions. [2018-12-02 19:01:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:31,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:31,145 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] [2018-12-02 19:01:31,145 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:31,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2061340202, now seen corresponding path program 1 times [2018-12-02 19:01:31,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:31,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:31,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:31,186 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 19:01:31,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:31,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:31,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:31,187 INFO L87 Difference]: Start difference. First operand 2315 states and 5859 transitions. Second operand 5 states. [2018-12-02 19:01:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:31,318 INFO L93 Difference]: Finished difference Result 4184 states and 10826 transitions. [2018-12-02 19:01:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:01:31,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 19:01:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:31,322 INFO L225 Difference]: With dead ends: 4184 [2018-12-02 19:01:31,322 INFO L226 Difference]: Without dead ends: 4158 [2018-12-02 19:01:31,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:01:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2018-12-02 19:01:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 2369. [2018-12-02 19:01:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2369 states. [2018-12-02 19:01:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 5982 transitions. [2018-12-02 19:01:31,347 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 5982 transitions. Word has length 94 [2018-12-02 19:01:31,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:31,347 INFO L480 AbstractCegarLoop]: Abstraction has 2369 states and 5982 transitions. [2018-12-02 19:01:31,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 5982 transitions. [2018-12-02 19:01:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:31,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:31,350 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] [2018-12-02 19:01:31,350 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:31,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1443186967, now seen corresponding path program 1 times [2018-12-02 19:01:31,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:31,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:31,408 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 19:01:31,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:31,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:31,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:31,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:31,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:31,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:31,410 INFO L87 Difference]: Start difference. First operand 2369 states and 5982 transitions. Second operand 5 states. [2018-12-02 19:01:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:31,492 INFO L93 Difference]: Finished difference Result 2077 states and 5250 transitions. [2018-12-02 19:01:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:31,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 19:01:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:31,495 INFO L225 Difference]: With dead ends: 2077 [2018-12-02 19:01:31,495 INFO L226 Difference]: Without dead ends: 2077 [2018-12-02 19:01:31,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:01:31,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2018-12-02 19:01:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 1989. [2018-12-02 19:01:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-02 19:01:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5068 transitions. [2018-12-02 19:01:31,517 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5068 transitions. Word has length 94 [2018-12-02 19:01:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:31,517 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5068 transitions. [2018-12-02 19:01:31,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5068 transitions. [2018-12-02 19:01:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:31,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:31,519 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] [2018-12-02 19:01:31,520 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:31,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1220650390, now seen corresponding path program 1 times [2018-12-02 19:01:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:31,602 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 19:01:31,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:31,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:01:31,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:31,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:01:31,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:01:31,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:01:31,603 INFO L87 Difference]: Start difference. First operand 1989 states and 5068 transitions. Second operand 4 states. [2018-12-02 19:01:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:31,677 INFO L93 Difference]: Finished difference Result 2325 states and 5988 transitions. [2018-12-02 19:01:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 19:01:31,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 19:01:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:31,679 INFO L225 Difference]: With dead ends: 2325 [2018-12-02 19:01:31,679 INFO L226 Difference]: Without dead ends: 2325 [2018-12-02 19:01:31,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 19:01:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-02 19:01:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2018-12-02 19:01:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-02 19:01:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-02 19:01:31,694 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-02 19:01:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:31,694 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-02 19:01:31,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:01:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-02 19:01:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 19:01:31,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:31,696 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] [2018-12-02 19:01:31,696 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:31,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:31,696 INFO L82 PathProgramCache]: Analyzing trace with hash 997107563, now seen corresponding path program 1 times [2018-12-02 19:01:31,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:31,770 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 19:01:31,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:31,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:01:31,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:31,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:01:31,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:01:31,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:01:31,772 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-02 19:01:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:31,838 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-02 19:01:31,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:01:31,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 19:01:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:31,840 INFO L225 Difference]: With dead ends: 2005 [2018-12-02 19:01:31,841 INFO L226 Difference]: Without dead ends: 2005 [2018-12-02 19:01:31,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:01:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-02 19:01:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-02 19:01:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-02 19:01:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-02 19:01:31,853 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-02 19:01:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:31,853 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-02 19:01:31,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:01:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-02 19:01:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:31,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:31,855 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] [2018-12-02 19:01:31,855 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:31,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:31,855 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-02 19:01:31,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:31,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:31,908 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 19:01:31,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 19:01:31,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:31,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:01:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:01:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:01:31,909 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-02 19:01:32,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:32,243 INFO L93 Difference]: Finished difference Result 4730 states and 12191 transitions. [2018-12-02 19:01:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 19:01:32,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 19:01:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:32,247 INFO L225 Difference]: With dead ends: 4730 [2018-12-02 19:01:32,247 INFO L226 Difference]: Without dead ends: 4730 [2018-12-02 19:01:32,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-02 19:01:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-02 19:01:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2396. [2018-12-02 19:01:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2018-12-02 19:01:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 6085 transitions. [2018-12-02 19:01:32,270 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 6085 transitions. Word has length 96 [2018-12-02 19:01:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:32,270 INFO L480 AbstractCegarLoop]: Abstraction has 2396 states and 6085 transitions. [2018-12-02 19:01:32,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:01:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 6085 transitions. [2018-12-02 19:01:32,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:32,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:32,272 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] [2018-12-02 19:01:32,272 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:32,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:32,272 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-02 19:01:32,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:32,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:32,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 19:01:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:32,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:32,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:32,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:32,321 INFO L87 Difference]: Start difference. First operand 2396 states and 6085 transitions. Second operand 5 states. [2018-12-02 19:01:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:32,341 INFO L93 Difference]: Finished difference Result 4125 states and 10700 transitions. [2018-12-02 19:01:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:01:32,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 19:01:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:32,344 INFO L225 Difference]: With dead ends: 4125 [2018-12-02 19:01:32,344 INFO L226 Difference]: Without dead ends: 4125 [2018-12-02 19:01:32,344 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 19:01:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2018-12-02 19:01:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2333. [2018-12-02 19:01:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2018-12-02 19:01:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 5892 transitions. [2018-12-02 19:01:32,365 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 5892 transitions. Word has length 96 [2018-12-02 19:01:32,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:32,365 INFO L480 AbstractCegarLoop]: Abstraction has 2333 states and 5892 transitions. [2018-12-02 19:01:32,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 5892 transitions. [2018-12-02 19:01:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:32,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:32,367 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] [2018-12-02 19:01:32,367 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:32,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:32,368 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-02 19:01:32,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:32,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:32,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:32,424 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 19:01:32,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:32,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:01:32,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:32,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:01:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:01:32,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:01:32,425 INFO L87 Difference]: Start difference. First operand 2333 states and 5892 transitions. Second operand 5 states. [2018-12-02 19:01:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:32,535 INFO L93 Difference]: Finished difference Result 2653 states and 6692 transitions. [2018-12-02 19:01:32,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:01:32,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 19:01:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:32,537 INFO L225 Difference]: With dead ends: 2653 [2018-12-02 19:01:32,537 INFO L226 Difference]: Without dead ends: 2653 [2018-12-02 19:01:32,538 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 19:01:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2018-12-02 19:01:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2081. [2018-12-02 19:01:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-12-02 19:01:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 5265 transitions. [2018-12-02 19:01:32,553 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 5265 transitions. Word has length 96 [2018-12-02 19:01:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:32,554 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 5265 transitions. [2018-12-02 19:01:32,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:01:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 5265 transitions. [2018-12-02 19:01:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:32,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:32,555 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] [2018-12-02 19:01:32,556 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:32,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:32,556 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-02 19:01:32,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:32,638 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 19:01:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 19:01:32,638 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:32,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 19:01:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 19:01:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 19:01:32,639 INFO L87 Difference]: Start difference. First operand 2081 states and 5265 transitions. Second operand 10 states. [2018-12-02 19:01:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:32,885 INFO L93 Difference]: Finished difference Result 3834 states and 9903 transitions. [2018-12-02 19:01:32,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 19:01:32,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-02 19:01:32,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:32,887 INFO L225 Difference]: With dead ends: 3834 [2018-12-02 19:01:32,887 INFO L226 Difference]: Without dead ends: 1799 [2018-12-02 19:01:32,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 19:01:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-02 19:01:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-02 19:01:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-02 19:01:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-02 19:01:32,899 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-02 19:01:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:32,899 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-02 19:01:32,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 19:01:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-02 19:01:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:32,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:32,900 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] [2018-12-02 19:01:32,900 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:32,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-02 19:01:32,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:01:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:32,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:01:33,001 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 19:01:33,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:01:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 19:01:33,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:01:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 19:01:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 19:01:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:01:33,002 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-02 19:01:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:01:33,320 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-02 19:01:33,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 19:01:33,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 19:01:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:01:33,322 INFO L225 Difference]: With dead ends: 3406 [2018-12-02 19:01:33,323 INFO L226 Difference]: Without dead ends: 2430 [2018-12-02 19:01:33,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 19:01:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-02 19:01:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-02 19:01:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-02 19:01:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-02 19:01:33,340 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-02 19:01:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:01:33,340 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-02 19:01:33,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 19:01:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-02 19:01:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 19:01:33,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:01:33,342 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] [2018-12-02 19:01:33,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:01:33,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:01:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-02 19:01:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:01:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:33,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:01:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:01:33,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:01:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:01:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 19:01:33,387 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 19:01:33,478 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 19:01:33,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:01:33 BasicIcfg [2018-12-02 19:01:33,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 19:01:33,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 19:01:33,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 19:01:33,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 19:01:33,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:22" (3/4) ... [2018-12-02 19:01:33,482 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 19:01:33,573 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3137f350-6054-4ebe-80ca-67f7ab3e8376/bin-2019/utaipan/witness.graphml [2018-12-02 19:01:33,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 19:01:33,574 INFO L168 Benchmark]: Toolchain (without parser) took 11502.34 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -349.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,575 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:01:33,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.38 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,576 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,576 INFO L168 Benchmark]: RCFGBuilder took 335.95 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,576 INFO L168 Benchmark]: TraceAbstraction took 10662.11 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -262.8 MB). Peak memory consumption was 992.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,576 INFO L168 Benchmark]: Witness Printer took 93.56 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-02 19:01:33,578 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.38 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.22 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 335.95 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10662.11 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -262.8 MB). Peak memory consumption was 992.3 MB. Max. memory is 11.5 GB. * Witness Printer took 93.56 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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] [L697] -1 int z = 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, 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, z=0] [L698] -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, z=0] [L699] -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, z=0] [L765] -1 pthread_t t1605; 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, z=0] [L766] FCALL, FORK -1 pthread_create(&t1605, ((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, z=0] [L767] -1 pthread_t t1606; 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, z=0] [L768] FCALL, FORK -1 pthread_create(&t1606, ((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, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 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, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=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, z=1] [L743] 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=1, __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=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, z=1] [L703] 1 x = 1 [L706] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L743] 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) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L709] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 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 [L709] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 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) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L747] 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 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L711] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L711] 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 [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L713] 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 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L774] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L774] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L774] -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) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L776] -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 [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] 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=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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, z=1] [L778] -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 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] [L785] 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=1, __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, z=1] [L785] -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) [L786] 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=1, __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, z=1] [L786] -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)) [L787] 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=1, __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, z=1] [L787] -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)) [L788] 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=1, __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, z=1] [L788] -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)) [L789] 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=1, __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, z=1] [L789] -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)) [L790] 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=1, __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, z=1] [L790] -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)) [L791] 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=1, __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, z=1] [L791] -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)) [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 10.6s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5062 SDtfs, 4722 SDslu, 10164 SDs, 0 SdLazy, 3612 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 66 SyntacticMatches, 17 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 61871 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1907 NumberOfCodeBlocks, 1907 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1788 ConstructedInterpolants, 0 QuantifiedInterpolants, 342920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...