./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042_pso.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_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/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 1e70765932d5ecd399058d3d0c5f33de11a7a07e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 19:10:32,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:10:32,530 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:10:32,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:10:32,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:10:32,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:10:32,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:10:32,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:10:32,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:10:32,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:10:32,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:10:32,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:10:32,544 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:10:32,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:10:32,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:10:32,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:10:32,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:10:32,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:10:32,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:10:32,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:10:32,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:10:32,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:10:32,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:10:32,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:10:32,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:10:32,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:10:32,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:10:32,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:10:32,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:10:32,558 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:10:32,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:10:32,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:10:32,559 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:10:32,559 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:10:32,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:10:32,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:10:32,560 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:10:32,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:10:32,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:10:32,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:10:32,571 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:10:32,571 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:10:32,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:10:32,572 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:10:32,573 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:10:32,573 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:10:32,574 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:10:32,574 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:10:32,575 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:10:32,575 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:10:32,575 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_7919a2c3-92d2-4f85-933e-471e60868ae0/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 -> 1e70765932d5ecd399058d3d0c5f33de11a7a07e [2018-12-09 19:10:32,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:10:32,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:10:32,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:10:32,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:10:32,612 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:10:32,612 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-12-09 19:10:32,657 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/data/4736bdc1d/9e26ef04620746fca148c770c7e7d561/FLAG1579d890c [2018-12-09 19:10:33,013 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:10:33,013 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/sv-benchmarks/c/pthread-wmm/mix042_pso.opt_false-unreach-call.i [2018-12-09 19:10:33,020 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/data/4736bdc1d/9e26ef04620746fca148c770c7e7d561/FLAG1579d890c [2018-12-09 19:10:33,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/data/4736bdc1d/9e26ef04620746fca148c770c7e7d561 [2018-12-09 19:10:33,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:10:33,032 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:10:33,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:33,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:10:33,034 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:10:33,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33, skipping insertion in model container [2018-12-09 19:10:33,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:10:33,064 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:10:33,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:33,275 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:10:33,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:33,368 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:10:33,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33 WrapperNode [2018-12-09 19:10:33,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:33,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:33,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:10:33,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:10:33,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:33,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:10:33,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:10:33,403 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:10:33,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... [2018-12-09 19:10:33,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:10:33,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:10:33,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:10:33,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:10:33,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/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-09 19:10:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:10:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:10:33,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:10:33,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:10:33,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 19:10:33,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:10:33,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:10:33,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:10:33,459 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:10:33,786 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:10:33,786 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:10:33,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:33 BoogieIcfgContainer [2018-12-09 19:10:33,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:10:33,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:10:33,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:10:33,789 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:10:33,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:10:33" (1/3) ... [2018-12-09 19:10:33,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a56e0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:33, skipping insertion in model container [2018-12-09 19:10:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:33" (2/3) ... [2018-12-09 19:10:33,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a56e0fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:33, skipping insertion in model container [2018-12-09 19:10:33,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:33" (3/3) ... [2018-12-09 19:10:33,791 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt_false-unreach-call.i [2018-12-09 19:10:33,812 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,813 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,814 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,815 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,816 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,817 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,819 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,820 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:10:33,825 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:10:33,825 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:10:33,832 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:10:33,845 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:10:33,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:10:33,864 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:10:33,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:10:33,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:10:33,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:10:33,865 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:10:33,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:10:33,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:10:33,875 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158places, 195 transitions [2018-12-09 19:10:47,195 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128915 states. [2018-12-09 19:10:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 128915 states. [2018-12-09 19:10:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:10:47,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:47,207 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-09 19:10:47,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:47,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:47,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1862294190, now seen corresponding path program 1 times [2018-12-09 19:10:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:47,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:47,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:47,385 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-09 19:10:47,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:47,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:47,387 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:47,400 INFO L87 Difference]: Start difference. First operand 128915 states. Second operand 4 states. [2018-12-09 19:10:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:48,594 INFO L93 Difference]: Finished difference Result 233475 states and 1098327 transitions. [2018-12-09 19:10:48,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:48,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 19:10:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:50,953 INFO L225 Difference]: With dead ends: 233475 [2018-12-09 19:10:50,953 INFO L226 Difference]: Without dead ends: 203725 [2018-12-09 19:10:50,955 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-09 19:10:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203725 states. [2018-12-09 19:10:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203725 to 118895. [2018-12-09 19:10:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118895 states. [2018-12-09 19:10:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118895 states to 118895 states and 559778 transitions. [2018-12-09 19:10:54,303 INFO L78 Accepts]: Start accepts. Automaton has 118895 states and 559778 transitions. Word has length 46 [2018-12-09 19:10:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:54,304 INFO L480 AbstractCegarLoop]: Abstraction has 118895 states and 559778 transitions. [2018-12-09 19:10:54,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 118895 states and 559778 transitions. [2018-12-09 19:10:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 19:10:54,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:54,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:54,311 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:54,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1986059105, now seen corresponding path program 1 times [2018-12-09 19:10:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:54,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:54,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:54,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:54,362 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-09 19:10:54,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:10:54,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:54,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:10:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:10:54,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:10:54,364 INFO L87 Difference]: Start difference. First operand 118895 states and 559778 transitions. Second operand 5 states. [2018-12-09 19:10:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:56,335 INFO L93 Difference]: Finished difference Result 325275 states and 1470482 transitions. [2018-12-09 19:10:56,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:10:56,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 19:10:56,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:57,227 INFO L225 Difference]: With dead ends: 325275 [2018-12-09 19:10:57,227 INFO L226 Difference]: Without dead ends: 324275 [2018-12-09 19:10:57,227 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-09 19:11:01,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324275 states. [2018-12-09 19:11:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324275 to 186425. [2018-12-09 19:11:04,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186425 states. [2018-12-09 19:11:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186425 states to 186425 states and 842877 transitions. [2018-12-09 19:11:04,576 INFO L78 Accepts]: Start accepts. Automaton has 186425 states and 842877 transitions. Word has length 53 [2018-12-09 19:11:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:04,576 INFO L480 AbstractCegarLoop]: Abstraction has 186425 states and 842877 transitions. [2018-12-09 19:11:04,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 186425 states and 842877 transitions. [2018-12-09 19:11:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:11:04,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:04,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:04,583 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:04,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:04,583 INFO L82 PathProgramCache]: Analyzing trace with hash 713101365, now seen corresponding path program 1 times [2018-12-09 19:11:04,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:04,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:04,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:04,632 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-09 19:11:04,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:04,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:04,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:04,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:04,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:04,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:04,633 INFO L87 Difference]: Start difference. First operand 186425 states and 842877 transitions. Second operand 4 states. [2018-12-09 19:11:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:05,319 INFO L93 Difference]: Finished difference Result 163601 states and 727065 transitions. [2018-12-09 19:11:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:11:05,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 19:11:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:05,719 INFO L225 Difference]: With dead ends: 163601 [2018-12-09 19:11:05,719 INFO L226 Difference]: Without dead ends: 160996 [2018-12-09 19:11:05,719 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-09 19:11:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-09 19:11:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-09 19:11:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-09 19:11:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718378 transitions. [2018-12-09 19:11:11,882 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718378 transitions. Word has length 54 [2018-12-09 19:11:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:11,882 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718378 transitions. [2018-12-09 19:11:11,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718378 transitions. [2018-12-09 19:11:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:11:11,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:11,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:11,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:11,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1719723521, now seen corresponding path program 1 times [2018-12-09 19:11:11,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:11,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:11,931 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-09 19:11:11,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:11,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:11:11,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:11,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:11:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:11:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:11,932 INFO L87 Difference]: Start difference. First operand 160996 states and 718378 transitions. Second operand 3 states. [2018-12-09 19:11:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:12,627 INFO L93 Difference]: Finished difference Result 160996 states and 718281 transitions. [2018-12-09 19:11:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:11:12,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-09 19:11:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:13,030 INFO L225 Difference]: With dead ends: 160996 [2018-12-09 19:11:13,030 INFO L226 Difference]: Without dead ends: 160996 [2018-12-09 19:11:13,030 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-09 19:11:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160996 states. [2018-12-09 19:11:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160996 to 160996. [2018-12-09 19:11:15,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160996 states. [2018-12-09 19:11:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160996 states to 160996 states and 718281 transitions. [2018-12-09 19:11:16,421 INFO L78 Accepts]: Start accepts. Automaton has 160996 states and 718281 transitions. Word has length 55 [2018-12-09 19:11:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:16,421 INFO L480 AbstractCegarLoop]: Abstraction has 160996 states and 718281 transitions. [2018-12-09 19:11:16,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:11:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 160996 states and 718281 transitions. [2018-12-09 19:11:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:11:16,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:16,426 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] [2018-12-09 19:11:16,426 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:16,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash -832433440, now seen corresponding path program 1 times [2018-12-09 19:11:16,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:16,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:16,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:16,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:16,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:16,460 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-09 19:11:16,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:16,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:16,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:16,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:16,461 INFO L87 Difference]: Start difference. First operand 160996 states and 718281 transitions. Second operand 5 states. [2018-12-09 19:11:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:17,830 INFO L93 Difference]: Finished difference Result 289852 states and 1287334 transitions. [2018-12-09 19:11:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:11:17,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-09 19:11:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:20,888 INFO L225 Difference]: With dead ends: 289852 [2018-12-09 19:11:20,889 INFO L226 Difference]: Without dead ends: 289012 [2018-12-09 19:11:20,889 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-09 19:11:21,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289012 states. [2018-12-09 19:11:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289012 to 169616. [2018-12-09 19:11:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169616 states. [2018-12-09 19:11:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169616 states to 169616 states and 753934 transitions. [2018-12-09 19:11:25,113 INFO L78 Accepts]: Start accepts. Automaton has 169616 states and 753934 transitions. Word has length 55 [2018-12-09 19:11:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:25,114 INFO L480 AbstractCegarLoop]: Abstraction has 169616 states and 753934 transitions. [2018-12-09 19:11:25,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 169616 states and 753934 transitions. [2018-12-09 19:11:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:11:25,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:25,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:25,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:25,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 771366836, now seen corresponding path program 1 times [2018-12-09 19:11:25,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:25,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:25,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:25,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:25,182 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-09 19:11:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:25,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:11:25,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:25,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:11:25,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:11:25,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:11:25,183 INFO L87 Difference]: Start difference. First operand 169616 states and 753934 transitions. Second operand 5 states. [2018-12-09 19:11:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:25,400 INFO L93 Difference]: Finished difference Result 59120 states and 239414 transitions. [2018-12-09 19:11:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:11:25,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-09 19:11:25,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:25,512 INFO L225 Difference]: With dead ends: 59120 [2018-12-09 19:11:25,512 INFO L226 Difference]: Without dead ends: 56808 [2018-12-09 19:11:25,512 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-09 19:11:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56808 states. [2018-12-09 19:11:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56808 to 56808. [2018-12-09 19:11:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56808 states. [2018-12-09 19:11:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56808 states to 56808 states and 230752 transitions. [2018-12-09 19:11:26,318 INFO L78 Accepts]: Start accepts. Automaton has 56808 states and 230752 transitions. Word has length 62 [2018-12-09 19:11:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:26,319 INFO L480 AbstractCegarLoop]: Abstraction has 56808 states and 230752 transitions. [2018-12-09 19:11:26,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:11:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56808 states and 230752 transitions. [2018-12-09 19:11:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:11:26,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:26,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:26,328 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:26,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1566863536, now seen corresponding path program 1 times [2018-12-09 19:11:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:26,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:26,382 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-09 19:11:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:26,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:26,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:26,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:26,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:26,382 INFO L87 Difference]: Start difference. First operand 56808 states and 230752 transitions. Second operand 4 states. [2018-12-09 19:11:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:26,758 INFO L93 Difference]: Finished difference Result 78972 states and 316077 transitions. [2018-12-09 19:11:26,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:11:26,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 19:11:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:27,087 INFO L225 Difference]: With dead ends: 78972 [2018-12-09 19:11:27,087 INFO L226 Difference]: Without dead ends: 78972 [2018-12-09 19:11:27,087 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-09 19:11:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78972 states. [2018-12-09 19:11:27,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78972 to 61564. [2018-12-09 19:11:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61564 states. [2018-12-09 19:11:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61564 states to 61564 states and 248445 transitions. [2018-12-09 19:11:27,982 INFO L78 Accepts]: Start accepts. Automaton has 61564 states and 248445 transitions. Word has length 68 [2018-12-09 19:11:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 61564 states and 248445 transitions. [2018-12-09 19:11:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 61564 states and 248445 transitions. [2018-12-09 19:11:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:11:27,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:27,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:27,995 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:27,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash -985293425, now seen corresponding path program 1 times [2018-12-09 19:11:27,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:27,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:11:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:28,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:28,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:28,044 INFO L87 Difference]: Start difference. First operand 61564 states and 248445 transitions. Second operand 4 states. [2018-12-09 19:11:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:28,635 INFO L93 Difference]: Finished difference Result 85639 states and 341495 transitions. [2018-12-09 19:11:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:11:28,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 19:11:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:28,809 INFO L225 Difference]: With dead ends: 85639 [2018-12-09 19:11:28,809 INFO L226 Difference]: Without dead ends: 85639 [2018-12-09 19:11:28,809 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-09 19:11:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85639 states. [2018-12-09 19:11:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85639 to 77176. [2018-12-09 19:11:29,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77176 states. [2018-12-09 19:11:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77176 states to 77176 states and 309674 transitions. [2018-12-09 19:11:30,095 INFO L78 Accepts]: Start accepts. Automaton has 77176 states and 309674 transitions. Word has length 68 [2018-12-09 19:11:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:30,095 INFO L480 AbstractCegarLoop]: Abstraction has 77176 states and 309674 transitions. [2018-12-09 19:11:30,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 77176 states and 309674 transitions. [2018-12-09 19:11:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:11:30,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:30,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:30,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:30,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash 368016272, now seen corresponding path program 1 times [2018-12-09 19:11:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:30,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:30,182 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-09 19:11:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:30,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:30,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:30,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:30,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:30,183 INFO L87 Difference]: Start difference. First operand 77176 states and 309674 transitions. Second operand 6 states. [2018-12-09 19:11:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:30,674 INFO L93 Difference]: Finished difference Result 83796 states and 332727 transitions. [2018-12-09 19:11:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:11:30,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 19:11:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:30,833 INFO L225 Difference]: With dead ends: 83796 [2018-12-09 19:11:30,833 INFO L226 Difference]: Without dead ends: 83796 [2018-12-09 19:11:30,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:11:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83796 states. [2018-12-09 19:11:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83796 to 79534. [2018-12-09 19:11:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79534 states. [2018-12-09 19:11:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79534 states to 79534 states and 317786 transitions. [2018-12-09 19:11:32,129 INFO L78 Accepts]: Start accepts. Automaton has 79534 states and 317786 transitions. Word has length 68 [2018-12-09 19:11:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:32,129 INFO L480 AbstractCegarLoop]: Abstraction has 79534 states and 317786 transitions. [2018-12-09 19:11:32,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 79534 states and 317786 transitions. [2018-12-09 19:11:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:11:32,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:32,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] [2018-12-09 19:11:32,145 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:32,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 74613265, now seen corresponding path program 1 times [2018-12-09 19:11:32,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:32,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:32,196 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-09 19:11:32,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:32,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:32,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:32,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:32,197 INFO L87 Difference]: Start difference. First operand 79534 states and 317786 transitions. Second operand 6 states. [2018-12-09 19:11:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:32,857 INFO L93 Difference]: Finished difference Result 102078 states and 405346 transitions. [2018-12-09 19:11:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:11:32,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 19:11:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:33,068 INFO L225 Difference]: With dead ends: 102078 [2018-12-09 19:11:33,068 INFO L226 Difference]: Without dead ends: 101918 [2018-12-09 19:11:33,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:11:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101918 states. [2018-12-09 19:11:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101918 to 78062. [2018-12-09 19:11:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78062 states. [2018-12-09 19:11:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78062 states to 78062 states and 311818 transitions. [2018-12-09 19:11:34,479 INFO L78 Accepts]: Start accepts. Automaton has 78062 states and 311818 transitions. Word has length 68 [2018-12-09 19:11:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 78062 states and 311818 transitions. [2018-12-09 19:11:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78062 states and 311818 transitions. [2018-12-09 19:11:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:34,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:34,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:34,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:34,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -156146652, now seen corresponding path program 1 times [2018-12-09 19:11:34,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:34,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:34,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:34,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:34,589 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-09 19:11:34,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:34,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:34,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:34,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:34,590 INFO L87 Difference]: Start difference. First operand 78062 states and 311818 transitions. Second operand 4 states. [2018-12-09 19:11:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:35,281 INFO L93 Difference]: Finished difference Result 123918 states and 488650 transitions. [2018-12-09 19:11:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:11:35,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-09 19:11:35,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:35,541 INFO L225 Difference]: With dead ends: 123918 [2018-12-09 19:11:35,541 INFO L226 Difference]: Without dead ends: 123102 [2018-12-09 19:11:35,541 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-09 19:11:35,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123102 states. [2018-12-09 19:11:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123102 to 105182. [2018-12-09 19:11:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105182 states. [2018-12-09 19:11:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105182 states to 105182 states and 418466 transitions. [2018-12-09 19:11:37,418 INFO L78 Accepts]: Start accepts. Automaton has 105182 states and 418466 transitions. Word has length 82 [2018-12-09 19:11:37,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:37,418 INFO L480 AbstractCegarLoop]: Abstraction has 105182 states and 418466 transitions. [2018-12-09 19:11:37,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:11:37,418 INFO L276 IsEmpty]: Start isEmpty. Operand 105182 states and 418466 transitions. [2018-12-09 19:11:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:37,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:37,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:37,495 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:37,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1197163045, now seen corresponding path program 1 times [2018-12-09 19:11:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:37,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:37,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:37,554 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-09 19:11:37,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:37,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:11:37,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:37,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:11:37,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:11:37,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:11:37,555 INFO L87 Difference]: Start difference. First operand 105182 states and 418466 transitions. Second operand 6 states. [2018-12-09 19:11:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:38,549 INFO L93 Difference]: Finished difference Result 186559 states and 733507 transitions. [2018-12-09 19:11:38,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:11:38,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 19:11:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:38,958 INFO L225 Difference]: With dead ends: 186559 [2018-12-09 19:11:38,958 INFO L226 Difference]: Without dead ends: 185535 [2018-12-09 19:11:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:11:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185535 states. [2018-12-09 19:11:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185535 to 163343. [2018-12-09 19:11:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163343 states. [2018-12-09 19:11:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163343 states to 163343 states and 647995 transitions. [2018-12-09 19:11:42,221 INFO L78 Accepts]: Start accepts. Automaton has 163343 states and 647995 transitions. Word has length 82 [2018-12-09 19:11:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:42,221 INFO L480 AbstractCegarLoop]: Abstraction has 163343 states and 647995 transitions. [2018-12-09 19:11:42,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:11:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 163343 states and 647995 transitions. [2018-12-09 19:11:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 19:11:42,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:42,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:42,345 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:42,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash 903760038, now seen corresponding path program 1 times [2018-12-09 19:11:42,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:42,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:42,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:42,401 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-09 19:11:42,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:42,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:11:42,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:42,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:11:42,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:11:42,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:11:42,402 INFO L87 Difference]: Start difference. First operand 163343 states and 647995 transitions. Second operand 7 states. [2018-12-09 19:11:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:43,509 INFO L93 Difference]: Finished difference Result 193359 states and 763483 transitions. [2018-12-09 19:11:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 19:11:43,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 19:11:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:43,939 INFO L225 Difference]: With dead ends: 193359 [2018-12-09 19:11:43,939 INFO L226 Difference]: Without dead ends: 193039 [2018-12-09 19:11:43,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:11:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193039 states. [2018-12-09 19:11:46,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193039 to 172719. [2018-12-09 19:11:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172719 states. [2018-12-09 19:11:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172719 states to 172719 states and 683659 transitions. [2018-12-09 19:11:47,382 INFO L78 Accepts]: Start accepts. Automaton has 172719 states and 683659 transitions. Word has length 82 [2018-12-09 19:11:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:47,382 INFO L480 AbstractCegarLoop]: Abstraction has 172719 states and 683659 transitions. [2018-12-09 19:11:47,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:11:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 172719 states and 683659 transitions. [2018-12-09 19:11:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 19:11:47,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:47,545 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] [2018-12-09 19:11:47,546 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:47,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1937162966, now seen corresponding path program 1 times [2018-12-09 19:11:47,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:47,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:47,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:47,568 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-09 19:11:47,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:11:47,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:11:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:11:47,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:11:47,569 INFO L87 Difference]: Start difference. First operand 172719 states and 683659 transitions. Second operand 3 states. [2018-12-09 19:11:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:48,426 INFO L93 Difference]: Finished difference Result 202495 states and 793283 transitions. [2018-12-09 19:11:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:11:48,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-12-09 19:11:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:48,907 INFO L225 Difference]: With dead ends: 202495 [2018-12-09 19:11:48,908 INFO L226 Difference]: Without dead ends: 202495 [2018-12-09 19:11:48,908 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-09 19:11:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202495 states. [2018-12-09 19:11:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202495 to 179711. [2018-12-09 19:11:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179711 states. [2018-12-09 19:11:52,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179711 states to 179711 states and 708787 transitions. [2018-12-09 19:11:52,300 INFO L78 Accepts]: Start accepts. Automaton has 179711 states and 708787 transitions. Word has length 84 [2018-12-09 19:11:52,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:52,300 INFO L480 AbstractCegarLoop]: Abstraction has 179711 states and 708787 transitions. [2018-12-09 19:11:52,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:11:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 179711 states and 708787 transitions. [2018-12-09 19:11:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 19:11:52,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:52,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:52,497 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:52,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1547781004, now seen corresponding path program 1 times [2018-12-09 19:11:52,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:52,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:52,575 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-09 19:11:52,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:11:52,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:52,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:11:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:11:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:11:52,576 INFO L87 Difference]: Start difference. First operand 179711 states and 708787 transitions. Second operand 10 states. [2018-12-09 19:11:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:11:54,729 INFO L93 Difference]: Finished difference Result 227791 states and 882395 transitions. [2018-12-09 19:11:54,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 19:11:54,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-12-09 19:11:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:11:55,246 INFO L225 Difference]: With dead ends: 227791 [2018-12-09 19:11:55,246 INFO L226 Difference]: Without dead ends: 227471 [2018-12-09 19:11:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 19:11:55,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227471 states. [2018-12-09 19:11:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227471 to 182463. [2018-12-09 19:11:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182463 states. [2018-12-09 19:11:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182463 states to 182463 states and 717107 transitions. [2018-12-09 19:11:58,951 INFO L78 Accepts]: Start accepts. Automaton has 182463 states and 717107 transitions. Word has length 88 [2018-12-09 19:11:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:11:58,951 INFO L480 AbstractCegarLoop]: Abstraction has 182463 states and 717107 transitions. [2018-12-09 19:11:58,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:11:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 182463 states and 717107 transitions. [2018-12-09 19:11:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 19:11:59,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:11:59,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:11:59,163 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:11:59,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:11:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 386837655, now seen corresponding path program 1 times [2018-12-09 19:11:59,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:11:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:59,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:11:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:11:59,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:11:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:11:59,205 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-09 19:11:59,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:11:59,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:11:59,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:11:59,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:11:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:11:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:11:59,206 INFO L87 Difference]: Start difference. First operand 182463 states and 717107 transitions. Second operand 4 states. [2018-12-09 19:12:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:00,232 INFO L93 Difference]: Finished difference Result 211365 states and 823407 transitions. [2018-12-09 19:12:00,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:12:00,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-09 19:12:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:00,728 INFO L225 Difference]: With dead ends: 211365 [2018-12-09 19:12:00,728 INFO L226 Difference]: Without dead ends: 210661 [2018-12-09 19:12:00,728 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-09 19:12:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210661 states. [2018-12-09 19:12:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210661 to 203621. [2018-12-09 19:12:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203621 states. [2018-12-09 19:12:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203621 states to 203621 states and 795519 transitions. [2018-12-09 19:12:05,870 INFO L78 Accepts]: Start accepts. Automaton has 203621 states and 795519 transitions. Word has length 90 [2018-12-09 19:12:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:05,870 INFO L480 AbstractCegarLoop]: Abstraction has 203621 states and 795519 transitions. [2018-12-09 19:12:05,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:12:05,870 INFO L276 IsEmpty]: Start isEmpty. Operand 203621 states and 795519 transitions. [2018-12-09 19:12:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 19:12:06,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:06,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:06,102 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:06,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:06,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1548822632, now seen corresponding path program 1 times [2018-12-09 19:12:06,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:06,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:06,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:06,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:06,123 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-09 19:12:06,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:06,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:12:06,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:06,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:12:06,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:12:06,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:12:06,124 INFO L87 Difference]: Start difference. First operand 203621 states and 795519 transitions. Second operand 3 states. [2018-12-09 19:12:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:07,404 INFO L93 Difference]: Finished difference Result 214893 states and 837979 transitions. [2018-12-09 19:12:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:12:07,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-09 19:12:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:07,902 INFO L225 Difference]: With dead ends: 214893 [2018-12-09 19:12:07,902 INFO L226 Difference]: Without dead ends: 214893 [2018-12-09 19:12:07,902 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-09 19:12:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214893 states. [2018-12-09 19:12:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214893 to 209409. [2018-12-09 19:12:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209409 states. [2018-12-09 19:12:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209409 states to 209409 states and 817287 transitions. [2018-12-09 19:12:11,611 INFO L78 Accepts]: Start accepts. Automaton has 209409 states and 817287 transitions. Word has length 90 [2018-12-09 19:12:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:11,611 INFO L480 AbstractCegarLoop]: Abstraction has 209409 states and 817287 transitions. [2018-12-09 19:12:11,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:12:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 209409 states and 817287 transitions. [2018-12-09 19:12:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:12:11,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:11,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:11,839 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:11,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1760831503, now seen corresponding path program 1 times [2018-12-09 19:12:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:11,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:11,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:11,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:11,892 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-09 19:12:11,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:11,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:11,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:11,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:11,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:11,893 INFO L87 Difference]: Start difference. First operand 209409 states and 817287 transitions. Second operand 6 states. [2018-12-09 19:12:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:11,987 INFO L93 Difference]: Finished difference Result 27473 states and 91695 transitions. [2018-12-09 19:12:11,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:11,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 19:12:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:12,016 INFO L225 Difference]: With dead ends: 27473 [2018-12-09 19:12:12,017 INFO L226 Difference]: Without dead ends: 23817 [2018-12-09 19:12:12,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:12:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23817 states. [2018-12-09 19:12:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23817 to 22672. [2018-12-09 19:12:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22672 states. [2018-12-09 19:12:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22672 states to 22672 states and 75834 transitions. [2018-12-09 19:12:12,255 INFO L78 Accepts]: Start accepts. Automaton has 22672 states and 75834 transitions. Word has length 91 [2018-12-09 19:12:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:12,255 INFO L480 AbstractCegarLoop]: Abstraction has 22672 states and 75834 transitions. [2018-12-09 19:12:12,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:12,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22672 states and 75834 transitions. [2018-12-09 19:12:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 19:12:12,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:12,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:12,273 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2116233828, now seen corresponding path program 1 times [2018-12-09 19:12:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:12,319 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-09 19:12:12,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:12,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:12,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:12,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:12,320 INFO L87 Difference]: Start difference. First operand 22672 states and 75834 transitions. Second operand 5 states. [2018-12-09 19:12:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:12,504 INFO L93 Difference]: Finished difference Result 25406 states and 84381 transitions. [2018-12-09 19:12:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:12:12,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-09 19:12:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:12,535 INFO L225 Difference]: With dead ends: 25406 [2018-12-09 19:12:12,535 INFO L226 Difference]: Without dead ends: 25266 [2018-12-09 19:12:12,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:12:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25266 states. [2018-12-09 19:12:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25266 to 22807. [2018-12-09 19:12:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22807 states. [2018-12-09 19:12:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22807 states to 22807 states and 76222 transitions. [2018-12-09 19:12:12,778 INFO L78 Accepts]: Start accepts. Automaton has 22807 states and 76222 transitions. Word has length 101 [2018-12-09 19:12:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:12,778 INFO L480 AbstractCegarLoop]: Abstraction has 22807 states and 76222 transitions. [2018-12-09 19:12:12,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 22807 states and 76222 transitions. [2018-12-09 19:12:12,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:12:12,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:12,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:12,796 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:12,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 748868568, now seen corresponding path program 1 times [2018-12-09 19:12:12,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:12,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:12,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:13,534 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-09 19:12:13,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:13,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:12:13,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:13,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:12:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:12:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:12:13,535 INFO L87 Difference]: Start difference. First operand 22807 states and 76222 transitions. Second operand 4 states. [2018-12-09 19:12:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:13,699 INFO L93 Difference]: Finished difference Result 40397 states and 136103 transitions. [2018-12-09 19:12:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:12:13,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-09 19:12:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:13,749 INFO L225 Difference]: With dead ends: 40397 [2018-12-09 19:12:13,749 INFO L226 Difference]: Without dead ends: 40257 [2018-12-09 19:12:13,749 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-09 19:12:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40257 states. [2018-12-09 19:12:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40257 to 21587. [2018-12-09 19:12:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21587 states. [2018-12-09 19:12:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21587 states to 21587 states and 71871 transitions. [2018-12-09 19:12:14,038 INFO L78 Accepts]: Start accepts. Automaton has 21587 states and 71871 transitions. Word has length 103 [2018-12-09 19:12:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:14,038 INFO L480 AbstractCegarLoop]: Abstraction has 21587 states and 71871 transitions. [2018-12-09 19:12:14,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:12:14,038 INFO L276 IsEmpty]: Start isEmpty. Operand 21587 states and 71871 transitions. [2018-12-09 19:12:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:12:14,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:14,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:14,055 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:14,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1078634329, now seen corresponding path program 1 times [2018-12-09 19:12:14,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:14,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:14,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:12:14,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:14,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:12:14,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:12:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:12:14,117 INFO L87 Difference]: Start difference. First operand 21587 states and 71871 transitions. Second operand 7 states. [2018-12-09 19:12:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:14,328 INFO L93 Difference]: Finished difference Result 23831 states and 78914 transitions. [2018-12-09 19:12:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:14,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-09 19:12:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:14,357 INFO L225 Difference]: With dead ends: 23831 [2018-12-09 19:12:14,357 INFO L226 Difference]: Without dead ends: 23831 [2018-12-09 19:12:14,357 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-09 19:12:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23831 states. [2018-12-09 19:12:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23831 to 22247. [2018-12-09 19:12:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22247 states. [2018-12-09 19:12:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22247 states to 22247 states and 73859 transitions. [2018-12-09 19:12:14,601 INFO L78 Accepts]: Start accepts. Automaton has 22247 states and 73859 transitions. Word has length 103 [2018-12-09 19:12:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:14,601 INFO L480 AbstractCegarLoop]: Abstraction has 22247 states and 73859 transitions. [2018-12-09 19:12:14,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:12:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 22247 states and 73859 transitions. [2018-12-09 19:12:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:12:14,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:14,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:14,620 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:14,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:14,620 INFO L82 PathProgramCache]: Analyzing trace with hash -104712968, now seen corresponding path program 1 times [2018-12-09 19:12:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:14,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:14,668 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-09 19:12:14,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:14,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:14,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:14,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:14,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:14,668 INFO L87 Difference]: Start difference. First operand 22247 states and 73859 transitions. Second operand 5 states. [2018-12-09 19:12:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:14,795 INFO L93 Difference]: Finished difference Result 21088 states and 69927 transitions. [2018-12-09 19:12:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:12:14,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-12-09 19:12:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:14,819 INFO L225 Difference]: With dead ends: 21088 [2018-12-09 19:12:14,819 INFO L226 Difference]: Without dead ends: 21088 [2018-12-09 19:12:14,819 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-09 19:12:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21088 states. [2018-12-09 19:12:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21088 to 20248. [2018-12-09 19:12:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20248 states. [2018-12-09 19:12:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20248 states to 20248 states and 67440 transitions. [2018-12-09 19:12:15,030 INFO L78 Accepts]: Start accepts. Automaton has 20248 states and 67440 transitions. Word has length 103 [2018-12-09 19:12:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:15,030 INFO L480 AbstractCegarLoop]: Abstraction has 20248 states and 67440 transitions. [2018-12-09 19:12:15,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20248 states and 67440 transitions. [2018-12-09 19:12:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 19:12:15,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:15,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:15,047 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:15,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1989010568, now seen corresponding path program 1 times [2018-12-09 19:12:15,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:15,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:15,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:15,124 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-09 19:12:15,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:15,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:15,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:15,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:15,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:15,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:15,125 INFO L87 Difference]: Start difference. First operand 20248 states and 67440 transitions. Second operand 6 states. [2018-12-09 19:12:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:15,255 INFO L93 Difference]: Finished difference Result 18776 states and 61760 transitions. [2018-12-09 19:12:15,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:12:15,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-12-09 19:12:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:15,276 INFO L225 Difference]: With dead ends: 18776 [2018-12-09 19:12:15,276 INFO L226 Difference]: Without dead ends: 18776 [2018-12-09 19:12:15,276 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-09 19:12:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18776 states. [2018-12-09 19:12:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18776 to 16653. [2018-12-09 19:12:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16653 states. [2018-12-09 19:12:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16653 states to 16653 states and 55184 transitions. [2018-12-09 19:12:15,470 INFO L78 Accepts]: Start accepts. Automaton has 16653 states and 55184 transitions. Word has length 103 [2018-12-09 19:12:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:15,470 INFO L480 AbstractCegarLoop]: Abstraction has 16653 states and 55184 transitions. [2018-12-09 19:12:15,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 16653 states and 55184 transitions. [2018-12-09 19:12:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:15,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:15,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:15,483 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:15,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1159044518, now seen corresponding path program 1 times [2018-12-09 19:12:15,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:15,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:15,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:15,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:15,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:12:15,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:15,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:12:15,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:12:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:15,542 INFO L87 Difference]: Start difference. First operand 16653 states and 55184 transitions. Second operand 6 states. [2018-12-09 19:12:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:15,621 INFO L93 Difference]: Finished difference Result 17473 states and 57290 transitions. [2018-12-09 19:12:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:15,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-09 19:12:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:15,642 INFO L225 Difference]: With dead ends: 17473 [2018-12-09 19:12:15,643 INFO L226 Difference]: Without dead ends: 17373 [2018-12-09 19:12:15,643 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-09 19:12:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17373 states. [2018-12-09 19:12:15,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17373 to 16328. [2018-12-09 19:12:15,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2018-12-09 19:12:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 54029 transitions. [2018-12-09 19:12:15,812 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 54029 transitions. Word has length 105 [2018-12-09 19:12:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:15,812 INFO L480 AbstractCegarLoop]: Abstraction has 16328 states and 54029 transitions. [2018-12-09 19:12:15,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:12:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 54029 transitions. [2018-12-09 19:12:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:15,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:15,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:15,825 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:15,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1200262491, now seen corresponding path program 1 times [2018-12-09 19:12:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:15,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:12:15,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:15,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:15,875 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:15,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:15,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:15,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:15,875 INFO L87 Difference]: Start difference. First operand 16328 states and 54029 transitions. Second operand 5 states. [2018-12-09 19:12:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:16,014 INFO L93 Difference]: Finished difference Result 18504 states and 61037 transitions. [2018-12-09 19:12:16,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:12:16,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-09 19:12:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:16,035 INFO L225 Difference]: With dead ends: 18504 [2018-12-09 19:12:16,035 INFO L226 Difference]: Without dead ends: 18376 [2018-12-09 19:12:16,035 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-09 19:12:16,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18376 states. [2018-12-09 19:12:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18376 to 16520. [2018-12-09 19:12:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16520 states. [2018-12-09 19:12:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16520 states to 16520 states and 54589 transitions. [2018-12-09 19:12:16,211 INFO L78 Accepts]: Start accepts. Automaton has 16520 states and 54589 transitions. Word has length 105 [2018-12-09 19:12:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:16,211 INFO L480 AbstractCegarLoop]: Abstraction has 16520 states and 54589 transitions. [2018-12-09 19:12:16,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 16520 states and 54589 transitions. [2018-12-09 19:12:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:16,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:16,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:16,225 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:16,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1849940324, now seen corresponding path program 1 times [2018-12-09 19:12:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:16,271 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-09 19:12:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:16,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:12:16,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:16,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:12:16,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:12:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:12:16,272 INFO L87 Difference]: Start difference. First operand 16520 states and 54589 transitions. Second operand 5 states. [2018-12-09 19:12:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:16,343 INFO L93 Difference]: Finished difference Result 23308 states and 77718 transitions. [2018-12-09 19:12:16,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:12:16,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2018-12-09 19:12:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:16,370 INFO L225 Difference]: With dead ends: 23308 [2018-12-09 19:12:16,371 INFO L226 Difference]: Without dead ends: 23308 [2018-12-09 19:12:16,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:12:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23308 states. [2018-12-09 19:12:16,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23308 to 16190. [2018-12-09 19:12:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16190 states. [2018-12-09 19:12:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16190 states to 16190 states and 53385 transitions. [2018-12-09 19:12:16,568 INFO L78 Accepts]: Start accepts. Automaton has 16190 states and 53385 transitions. Word has length 105 [2018-12-09 19:12:16,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:16,568 INFO L480 AbstractCegarLoop]: Abstraction has 16190 states and 53385 transitions. [2018-12-09 19:12:16,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:12:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 16190 states and 53385 transitions. [2018-12-09 19:12:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:16,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:16,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:16,581 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:16,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash -880359301, now seen corresponding path program 1 times [2018-12-09 19:12:16,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:16,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:16,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:16,651 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-09 19:12:16,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:16,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:12:16,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:16,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:12:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:12:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:12:16,652 INFO L87 Difference]: Start difference. First operand 16190 states and 53385 transitions. Second operand 9 states. [2018-12-09 19:12:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:16,812 INFO L93 Difference]: Finished difference Result 30766 states and 102145 transitions. [2018-12-09 19:12:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:12:16,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-09 19:12:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:16,830 INFO L225 Difference]: With dead ends: 30766 [2018-12-09 19:12:16,830 INFO L226 Difference]: Without dead ends: 15602 [2018-12-09 19:12:16,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:12:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15602 states. [2018-12-09 19:12:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15602 to 15602. [2018-12-09 19:12:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15602 states. [2018-12-09 19:12:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 51673 transitions. [2018-12-09 19:12:16,994 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 51673 transitions. Word has length 105 [2018-12-09 19:12:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 15602 states and 51673 transitions. [2018-12-09 19:12:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:12:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 51673 transitions. [2018-12-09 19:12:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:17,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:17,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:12:17,008 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -287902169, now seen corresponding path program 2 times [2018-12-09 19:12:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:12:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:17,081 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-09 19:12:17,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:12:17,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:17,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:12:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:12:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:12:17,081 INFO L87 Difference]: Start difference. First operand 15602 states and 51673 transitions. Second operand 9 states. [2018-12-09 19:12:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:17,247 INFO L93 Difference]: Finished difference Result 23230 states and 77514 transitions. [2018-12-09 19:12:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:12:17,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-12-09 19:12:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:17,256 INFO L225 Difference]: With dead ends: 23230 [2018-12-09 19:12:17,256 INFO L226 Difference]: Without dead ends: 7922 [2018-12-09 19:12:17,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:12:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2018-12-09 19:12:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7922. [2018-12-09 19:12:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2018-12-09 19:12:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 26635 transitions. [2018-12-09 19:12:17,335 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 26635 transitions. Word has length 105 [2018-12-09 19:12:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:17,336 INFO L480 AbstractCegarLoop]: Abstraction has 7922 states and 26635 transitions. [2018-12-09 19:12:17,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:12:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 26635 transitions. [2018-12-09 19:12:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:17,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:12:17,341 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:17,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1777138289, now seen corresponding path program 3 times [2018-12-09 19:12:17,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:17,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:12:17,428 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-09 19:12:17,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:12:17,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:12:17,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:12:17,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:12:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:12:17,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:12:17,429 INFO L87 Difference]: Start difference. First operand 7922 states and 26635 transitions. Second operand 12 states. [2018-12-09 19:12:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:12:17,810 INFO L93 Difference]: Finished difference Result 15214 states and 51408 transitions. [2018-12-09 19:12:17,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:12:17,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-09 19:12:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:12:17,823 INFO L225 Difference]: With dead ends: 15214 [2018-12-09 19:12:17,823 INFO L226 Difference]: Without dead ends: 10670 [2018-12-09 19:12:17,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:12:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10670 states. [2018-12-09 19:12:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10670 to 10006. [2018-12-09 19:12:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10006 states. [2018-12-09 19:12:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10006 states to 10006 states and 33062 transitions. [2018-12-09 19:12:17,924 INFO L78 Accepts]: Start accepts. Automaton has 10006 states and 33062 transitions. Word has length 105 [2018-12-09 19:12:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:12:17,924 INFO L480 AbstractCegarLoop]: Abstraction has 10006 states and 33062 transitions. [2018-12-09 19:12:17,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:12:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10006 states and 33062 transitions. [2018-12-09 19:12:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-09 19:12:17,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:12:17,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:12:17,933 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:12:17,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:12:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash 653369973, now seen corresponding path program 4 times [2018-12-09 19:12:17,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:12:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:12:17,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:12:17,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:12:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:12:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:12:17,972 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:12:18,047 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:12:18,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:12:18 BasicIcfg [2018-12-09 19:12:18,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:12:18,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:12:18,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:12:18,049 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:12:18,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:33" (3/4) ... [2018-12-09 19:12:18,051 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:12:18,124 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7919a2c3-92d2-4f85-933e-471e60868ae0/bin-2019/utaipan/witness.graphml [2018-12-09 19:12:18,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:12:18,125 INFO L168 Benchmark]: Toolchain (without parser) took 105093.56 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 952.4 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 992.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,126 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:12:18,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,126 INFO L168 Benchmark]: Boogie Preprocessor took 20.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:12:18,126 INFO L168 Benchmark]: RCFGBuilder took 363.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 983.6 MB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,127 INFO L168 Benchmark]: TraceAbstraction took 104261.09 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 983.6 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 898.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,127 INFO L168 Benchmark]: Witness Printer took 75.71 ms. Allocated memory is still 6.4 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:12:18,128 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 68.2 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -90.6 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 983.6 MB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104261.09 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 983.6 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 898.1 MB. Max. memory is 11.5 GB. * Witness Printer took 75.71 ms. Allocated memory is still 6.4 GB. Free memory was 5.4 GB in the beginning and 5.4 GB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1116; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1116, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1117; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1117, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] -1 pthread_t t1118; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t1118, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 y$w_buff1 = y$w_buff0 [L746] 0 y$w_buff0 = 2 [L747] 0 y$w_buff1_used = y$w_buff0_used [L748] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L751] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L752] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L753] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L754] 0 y$r_buff0_thd3 = (_Bool)1 [L757] 0 z = 1 [L760] 0 __unbuffered_p2_EAX = z [L763] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 __unbuffered_p0_EAX = x [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 1 [L728] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L768] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2, z=1] [L731] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L770] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L734] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L735] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L738] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L806] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L807] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L808] -1 y$flush_delayed = weak$$choice2 [L809] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y = y$flush_delayed ? y$mem_tmp : y [L819] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 201 locations, 3 error locations. UNSAFE Result, 104.1s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8201 SDtfs, 8952 SDslu, 19165 SDs, 0 SdLazy, 6339 SolverSat, 413 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 86 SyntacticMatches, 19 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209409occurred in iteration=17, 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: 56.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 574317 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2534 NumberOfCodeBlocks, 2534 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2400 ConstructedInterpolants, 0 QuantifiedInterpolants, 500301 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...