./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_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_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/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 562269bef7a1d39f5f5cf32effa17ab983c170a5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-01 22:18:27,567 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:18:27,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:18:27,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:18:27,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:18:27,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:18:27,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:18:27,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:18:27,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:18:27,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:18:27,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:18:27,578 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:18:27,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:18:27,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:18:27,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:18:27,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:18:27,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:18:27,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:18:27,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:18:27,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:18:27,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:18:27,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:18:27,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:18:27,586 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:18:27,586 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:18:27,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:18:27,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:18:27,587 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:18:27,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:18:27,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:18:27,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:18:27,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:18:27,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:18:27,589 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:18:27,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:18:27,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:18:27,590 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-01 22:18:27,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:18:27,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:18:27,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 22:18:27,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-01 22:18:27,598 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 22:18:27,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:18:27,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:18:27,600 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:18:27,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:18:27,600 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:18:27,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:18:27,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-01 22:18:27,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:18:27,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:18:27,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-01 22:18:27,601 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_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/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 -> 562269bef7a1d39f5f5cf32effa17ab983c170a5 [2018-12-01 22:18:27,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:18:27,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:18:27,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:18:27,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:18:27,633 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:18:27,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i [2018-12-01 22:18:27,667 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/data/1fa42b330/d83da54056484099a99a8201f4fe6b6d/FLAGe7c54e608 [2018-12-01 22:18:28,133 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:18:28,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/sv-benchmarks/c/pthread-wmm/mix056_pso.opt_false-unreach-call.i [2018-12-01 22:18:28,141 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/data/1fa42b330/d83da54056484099a99a8201f4fe6b6d/FLAGe7c54e608 [2018-12-01 22:18:28,150 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/data/1fa42b330/d83da54056484099a99a8201f4fe6b6d [2018-12-01 22:18:28,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:18:28,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:18:28,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:18:28,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:18:28,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:18:28,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28, skipping insertion in model container [2018-12-01 22:18:28,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:18:28,193 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:18:28,383 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:18:28,391 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:18:28,479 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:18:28,511 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:18:28,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28 WrapperNode [2018-12-01 22:18:28,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:18:28,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:18:28,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:18:28,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:18:28,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:18:28,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:18:28,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:18:28,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:18:28,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... [2018-12-01 22:18:28,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:18:28,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:18:28,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:18:28,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:18:28,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/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-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 22:18:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 22:18:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-01 22:18:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-01 22:18:28,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 22:18:28,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:18:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:18:28,602 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 22:18:28,929 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:18:28,929 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 22:18:28,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:28 BoogieIcfgContainer [2018-12-01 22:18:28,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:18:28,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:18:28,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:18:28,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:18:28,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:18:28" (1/3) ... [2018-12-01 22:18:28,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a22753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:18:28, skipping insertion in model container [2018-12-01 22:18:28,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:18:28" (2/3) ... [2018-12-01 22:18:28,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a22753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:18:28, skipping insertion in model container [2018-12-01 22:18:28,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:28" (3/3) ... [2018-12-01 22:18:28,934 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt_false-unreach-call.i [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,956 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,957 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,958 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,959 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,960 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,961 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,962 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,963 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,964 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,965 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,966 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,967 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:18:28,971 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 22:18:28,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:18:28,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 22:18:28,986 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 22:18:29,002 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:18:29,002 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:18:29,002 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:18:29,002 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:18:29,002 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:18:29,002 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:18:29,002 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:18:29,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:18:29,010 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-01 22:18:43,729 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-01 22:18:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-01 22:18:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-01 22:18:43,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:43,738 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] [2018-12-01 22:18:43,739 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:43,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-01 22:18:43,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:43,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:43,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:43,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:43,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:43,889 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-01 22:18:43,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:43,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:18:43,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:43,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:18:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:18:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:18:43,904 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-01 22:18:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:45,238 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-01 22:18:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:18:45,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-01 22:18:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:47,872 INFO L225 Difference]: With dead ends: 233472 [2018-12-01 22:18:47,872 INFO L226 Difference]: Without dead ends: 203722 [2018-12-01 22:18:47,874 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-01 22:18:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-01 22:18:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-01 22:18:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-01 22:18:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-01 22:18:51,133 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-01 22:18:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:51,134 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-01 22:18:51,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:18:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-01 22:18:51,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 22:18:51,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:51,141 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] [2018-12-01 22:18:51,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:51,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-01 22:18:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:51,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:51,187 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-01 22:18:51,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:18:51,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:51,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:18:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:18:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:18:51,189 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-01 22:18:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:52,047 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-01 22:18:52,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:18:52,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-01 22:18:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:52,360 INFO L225 Difference]: With dead ends: 118892 [2018-12-01 22:18:52,360 INFO L226 Difference]: Without dead ends: 118892 [2018-12-01 22:18:52,361 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-01 22:18:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-01 22:18:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-01 22:18:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-01 22:18:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-01 22:18:54,879 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-01 22:18:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:18:54,879 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-01 22:18:54,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:18:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-01 22:18:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-01 22:18:54,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:18:54,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:18:54,883 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:18:54,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:18:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-01 22:18:54,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:18:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:18:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:18:54,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:18:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:18:54,936 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-01 22:18:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:18:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:18:54,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:18:54,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:18:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:18:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:18:54,937 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-01 22:18:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:18:56,881 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-01 22:18:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:18:56,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-01 22:18:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:18:57,727 INFO L225 Difference]: With dead ends: 325272 [2018-12-01 22:18:57,727 INFO L226 Difference]: Without dead ends: 324272 [2018-12-01 22:18:57,728 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-01 22:18:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-01 22:19:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-01 22:19:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-01 22:19:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-01 22:19:05,191 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-01 22:19:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:19:05,192 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-01 22:19:05,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:19:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-01 22:19:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 22:19:05,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:19:05,198 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] [2018-12-01 22:19:05,198 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:19:05,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:19:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-01 22:19:05,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:19:05,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:05,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:19:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:05,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:19:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:19:05,258 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-01 22:19:05,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:19:05,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:19:05,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:19:05,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:19:05,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:19:05,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:19:05,259 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-01 22:19:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:19:06,920 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-01 22:19:06,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:19:06,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-01 22:19:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:19:08,450 INFO L225 Difference]: With dead ends: 334052 [2018-12-01 22:19:08,450 INFO L226 Difference]: Without dead ends: 333002 [2018-12-01 22:19:08,451 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-01 22:19:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-01 22:19:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-01 22:19:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-01 22:19:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-01 22:19:16,180 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-01 22:19:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:19:16,180 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-01 22:19:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:19:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-01 22:19:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-01 22:19:16,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:19:16,205 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:19:16,205 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:19:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:19:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-01 22:19:16,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:19:16,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:16,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:19:16,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:16,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:19:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:19:16,265 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-01 22:19:16,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:19:16,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:19:16,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:19:16,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:19:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:19:16,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:19:16,266 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-01 22:19:16,660 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-01 22:19:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:19:18,464 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-01 22:19:18,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 22:19:18,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-01 22:19:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:19:19,830 INFO L225 Difference]: With dead ends: 342292 [2018-12-01 22:19:19,830 INFO L226 Difference]: Without dead ends: 341292 [2018-12-01 22:19:19,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-01 22:19:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-01 22:19:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-01 22:19:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-01 22:19:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-01 22:19:27,310 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-01 22:19:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:19:27,310 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-01 22:19:27,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:19:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-01 22:19:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:19:27,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:19:27,380 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] [2018-12-01 22:19:27,380 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:19:27,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:19:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-01 22:19:27,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:19:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:27,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:19:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:27,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:19:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:19:27,439 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-01 22:19:27,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:19:27,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:19:27,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:19:27,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:19:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:19:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:19:27,440 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-01 22:19:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:19:29,313 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-01 22:19:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:19:29,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-01 22:19:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:19:30,143 INFO L225 Difference]: With dead ends: 312432 [2018-12-01 22:19:30,143 INFO L226 Difference]: Without dead ends: 311792 [2018-12-01 22:19:30,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:19:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-01 22:19:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-01 22:19:35,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-01 22:19:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-01 22:19:36,796 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-01 22:19:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:19:36,796 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-01 22:19:36,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:19:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-01 22:19:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:19:36,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:19:36,908 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] [2018-12-01 22:19:36,908 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:19:36,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:19:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-01 22:19:36,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:19:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:36,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:19:36,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:36,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:19:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:19:36,959 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-01 22:19:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:19:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:19:36,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:19:36,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:19:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:19:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:19:36,960 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-01 22:19:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:19:43,170 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-01 22:19:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 22:19:43,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-01 22:19:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:19:45,154 INFO L225 Difference]: With dead ends: 617312 [2018-12-01 22:19:45,154 INFO L226 Difference]: Without dead ends: 615712 [2018-12-01 22:19:45,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 22:19:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-01 22:19:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-01 22:19:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-01 22:19:54,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-01 22:19:54,935 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-01 22:19:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:19:54,935 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-01 22:19:54,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:19:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-01 22:19:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 22:19:55,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:19:55,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:19:55,116 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:19:55,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:19:55,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-01 22:19:55,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:19:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:55,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:19:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:19:55,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:19:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:19:55,138 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-01 22:19:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:19:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:19:55,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:19:55,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:19:55,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:19:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:19:55,139 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-01 22:20:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:00,823 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-01 22:20:00,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:20:00,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-01 22:20:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:02,037 INFO L225 Difference]: With dead ends: 438907 [2018-12-01 22:20:02,037 INFO L226 Difference]: Without dead ends: 438907 [2018-12-01 22:20:02,037 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-01 22:20:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-01 22:20:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-01 22:20:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-01 22:20:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-01 22:20:09,834 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-01 22:20:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:09,834 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-01 22:20:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:20:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-01 22:20:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-01 22:20:10,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:10,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:10,094 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:10,095 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-01 22:20:10,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:10,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:10,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:10,163 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-01 22:20:10,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:10,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:20:10,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:10,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:20:10,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:20:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:10,164 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-01 22:20:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:14,748 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-01 22:20:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:20:14,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-01 22:20:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:21,684 INFO L225 Difference]: With dead ends: 675132 [2018-12-01 22:20:21,684 INFO L226 Difference]: Without dead ends: 673532 [2018-12-01 22:20:21,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-01 22:20:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-01 22:20:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-01 22:20:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-01 22:20:31,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-01 22:20:31,517 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-01 22:20:31,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:31,517 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-01 22:20:31,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:20:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-01 22:20:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-01 22:20:32,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:32,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:32,335 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:32,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-01 22:20:32,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:32,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:32,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:32,381 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-01 22:20:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:20:32,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:32,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:20:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:20:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:20:32,382 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 4 states. [2018-12-01 22:20:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:34,464 INFO L93 Difference]: Finished difference Result 340330 states and 1476149 transitions. [2018-12-01 22:20:34,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:20:34,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-01 22:20:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:35,361 INFO L225 Difference]: With dead ends: 340330 [2018-12-01 22:20:35,361 INFO L226 Difference]: Without dead ends: 337725 [2018-12-01 22:20:35,361 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-01 22:20:36,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337725 states. [2018-12-01 22:20:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337725 to 337725. [2018-12-01 22:20:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337725 states. [2018-12-01 22:20:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337725 states to 337725 states and 1467477 transitions. [2018-12-01 22:20:45,496 INFO L78 Accepts]: Start accepts. Automaton has 337725 states and 1467477 transitions. Word has length 72 [2018-12-01 22:20:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:45,496 INFO L480 AbstractCegarLoop]: Abstraction has 337725 states and 1467477 transitions. [2018-12-01 22:20:45,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:20:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 337725 states and 1467477 transitions. [2018-12-01 22:20:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-01 22:20:45,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:45,741 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] [2018-12-01 22:20:45,741 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:45,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash -966195198, now seen corresponding path program 1 times [2018-12-01 22:20:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:45,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:45,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:45,775 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-01 22:20:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:20:45,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:20:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:20:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:45,776 INFO L87 Difference]: Start difference. First operand 337725 states and 1467477 transitions. Second operand 5 states. [2018-12-01 22:20:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:46,750 INFO L93 Difference]: Finished difference Result 123261 states and 489737 transitions. [2018-12-01 22:20:46,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:20:46,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-01 22:20:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:47,008 INFO L225 Difference]: With dead ends: 123261 [2018-12-01 22:20:47,008 INFO L226 Difference]: Without dead ends: 120949 [2018-12-01 22:20:47,009 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-01 22:20:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120949 states. [2018-12-01 22:20:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120949 to 120949. [2018-12-01 22:20:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120949 states. [2018-12-01 22:20:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120949 states to 120949 states and 481083 transitions. [2018-12-01 22:20:49,122 INFO L78 Accepts]: Start accepts. Automaton has 120949 states and 481083 transitions. Word has length 73 [2018-12-01 22:20:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:49,122 INFO L480 AbstractCegarLoop]: Abstraction has 120949 states and 481083 transitions. [2018-12-01 22:20:49,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:20:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 120949 states and 481083 transitions. [2018-12-01 22:20:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 22:20:49,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:49,196 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] [2018-12-01 22:20:49,196 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:49,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:49,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1713809945, now seen corresponding path program 1 times [2018-12-01 22:20:49,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:49,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:49,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:49,237 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-01 22:20:49,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:49,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:20:49,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:49,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:20:49,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:20:49,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:20:49,238 INFO L87 Difference]: Start difference. First operand 120949 states and 481083 transitions. Second operand 4 states. [2018-12-01 22:20:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:49,882 INFO L93 Difference]: Finished difference Result 151209 states and 596504 transitions. [2018-12-01 22:20:49,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:20:49,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-01 22:20:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:50,209 INFO L225 Difference]: With dead ends: 151209 [2018-12-01 22:20:50,209 INFO L226 Difference]: Without dead ends: 151209 [2018-12-01 22:20:50,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151209 states. [2018-12-01 22:20:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151209 to 126025. [2018-12-01 22:20:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126025 states. [2018-12-01 22:20:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126025 states to 126025 states and 499976 transitions. [2018-12-01 22:20:52,409 INFO L78 Accepts]: Start accepts. Automaton has 126025 states and 499976 transitions. Word has length 79 [2018-12-01 22:20:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:52,410 INFO L480 AbstractCegarLoop]: Abstraction has 126025 states and 499976 transitions. [2018-12-01 22:20:52,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:20:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 126025 states and 499976 transitions. [2018-12-01 22:20:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-01 22:20:52,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:52,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] [2018-12-01 22:20:52,496 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:52,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash 543101062, now seen corresponding path program 1 times [2018-12-01 22:20:52,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:52,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:52,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:52,539 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-01 22:20:52,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:52,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:52,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:52,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:52,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:52,540 INFO L87 Difference]: Start difference. First operand 126025 states and 499976 transitions. Second operand 6 states. [2018-12-01 22:20:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:52,831 INFO L93 Difference]: Finished difference Result 18937 states and 65328 transitions. [2018-12-01 22:20:52,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:20:52,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-12-01 22:20:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:52,854 INFO L225 Difference]: With dead ends: 18937 [2018-12-01 22:20:52,854 INFO L226 Difference]: Without dead ends: 17225 [2018-12-01 22:20:52,855 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-01 22:20:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17225 states. [2018-12-01 22:20:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17225 to 16710. [2018-12-01 22:20:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2018-12-01 22:20:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 57632 transitions. [2018-12-01 22:20:53,034 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 57632 transitions. Word has length 79 [2018-12-01 22:20:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:53,034 INFO L480 AbstractCegarLoop]: Abstraction has 16710 states and 57632 transitions. [2018-12-01 22:20:53,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:20:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 57632 transitions. [2018-12-01 22:20:53,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:53,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:53,049 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] [2018-12-01 22:20:53,049 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:53,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-01 22:20:53,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:53,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:53,088 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-01 22:20:53,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:20:53,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:20:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:20:53,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:20:53,089 INFO L87 Difference]: Start difference. First operand 16710 states and 57632 transitions. Second operand 3 states. [2018-12-01 22:20:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:53,217 INFO L93 Difference]: Finished difference Result 17130 states and 58913 transitions. [2018-12-01 22:20:53,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:20:53,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-01 22:20:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:53,237 INFO L225 Difference]: With dead ends: 17130 [2018-12-01 22:20:53,237 INFO L226 Difference]: Without dead ends: 17130 [2018-12-01 22:20:53,238 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-01 22:20:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2018-12-01 22:20:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 16900. [2018-12-01 22:20:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16900 states. [2018-12-01 22:20:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16900 states to 16900 states and 58214 transitions. [2018-12-01 22:20:53,403 INFO L78 Accepts]: Start accepts. Automaton has 16900 states and 58214 transitions. Word has length 98 [2018-12-01 22:20:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:53,403 INFO L480 AbstractCegarLoop]: Abstraction has 16900 states and 58214 transitions. [2018-12-01 22:20:53,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:20:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 16900 states and 58214 transitions. [2018-12-01 22:20:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:53,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:53,417 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] [2018-12-01 22:20:53,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:53,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:53,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1088162851, now seen corresponding path program 1 times [2018-12-01 22:20:53,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:53,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:53,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:53,445 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-01 22:20:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:53,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:20:53,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:53,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:20:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:20:53,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:20:53,446 INFO L87 Difference]: Start difference. First operand 16900 states and 58214 transitions. Second operand 4 states. [2018-12-01 22:20:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:53,637 INFO L93 Difference]: Finished difference Result 23569 states and 81311 transitions. [2018-12-01 22:20:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:20:53,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-01 22:20:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:53,667 INFO L225 Difference]: With dead ends: 23569 [2018-12-01 22:20:53,667 INFO L226 Difference]: Without dead ends: 23569 [2018-12-01 22:20:53,667 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-01 22:20:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23569 states. [2018-12-01 22:20:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23569 to 17100. [2018-12-01 22:20:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17100 states. [2018-12-01 22:20:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17100 states to 17100 states and 58824 transitions. [2018-12-01 22:20:53,890 INFO L78 Accepts]: Start accepts. Automaton has 17100 states and 58824 transitions. Word has length 98 [2018-12-01 22:20:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:53,890 INFO L480 AbstractCegarLoop]: Abstraction has 17100 states and 58824 transitions. [2018-12-01 22:20:53,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:20:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 17100 states and 58824 transitions. [2018-12-01 22:20:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:53,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:53,912 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] [2018-12-01 22:20:53,912 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:53,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash 218366757, now seen corresponding path program 2 times [2018-12-01 22:20:53,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:53,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:53,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:53,944 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-01 22:20:53,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:53,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:20:53,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:53,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:20:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:20:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:53,945 INFO L87 Difference]: Start difference. First operand 17100 states and 58824 transitions. Second operand 5 states. [2018-12-01 22:20:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:54,113 INFO L93 Difference]: Finished difference Result 21300 states and 72114 transitions. [2018-12-01 22:20:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:20:54,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 22:20:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:54,138 INFO L225 Difference]: With dead ends: 21300 [2018-12-01 22:20:54,138 INFO L226 Difference]: Without dead ends: 21300 [2018-12-01 22:20:54,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21300 states. [2018-12-01 22:20:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21300 to 19026. [2018-12-01 22:20:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19026 states. [2018-12-01 22:20:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19026 states to 19026 states and 65048 transitions. [2018-12-01 22:20:54,342 INFO L78 Accepts]: Start accepts. Automaton has 19026 states and 65048 transitions. Word has length 98 [2018-12-01 22:20:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:54,342 INFO L480 AbstractCegarLoop]: Abstraction has 19026 states and 65048 transitions. [2018-12-01 22:20:54,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:20:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 19026 states and 65048 transitions. [2018-12-01 22:20:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:54,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:54,358 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] [2018-12-01 22:20:54,359 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:54,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash -806327164, now seen corresponding path program 1 times [2018-12-01 22:20:54,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:54,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:20:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:54,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:20:54,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:54,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:20:54,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:54,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:20:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:20:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:54,409 INFO L87 Difference]: Start difference. First operand 19026 states and 65048 transitions. Second operand 7 states. [2018-12-01 22:20:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:54,639 INFO L93 Difference]: Finished difference Result 21506 states and 72692 transitions. [2018-12-01 22:20:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:20:54,640 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-01 22:20:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:54,664 INFO L225 Difference]: With dead ends: 21506 [2018-12-01 22:20:54,664 INFO L226 Difference]: Without dead ends: 21441 [2018-12-01 22:20:54,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:20:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21441 states. [2018-12-01 22:20:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21441 to 20361. [2018-12-01 22:20:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2018-12-01 22:20:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 69376 transitions. [2018-12-01 22:20:54,952 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 69376 transitions. Word has length 98 [2018-12-01 22:20:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:54,952 INFO L480 AbstractCegarLoop]: Abstraction has 20361 states and 69376 transitions. [2018-12-01 22:20:54,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:20:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 69376 transitions. [2018-12-01 22:20:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:54,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:54,968 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] [2018-12-01 22:20:54,969 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:54,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1646225981, now seen corresponding path program 3 times [2018-12-01 22:20:54,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:54,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:54,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:54,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:55,000 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-01 22:20:55,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:55,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:20:55,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:55,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:20:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:20:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:55,000 INFO L87 Difference]: Start difference. First operand 20361 states and 69376 transitions. Second operand 5 states. [2018-12-01 22:20:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:55,162 INFO L93 Difference]: Finished difference Result 21406 states and 72492 transitions. [2018-12-01 22:20:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:20:55,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 22:20:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:55,189 INFO L225 Difference]: With dead ends: 21406 [2018-12-01 22:20:55,189 INFO L226 Difference]: Without dead ends: 21406 [2018-12-01 22:20:55,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:55,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21406 states. [2018-12-01 22:20:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21406 to 20481. [2018-12-01 22:20:55,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20481 states. [2018-12-01 22:20:55,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20481 states to 20481 states and 69712 transitions. [2018-12-01 22:20:55,405 INFO L78 Accepts]: Start accepts. Automaton has 20481 states and 69712 transitions. Word has length 98 [2018-12-01 22:20:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:55,405 INFO L480 AbstractCegarLoop]: Abstraction has 20481 states and 69712 transitions. [2018-12-01 22:20:55,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:20:55,405 INFO L276 IsEmpty]: Start isEmpty. Operand 20481 states and 69712 transitions. [2018-12-01 22:20:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-01 22:20:55,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:55,423 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] [2018-12-01 22:20:55,423 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:55,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1164612293, now seen corresponding path program 1 times [2018-12-01 22:20:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:55,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:20:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:55,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:55,465 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-01 22:20:55,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:55,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:20:55,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:55,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:20:55,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:20:55,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:55,466 INFO L87 Difference]: Start difference. First operand 20481 states and 69712 transitions. Second operand 5 states. [2018-12-01 22:20:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:55,629 INFO L93 Difference]: Finished difference Result 24552 states and 82252 transitions. [2018-12-01 22:20:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:20:55,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-01 22:20:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:55,657 INFO L225 Difference]: With dead ends: 24552 [2018-12-01 22:20:55,658 INFO L226 Difference]: Without dead ends: 24412 [2018-12-01 22:20:55,658 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-01 22:20:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24412 states. [2018-12-01 22:20:55,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24412 to 20961. [2018-12-01 22:20:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20961 states. [2018-12-01 22:20:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20961 states to 20961 states and 71076 transitions. [2018-12-01 22:20:55,890 INFO L78 Accepts]: Start accepts. Automaton has 20961 states and 71076 transitions. Word has length 98 [2018-12-01 22:20:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:55,890 INFO L480 AbstractCegarLoop]: Abstraction has 20961 states and 71076 transitions. [2018-12-01 22:20:55,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:20:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20961 states and 71076 transitions. [2018-12-01 22:20:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:55,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:55,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:55,908 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:55,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-01 22:20:55,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:55,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:55,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:55,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:55,943 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-01 22:20:55,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:55,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:20:55,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:55,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:20:55,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:20:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:20:55,943 INFO L87 Difference]: Start difference. First operand 20961 states and 71076 transitions. Second operand 4 states. [2018-12-01 22:20:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:56,105 INFO L93 Difference]: Finished difference Result 34084 states and 116076 transitions. [2018-12-01 22:20:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:20:56,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 22:20:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:56,150 INFO L225 Difference]: With dead ends: 34084 [2018-12-01 22:20:56,150 INFO L226 Difference]: Without dead ends: 34084 [2018-12-01 22:20:56,150 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-01 22:20:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34084 states. [2018-12-01 22:20:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34084 to 19261. [2018-12-01 22:20:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19261 states. [2018-12-01 22:20:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19261 states to 19261 states and 65296 transitions. [2018-12-01 22:20:56,425 INFO L78 Accepts]: Start accepts. Automaton has 19261 states and 65296 transitions. Word has length 100 [2018-12-01 22:20:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:56,425 INFO L480 AbstractCegarLoop]: Abstraction has 19261 states and 65296 transitions. [2018-12-01 22:20:56,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:20:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19261 states and 65296 transitions. [2018-12-01 22:20:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:56,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:56,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:56,442 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:56,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1758578087, now seen corresponding path program 1 times [2018-12-01 22:20:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:56,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:56,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:56,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:56,489 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-01 22:20:56,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:56,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:56,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:56,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:56,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:56,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:56,489 INFO L87 Difference]: Start difference. First operand 19261 states and 65296 transitions. Second operand 6 states. [2018-12-01 22:20:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:56,681 INFO L93 Difference]: Finished difference Result 21136 states and 70996 transitions. [2018-12-01 22:20:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:20:56,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 22:20:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:56,705 INFO L225 Difference]: With dead ends: 21136 [2018-12-01 22:20:56,705 INFO L226 Difference]: Without dead ends: 21136 [2018-12-01 22:20:56,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21136 states. [2018-12-01 22:20:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21136 to 19606. [2018-12-01 22:20:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19606 states. [2018-12-01 22:20:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19606 states to 19606 states and 66407 transitions. [2018-12-01 22:20:56,988 INFO L78 Accepts]: Start accepts. Automaton has 19606 states and 66407 transitions. Word has length 100 [2018-12-01 22:20:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:56,988 INFO L480 AbstractCegarLoop]: Abstraction has 19606 states and 66407 transitions. [2018-12-01 22:20:56,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:20:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19606 states and 66407 transitions. [2018-12-01 22:20:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:57,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:57,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:57,005 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:57,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1566808186, now seen corresponding path program 1 times [2018-12-01 22:20:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:57,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:57,050 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-01 22:20:57,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:57,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:57,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:57,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:57,051 INFO L87 Difference]: Start difference. First operand 19606 states and 66407 transitions. Second operand 6 states. [2018-12-01 22:20:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:57,216 INFO L93 Difference]: Finished difference Result 18765 states and 63186 transitions. [2018-12-01 22:20:57,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:20:57,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 22:20:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:57,237 INFO L225 Difference]: With dead ends: 18765 [2018-12-01 22:20:57,238 INFO L226 Difference]: Without dead ends: 18765 [2018-12-01 22:20:57,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:20:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18765 states. [2018-12-01 22:20:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18765 to 18406. [2018-12-01 22:20:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18406 states. [2018-12-01 22:20:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18406 states to 18406 states and 62132 transitions. [2018-12-01 22:20:57,428 INFO L78 Accepts]: Start accepts. Automaton has 18406 states and 62132 transitions. Word has length 100 [2018-12-01 22:20:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:57,429 INFO L480 AbstractCegarLoop]: Abstraction has 18406 states and 62132 transitions. [2018-12-01 22:20:57,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:20:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 18406 states and 62132 transitions. [2018-12-01 22:20:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:57,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:57,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:57,445 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:57,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 34388921, now seen corresponding path program 1 times [2018-12-01 22:20:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:57,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:57,506 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-01 22:20:57,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:57,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:57,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:57,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:57,507 INFO L87 Difference]: Start difference. First operand 18406 states and 62132 transitions. Second operand 6 states. [2018-12-01 22:20:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:57,733 INFO L93 Difference]: Finished difference Result 19821 states and 65839 transitions. [2018-12-01 22:20:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:20:57,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 22:20:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:57,755 INFO L225 Difference]: With dead ends: 19821 [2018-12-01 22:20:57,756 INFO L226 Difference]: Without dead ends: 19271 [2018-12-01 22:20:57,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19271 states. [2018-12-01 22:20:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19271 to 18586. [2018-12-01 22:20:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18586 states. [2018-12-01 22:20:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18586 states to 18586 states and 62491 transitions. [2018-12-01 22:20:57,950 INFO L78 Accepts]: Start accepts. Automaton has 18586 states and 62491 transitions. Word has length 100 [2018-12-01 22:20:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:57,950 INFO L480 AbstractCegarLoop]: Abstraction has 18586 states and 62491 transitions. [2018-12-01 22:20:57,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:20:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18586 states and 62491 transitions. [2018-12-01 22:20:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:57,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:57,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:57,967 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:57,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1735129400, now seen corresponding path program 1 times [2018-12-01 22:20:57,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:57,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:58,022 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-01 22:20:58,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:58,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:20:58,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:58,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:20:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:20:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:58,022 INFO L87 Difference]: Start difference. First operand 18586 states and 62491 transitions. Second operand 7 states. [2018-12-01 22:20:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:58,226 INFO L93 Difference]: Finished difference Result 19539 states and 65559 transitions. [2018-12-01 22:20:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:20:58,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 22:20:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:58,249 INFO L225 Difference]: With dead ends: 19539 [2018-12-01 22:20:58,249 INFO L226 Difference]: Without dead ends: 19539 [2018-12-01 22:20:58,249 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-01 22:20:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19539 states. [2018-12-01 22:20:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19539 to 18491. [2018-12-01 22:20:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18491 states. [2018-12-01 22:20:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18491 states to 18491 states and 62215 transitions. [2018-12-01 22:20:58,445 INFO L78 Accepts]: Start accepts. Automaton has 18491 states and 62215 transitions. Word has length 100 [2018-12-01 22:20:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:58,445 INFO L480 AbstractCegarLoop]: Abstraction has 18491 states and 62215 transitions. [2018-12-01 22:20:58,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:20:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18491 states and 62215 transitions. [2018-12-01 22:20:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:58,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:58,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:58,461 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:58,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:58,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1148958376, now seen corresponding path program 1 times [2018-12-01 22:20:58,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:58,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:58,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:58,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:58,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:58,519 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-01 22:20:58,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:58,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:20:58,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:58,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:20:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:20:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:20:58,519 INFO L87 Difference]: Start difference. First operand 18491 states and 62215 transitions. Second operand 5 states. [2018-12-01 22:20:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:58,618 INFO L93 Difference]: Finished difference Result 17087 states and 57629 transitions. [2018-12-01 22:20:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:20:58,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 22:20:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:58,638 INFO L225 Difference]: With dead ends: 17087 [2018-12-01 22:20:58,639 INFO L226 Difference]: Without dead ends: 17087 [2018-12-01 22:20:58,639 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-01 22:20:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17087 states. [2018-12-01 22:20:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17087 to 16902. [2018-12-01 22:20:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16902 states. [2018-12-01 22:20:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16902 states to 16902 states and 57111 transitions. [2018-12-01 22:20:58,812 INFO L78 Accepts]: Start accepts. Automaton has 16902 states and 57111 transitions. Word has length 100 [2018-12-01 22:20:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:58,812 INFO L480 AbstractCegarLoop]: Abstraction has 16902 states and 57111 transitions. [2018-12-01 22:20:58,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:20:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16902 states and 57111 transitions. [2018-12-01 22:20:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:20:58,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:58,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:58,828 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:58,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1210348633, now seen corresponding path program 1 times [2018-12-01 22:20:58,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:58,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:58,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:58,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:58,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:58,900 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-01 22:20:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:58,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:58,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:58,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:58,900 INFO L87 Difference]: Start difference. First operand 16902 states and 57111 transitions. Second operand 6 states. [2018-12-01 22:20:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:59,057 INFO L93 Difference]: Finished difference Result 10950 states and 35655 transitions. [2018-12-01 22:20:59,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:20:59,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 22:20:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:59,069 INFO L225 Difference]: With dead ends: 10950 [2018-12-01 22:20:59,069 INFO L226 Difference]: Without dead ends: 10950 [2018-12-01 22:20:59,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:59,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2018-12-01 22:20:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 9461. [2018-12-01 22:20:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9461 states. [2018-12-01 22:20:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9461 states to 9461 states and 31041 transitions. [2018-12-01 22:20:59,165 INFO L78 Accepts]: Start accepts. Automaton has 9461 states and 31041 transitions. Word has length 100 [2018-12-01 22:20:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 9461 states and 31041 transitions. [2018-12-01 22:20:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:20:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9461 states and 31041 transitions. [2018-12-01 22:20:59,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:20:59,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:59,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:59,173 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:59,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-01 22:20:59,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:59,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:59,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:59,229 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-01 22:20:59,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:59,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:20:59,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:59,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:20:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:20:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:20:59,230 INFO L87 Difference]: Start difference. First operand 9461 states and 31041 transitions. Second operand 7 states. [2018-12-01 22:20:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:59,565 INFO L93 Difference]: Finished difference Result 17675 states and 57162 transitions. [2018-12-01 22:20:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 22:20:59,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 22:20:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:59,584 INFO L225 Difference]: With dead ends: 17675 [2018-12-01 22:20:59,585 INFO L226 Difference]: Without dead ends: 17547 [2018-12-01 22:20:59,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-01 22:20:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17547 states. [2018-12-01 22:20:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17547 to 13761. [2018-12-01 22:20:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-01 22:20:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45029 transitions. [2018-12-01 22:20:59,737 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45029 transitions. Word has length 102 [2018-12-01 22:20:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:20:59,737 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45029 transitions. [2018-12-01 22:20:59,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:20:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45029 transitions. [2018-12-01 22:20:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:20:59,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:20:59,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:20:59,748 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:20:59,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:20:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-01 22:20:59,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:20:59,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:59,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:20:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:20:59,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:20:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:20:59,819 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-01 22:20:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:20:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:20:59,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:20:59,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:20:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:20:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:20:59,820 INFO L87 Difference]: Start difference. First operand 13761 states and 45029 transitions. Second operand 6 states. [2018-12-01 22:20:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:20:59,929 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-01 22:20:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 22:20:59,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 22:20:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:20:59,945 INFO L225 Difference]: With dead ends: 14001 [2018-12-01 22:20:59,945 INFO L226 Difference]: Without dead ends: 14001 [2018-12-01 22:20:59,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-01 22:20:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-01 22:21:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-01 22:21:00,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-01 22:21:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-01 22:21:00,076 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-01 22:21:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:00,076 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-01 22:21:00,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:21:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-01 22:21:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:00,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:00,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:00,086 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-01 22:21:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:00,136 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-01 22:21:00,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:00,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:21:00,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:00,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:21:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:21:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:21:00,137 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-01 22:21:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:00,299 INFO L93 Difference]: Finished difference Result 15970 states and 51436 transitions. [2018-12-01 22:21:00,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:21:00,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 22:21:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:00,315 INFO L225 Difference]: With dead ends: 15970 [2018-12-01 22:21:00,316 INFO L226 Difference]: Without dead ends: 15970 [2018-12-01 22:21:00,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:21:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15970 states. [2018-12-01 22:21:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15970 to 13806. [2018-12-01 22:21:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2018-12-01 22:21:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 44760 transitions. [2018-12-01 22:21:00,453 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 44760 transitions. Word has length 102 [2018-12-01 22:21:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:00,453 INFO L480 AbstractCegarLoop]: Abstraction has 13806 states and 44760 transitions. [2018-12-01 22:21:00,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:21:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 44760 transitions. [2018-12-01 22:21:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:00,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:00,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:00,464 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:00,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -668679505, now seen corresponding path program 1 times [2018-12-01 22:21:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:00,505 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-01 22:21:00,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:00,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:21:00,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:00,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:21:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:21:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:21:00,506 INFO L87 Difference]: Start difference. First operand 13806 states and 44760 transitions. Second operand 5 states. [2018-12-01 22:21:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:00,650 INFO L93 Difference]: Finished difference Result 15598 states and 50520 transitions. [2018-12-01 22:21:00,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:21:00,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 22:21:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:00,667 INFO L225 Difference]: With dead ends: 15598 [2018-12-01 22:21:00,667 INFO L226 Difference]: Without dead ends: 15470 [2018-12-01 22:21:00,668 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-01 22:21:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15470 states. [2018-12-01 22:21:00,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15470 to 11520. [2018-12-01 22:21:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11520 states. [2018-12-01 22:21:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 37527 transitions. [2018-12-01 22:21:00,801 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 37527 transitions. Word has length 102 [2018-12-01 22:21:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:00,801 INFO L480 AbstractCegarLoop]: Abstraction has 11520 states and 37527 transitions. [2018-12-01 22:21:00,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:21:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 37527 transitions. [2018-12-01 22:21:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:00,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:00,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:00,811 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:00,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 576084976, now seen corresponding path program 1 times [2018-12-01 22:21:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:00,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:00,902 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-01 22:21:00,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:00,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-01 22:21:00,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:00,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 22:21:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 22:21:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:21:00,903 INFO L87 Difference]: Start difference. First operand 11520 states and 37527 transitions. Second operand 10 states. [2018-12-01 22:21:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:01,224 INFO L93 Difference]: Finished difference Result 21916 states and 71836 transitions. [2018-12-01 22:21:01,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 22:21:01,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-01 22:21:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:01,237 INFO L225 Difference]: With dead ends: 21916 [2018-12-01 22:21:01,237 INFO L226 Difference]: Without dead ends: 10860 [2018-12-01 22:21:01,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-01 22:21:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2018-12-01 22:21:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 10860. [2018-12-01 22:21:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10860 states. [2018-12-01 22:21:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 35591 transitions. [2018-12-01 22:21:01,342 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 35591 transitions. Word has length 102 [2018-12-01 22:21:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:01,342 INFO L480 AbstractCegarLoop]: Abstraction has 10860 states and 35591 transitions. [2018-12-01 22:21:01,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 22:21:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 35591 transitions. [2018-12-01 22:21:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:01,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:01,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:01,350 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:01,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1577961002, now seen corresponding path program 2 times [2018-12-01 22:21:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:01,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:01,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:01,426 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-01 22:21:01,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:01,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:21:01,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:01,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:21:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:21:01,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:21:01,427 INFO L87 Difference]: Start difference. First operand 10860 states and 35591 transitions. Second operand 7 states. [2018-12-01 22:21:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:01,610 INFO L93 Difference]: Finished difference Result 18110 states and 60250 transitions. [2018-12-01 22:21:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:21:01,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 22:21:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:01,619 INFO L225 Difference]: With dead ends: 18110 [2018-12-01 22:21:01,619 INFO L226 Difference]: Without dead ends: 7461 [2018-12-01 22:21:01,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-01 22:21:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-01 22:21:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-01 22:21:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-01 22:21:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25211 transitions. [2018-12-01 22:21:01,761 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25211 transitions. Word has length 102 [2018-12-01 22:21:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:01,761 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25211 transitions. [2018-12-01 22:21:01,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:21:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25211 transitions. [2018-12-01 22:21:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:01,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:01,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:01,767 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:01,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:01,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1340703688, now seen corresponding path program 1 times [2018-12-01 22:21:01,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:01,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:01,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:21:01,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:01,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:21:01,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:01,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:21:01,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:01,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:21:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:21:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:21:01,822 INFO L87 Difference]: Start difference. First operand 7461 states and 25211 transitions. Second operand 7 states. [2018-12-01 22:21:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:02,014 INFO L93 Difference]: Finished difference Result 9597 states and 31665 transitions. [2018-12-01 22:21:02,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 22:21:02,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 22:21:02,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:02,024 INFO L225 Difference]: With dead ends: 9597 [2018-12-01 22:21:02,025 INFO L226 Difference]: Without dead ends: 9461 [2018-12-01 22:21:02,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-01 22:21:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2018-12-01 22:21:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 7445. [2018-12-01 22:21:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2018-12-01 22:21:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 25119 transitions. [2018-12-01 22:21:02,104 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 25119 transitions. Word has length 102 [2018-12-01 22:21:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:02,104 INFO L480 AbstractCegarLoop]: Abstraction has 7445 states and 25119 transitions. [2018-12-01 22:21:02,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:21:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 25119 transitions. [2018-12-01 22:21:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:02,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:02,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:02,110 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:02,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:02,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1018603321, now seen corresponding path program 1 times [2018-12-01 22:21:02,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:02,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:02,159 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-01 22:21:02,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:02,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:21:02,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:02,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:21:02,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:21:02,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:21:02,160 INFO L87 Difference]: Start difference. First operand 7445 states and 25119 transitions. Second operand 7 states. [2018-12-01 22:21:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:02,307 INFO L93 Difference]: Finished difference Result 14873 states and 50598 transitions. [2018-12-01 22:21:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 22:21:02,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-01 22:21:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:02,325 INFO L225 Difference]: With dead ends: 14873 [2018-12-01 22:21:02,325 INFO L226 Difference]: Without dead ends: 14873 [2018-12-01 22:21:02,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-01 22:21:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14873 states. [2018-12-01 22:21:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14873 to 7605. [2018-12-01 22:21:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7605 states. [2018-12-01 22:21:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7605 states to 7605 states and 25535 transitions. [2018-12-01 22:21:02,432 INFO L78 Accepts]: Start accepts. Automaton has 7605 states and 25535 transitions. Word has length 102 [2018-12-01 22:21:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:02,432 INFO L480 AbstractCegarLoop]: Abstraction has 7605 states and 25535 transitions. [2018-12-01 22:21:02,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:21:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 7605 states and 25535 transitions. [2018-12-01 22:21:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:02,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:02,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:02,439 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:02,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash -682137158, now seen corresponding path program 3 times [2018-12-01 22:21:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:02,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:21:02,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:21:02,519 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-01 22:21:02,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:21:02,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-01 22:21:02,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:21:02,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 22:21:02,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 22:21:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-01 22:21:02,520 INFO L87 Difference]: Start difference. First operand 7605 states and 25535 transitions. Second operand 12 states. [2018-12-01 22:21:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:21:02,847 INFO L93 Difference]: Finished difference Result 14809 states and 49866 transitions. [2018-12-01 22:21:02,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 22:21:02,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-01 22:21:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:21:02,858 INFO L225 Difference]: With dead ends: 14809 [2018-12-01 22:21:02,858 INFO L226 Difference]: Without dead ends: 10265 [2018-12-01 22:21:02,858 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-01 22:21:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10265 states. [2018-12-01 22:21:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10265 to 9657. [2018-12-01 22:21:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9657 states. [2018-12-01 22:21:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 31706 transitions. [2018-12-01 22:21:02,954 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 31706 transitions. Word has length 102 [2018-12-01 22:21:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:21:02,954 INFO L480 AbstractCegarLoop]: Abstraction has 9657 states and 31706 transitions. [2018-12-01 22:21:02,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 22:21:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 31706 transitions. [2018-12-01 22:21:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:21:02,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:21:02,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:21:02,962 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:21:02,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:21:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1406537120, now seen corresponding path program 4 times [2018-12-01 22:21:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:21:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:21:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:21:02,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:21:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:21:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:21:03,005 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:21:03,100 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 22:21:03,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:21:03 BasicIcfg [2018-12-01 22:21:03,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:21:03,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:21:03,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:21:03,102 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:21:03,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:18:28" (3/4) ... [2018-12-01 22:21:03,105 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 22:21:03,207 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1c174492-0cf2-4ff7-be3c-1e14c1a4fb23/bin-2019/utaipan/witness.graphml [2018-12-01 22:21:03,207 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:21:03,208 INFO L168 Benchmark]: Toolchain (without parser) took 155055.30 ms. Allocated memory was 1.0 GB in the beginning and 10.5 GB in the end (delta: 9.4 GB). Free memory was 948.1 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 6.1 GB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,208 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:21:03,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,209 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,209 INFO L168 Benchmark]: Boogie Preprocessor took 21.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:21:03,209 INFO L168 Benchmark]: RCFGBuilder took 363.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,209 INFO L168 Benchmark]: TraceAbstraction took 154171.31 ms. Allocated memory was 1.2 GB in the beginning and 10.5 GB in the end (delta: 9.3 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 6.0 GB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,210 INFO L168 Benchmark]: Witness Printer took 105.42 ms. Allocated memory is still 10.5 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-12-01 22:21:03,211 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 363.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.7 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154171.31 ms. Allocated memory was 1.2 GB in the beginning and 10.5 GB in the end (delta: 9.3 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 6.0 GB. Max. memory is 11.5 GB. * Witness Printer took 105.42 ms. Allocated memory is still 10.5 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L776] -1 pthread_t t1500; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L777] FCALL, FORK -1 pthread_create(&t1500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L778] -1 pthread_t t1501; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L779] FCALL, FORK -1 pthread_create(&t1501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L780] -1 pthread_t t1502; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L781] FCALL, FORK -1 pthread_create(&t1502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=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] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=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] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 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) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 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 [L754] 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) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 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 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] 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=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 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 [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] 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=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 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 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -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) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -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 [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -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 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -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) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -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)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -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)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -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)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -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)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -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)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -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)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 154.1s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 54.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8572 SDtfs, 8843 SDslu, 20208 SDs, 0 SdLazy, 7073 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 105 SyntacticMatches, 18 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385502occurred in iteration=9, 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: 80.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 1219639 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3131 NumberOfCodeBlocks, 3131 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2994 ConstructedInterpolants, 0 QuantifiedInterpolants, 618311 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...