./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_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_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/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 ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:56:39,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:56:39,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:56:39,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:56:39,888 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:56:39,888 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:56:39,889 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:56:39,890 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:56:39,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:56:39,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:56:39,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:56:39,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:56:39,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:56:39,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:56:39,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:56:39,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:56:39,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:56:39,897 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:56:39,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:56:39,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:56:39,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:56:39,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:56:39,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:56:39,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:56:39,903 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:56:39,904 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:56:39,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:56:39,905 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:56:39,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:56:39,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:56:39,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:56:39,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:56:39,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:56:39,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:56:39,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:56:39,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:56:39,908 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:56:39,917 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:56:39,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:56:39,918 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:56:39,918 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:56:39,918 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:56:39,919 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:56:39,919 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:56:39,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:56:39,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:56:39,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:56:39,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:56:39,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:56:39,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:56:39,922 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:56:39,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:56:39,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:56:39,922 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:56:39,922 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_54bdd73e-89ac-4253-8125-355c95c9f346/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 -> ddefdc0892046fb9fafc8d7bcb31e874c7cb25a7 [2018-12-09 04:56:39,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:56:39,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:56:39,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:56:39,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:56:39,961 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:56:39,961 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-12-09 04:56:40,005 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/data/81abd3340/0aeba58bc9de4253b708a555d2823227/FLAG8a82e7a2d [2018-12-09 04:56:40,367 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:56:40,367 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/sv-benchmarks/c/pthread-wmm/mix045_pso.opt_false-unreach-call.i [2018-12-09 04:56:40,374 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/data/81abd3340/0aeba58bc9de4253b708a555d2823227/FLAG8a82e7a2d [2018-12-09 04:56:40,773 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/data/81abd3340/0aeba58bc9de4253b708a555d2823227 [2018-12-09 04:56:40,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:56:40,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:56:40,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:56:40,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:56:40,778 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:56:40,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:40" (1/1) ... [2018-12-09 04:56:40,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:40, skipping insertion in model container [2018-12-09 04:56:40,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:40" (1/1) ... [2018-12-09 04:56:40,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:56:40,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:56:41,010 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:56:41,018 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:56:41,101 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:56:41,141 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:56:41,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41 WrapperNode [2018-12-09 04:56:41,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:56:41,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:56:41,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:56:41,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:56:41,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:56:41,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:56:41,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:56:41,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:56:41,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... [2018-12-09 04:56:41,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:56:41,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:56:41,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:56:41,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:56:41,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:56:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 04:56:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 04:56:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 04:56:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 04:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:56:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:56:41,228 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 04:56:41,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:56:41,527 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:56:41,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:41 BoogieIcfgContainer [2018-12-09 04:56:41,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:56:41,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:56:41,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:56:41,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:56:41,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:56:40" (1/3) ... [2018-12-09 04:56:41,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356f897c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:41, skipping insertion in model container [2018-12-09 04:56:41,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:41" (2/3) ... [2018-12-09 04:56:41,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356f897c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:41, skipping insertion in model container [2018-12-09 04:56:41,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:41" (3/3) ... [2018-12-09 04:56:41,532 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt_false-unreach-call.i [2018-12-09 04:56:41,558 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,558 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,558 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,558 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,559 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,560 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,561 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,562 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,563 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,564 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,565 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,566 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,567 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,568 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:56:41,572 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 04:56:41,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:56:41,578 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 04:56:41,587 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 04:56:41,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:56:41,603 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:56:41,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:56:41,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:56:41,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:56:41,603 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:56:41,603 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:56:41,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:56:41,612 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-09 04:56:56,588 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-09 04:56:56,589 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-09 04:56:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 04:56:56,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:56:56,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:56:56,598 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:56:56,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:56:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-09 04:56:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:56:56,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:56:56,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:56:56,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:56:56,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:56:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:56:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:56:56,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:56:56,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:56:56,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:56:56,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:56:56,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:56:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:56:56,757 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-09 04:56:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:56:58,148 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-09 04:56:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:56:58,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 04:56:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:00,609 INFO L225 Difference]: With dead ends: 233474 [2018-12-09 04:57:00,610 INFO L226 Difference]: Without dead ends: 203724 [2018-12-09 04:57:00,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-09 04:57:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-09 04:57:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-09 04:57:04,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-09 04:57:04,109 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-09 04:57:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:04,110 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-09 04:57:04,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-09 04:57:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:57:04,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:04,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] [2018-12-09 04:57:04,117 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:04,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-09 04:57:04,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:04,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:04,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:04,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:04,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:04,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:04,168 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-09 04:57:04,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:04,824 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-09 04:57:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:04,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 04:57:04,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:05,552 INFO L225 Difference]: With dead ends: 118894 [2018-12-09 04:57:05,552 INFO L226 Difference]: Without dead ends: 118894 [2018-12-09 04:57:05,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-09 04:57:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-09 04:57:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-09 04:57:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-09 04:57:10,054 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-09 04:57:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:10,054 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-09 04:57:10,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-09 04:57:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 04:57:10,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:10,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:10,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:10,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-09 04:57:10,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:10,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:10,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:10,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:10,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:10,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:10,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:10,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:10,125 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-09 04:57:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:11,819 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-09 04:57:11,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:57:11,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 04:57:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:12,742 INFO L225 Difference]: With dead ends: 325274 [2018-12-09 04:57:12,742 INFO L226 Difference]: Without dead ends: 324274 [2018-12-09 04:57:12,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-09 04:57:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-09 04:57:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-09 04:57:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-09 04:57:18,111 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-09 04:57:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:18,111 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-09 04:57:18,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-09 04:57:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:57:18,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:18,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:18,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:18,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-09 04:57:18,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:18,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:18,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:18,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:18,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:57:18,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:18,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:57:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:57:18,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:18,156 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 5 states. [2018-12-09 04:57:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:22,531 INFO L93 Difference]: Finished difference Result 334054 states and 1500995 transitions. [2018-12-09 04:57:22,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:57:22,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 04:57:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:23,433 INFO L225 Difference]: With dead ends: 334054 [2018-12-09 04:57:23,433 INFO L226 Difference]: Without dead ends: 333004 [2018-12-09 04:57:23,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:57:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333004 states. [2018-12-09 04:57:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333004 to 194884. [2018-12-09 04:57:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194884 states. [2018-12-09 04:57:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194884 states to 194884 states and 876474 transitions. [2018-12-09 04:57:28,499 INFO L78 Accepts]: Start accepts. Automaton has 194884 states and 876474 transitions. Word has length 53 [2018-12-09 04:57:28,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:28,500 INFO L480 AbstractCegarLoop]: Abstraction has 194884 states and 876474 transitions. [2018-12-09 04:57:28,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:57:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 194884 states and 876474 transitions. [2018-12-09 04:57:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 04:57:28,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:28,523 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] [2018-12-09 04:57:28,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:28,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:28,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1090824439, now seen corresponding path program 1 times [2018-12-09 04:57:28,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:28,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:28,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:28,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:28,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:28,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:28,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:28,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:28,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:28,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:28,570 INFO L87 Difference]: Start difference. First operand 194884 states and 876474 transitions. Second operand 4 states. [2018-12-09 04:57:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:29,699 INFO L93 Difference]: Finished difference Result 172220 states and 761327 transitions. [2018-12-09 04:57:29,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:57:29,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-12-09 04:57:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:30,110 INFO L225 Difference]: With dead ends: 172220 [2018-12-09 04:57:30,110 INFO L226 Difference]: Without dead ends: 169615 [2018-12-09 04:57:30,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169615 states. [2018-12-09 04:57:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169615 to 169615. [2018-12-09 04:57:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-12-09 04:57:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752655 transitions. [2018-12-09 04:57:36,663 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752655 transitions. Word has length 60 [2018-12-09 04:57:36,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:36,663 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752655 transitions. [2018-12-09 04:57:36,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752655 transitions. [2018-12-09 04:57:36,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 04:57:36,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:36,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:36,683 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:36,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1351804609, now seen corresponding path program 1 times [2018-12-09 04:57:36,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:36,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:36,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:36,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:36,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:36,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:36,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:36,735 INFO L87 Difference]: Start difference. First operand 169615 states and 752655 transitions. Second operand 6 states. [2018-12-09 04:57:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:38,399 INFO L93 Difference]: Finished difference Result 292571 states and 1274504 transitions. [2018-12-09 04:57:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:57:38,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 04:57:38,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:39,408 INFO L225 Difference]: With dead ends: 292571 [2018-12-09 04:57:39,408 INFO L226 Difference]: Without dead ends: 291731 [2018-12-09 04:57:39,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:57:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291731 states. [2018-12-09 04:57:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291731 to 164647. [2018-12-09 04:57:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-12-09 04:57:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730661 transitions. [2018-12-09 04:57:43,977 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730661 transitions. Word has length 61 [2018-12-09 04:57:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:43,977 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730661 transitions. [2018-12-09 04:57:43,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:57:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730661 transitions. [2018-12-09 04:57:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 04:57:44,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:44,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:44,040 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:44,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash 368125063, now seen corresponding path program 1 times [2018-12-09 04:57:44,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:44,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:44,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:44,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:44,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:44,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:44,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:57:44,083 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:44,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:57:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:57:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:44,083 INFO L87 Difference]: Start difference. First operand 164647 states and 730661 transitions. Second operand 3 states. [2018-12-09 04:57:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:44,818 INFO L93 Difference]: Finished difference Result 164647 states and 730625 transitions. [2018-12-09 04:57:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:57:44,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 04:57:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:45,221 INFO L225 Difference]: With dead ends: 164647 [2018-12-09 04:57:45,221 INFO L226 Difference]: Without dead ends: 164647 [2018-12-09 04:57:45,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:57:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164647 states. [2018-12-09 04:57:48,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164647 to 164647. [2018-12-09 04:57:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164647 states. [2018-12-09 04:57:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164647 states to 164647 states and 730625 transitions. [2018-12-09 04:57:51,392 INFO L78 Accepts]: Start accepts. Automaton has 164647 states and 730625 transitions. Word has length 68 [2018-12-09 04:57:51,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:51,393 INFO L480 AbstractCegarLoop]: Abstraction has 164647 states and 730625 transitions. [2018-12-09 04:57:51,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:57:51,393 INFO L276 IsEmpty]: Start isEmpty. Operand 164647 states and 730625 transitions. [2018-12-09 04:57:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 04:57:51,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:51,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:51,452 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:51,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1669931226, now seen corresponding path program 1 times [2018-12-09 04:57:51,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:51,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:51,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:51,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:51,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:51,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:57:51,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:51,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:57:51,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:57:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:57:51,503 INFO L87 Difference]: Start difference. First operand 164647 states and 730625 transitions. Second operand 4 states. [2018-12-09 04:57:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:57:52,908 INFO L93 Difference]: Finished difference Result 264423 states and 1158909 transitions. [2018-12-09 04:57:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:57:52,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-09 04:57:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:57:53,877 INFO L225 Difference]: With dead ends: 264423 [2018-12-09 04:57:53,877 INFO L226 Difference]: Without dead ends: 263063 [2018-12-09 04:57:53,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:57:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263063 states. [2018-12-09 04:57:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263063 to 220279. [2018-12-09 04:57:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220279 states. [2018-12-09 04:57:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220279 states to 220279 states and 974873 transitions. [2018-12-09 04:57:58,974 INFO L78 Accepts]: Start accepts. Automaton has 220279 states and 974873 transitions. Word has length 68 [2018-12-09 04:57:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:57:58,974 INFO L480 AbstractCegarLoop]: Abstraction has 220279 states and 974873 transitions. [2018-12-09 04:57:58,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:57:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 220279 states and 974873 transitions. [2018-12-09 04:57:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 04:57:59,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:57:59,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:57:59,065 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:57:59,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:57:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -316621529, now seen corresponding path program 1 times [2018-12-09 04:57:59,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:57:59,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:59,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:57:59,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:57:59,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:57:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:57:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:57:59,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:57:59,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:57:59,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:57:59,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:57:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:57:59,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:57:59,151 INFO L87 Difference]: Start difference. First operand 220279 states and 974873 transitions. Second operand 6 states. [2018-12-09 04:58:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:02,019 INFO L93 Difference]: Finished difference Result 441807 states and 1933390 transitions. [2018-12-09 04:58:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:58:02,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-09 04:58:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:03,216 INFO L225 Difference]: With dead ends: 441807 [2018-12-09 04:58:03,216 INFO L226 Difference]: Without dead ends: 440527 [2018-12-09 04:58:03,216 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-09 04:58:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440527 states. [2018-12-09 04:58:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440527 to 253351. [2018-12-09 04:58:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253351 states. [2018-12-09 04:58:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253351 states to 253351 states and 1112981 transitions. [2018-12-09 04:58:13,494 INFO L78 Accepts]: Start accepts. Automaton has 253351 states and 1112981 transitions. Word has length 68 [2018-12-09 04:58:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 253351 states and 1112981 transitions. [2018-12-09 04:58:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:58:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 253351 states and 1112981 transitions. [2018-12-09 04:58:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 04:58:13,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:13,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:58:13,612 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:13,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1875791031, now seen corresponding path program 1 times [2018-12-09 04:58:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:13,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:13,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:13,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:13,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:58:13,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:13,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:58:13,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:58:13,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:58:13,640 INFO L87 Difference]: Start difference. First operand 253351 states and 1112981 transitions. Second operand 3 states. [2018-12-09 04:58:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:15,511 INFO L93 Difference]: Finished difference Result 309531 states and 1343548 transitions. [2018-12-09 04:58:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:58:15,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-09 04:58:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:16,304 INFO L225 Difference]: With dead ends: 309531 [2018-12-09 04:58:16,304 INFO L226 Difference]: Without dead ends: 309531 [2018-12-09 04:58:16,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:58:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309531 states. [2018-12-09 04:58:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309531 to 270479. [2018-12-09 04:58:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270479 states. [2018-12-09 04:58:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270479 states to 270479 states and 1183827 transitions. [2018-12-09 04:58:22,690 INFO L78 Accepts]: Start accepts. Automaton has 270479 states and 1183827 transitions. Word has length 70 [2018-12-09 04:58:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:22,691 INFO L480 AbstractCegarLoop]: Abstraction has 270479 states and 1183827 transitions. [2018-12-09 04:58:22,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:58:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 270479 states and 1183827 transitions. [2018-12-09 04:58:22,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 04:58:22,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:22,874 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] [2018-12-09 04:58:22,874 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:22,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:22,874 INFO L82 PathProgramCache]: Analyzing trace with hash 850728020, now seen corresponding path program 1 times [2018-12-09 04:58:22,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:22,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:22,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:22,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:22,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:22,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:58:22,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:22,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:58:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:58:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:58:22,939 INFO L87 Difference]: Start difference. First operand 270479 states and 1183827 transitions. Second operand 7 states. [2018-12-09 04:58:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:28,087 INFO L93 Difference]: Finished difference Result 481371 states and 2082099 transitions. [2018-12-09 04:58:28,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 04:58:28,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 04:58:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:29,397 INFO L225 Difference]: With dead ends: 481371 [2018-12-09 04:58:29,397 INFO L226 Difference]: Without dead ends: 480091 [2018-12-09 04:58:29,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-09 04:58:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480091 states. [2018-12-09 04:58:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480091 to 278295. [2018-12-09 04:58:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278295 states. [2018-12-09 04:58:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278295 states to 278295 states and 1216453 transitions. [2018-12-09 04:58:37,451 INFO L78 Accepts]: Start accepts. Automaton has 278295 states and 1216453 transitions. Word has length 74 [2018-12-09 04:58:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:37,451 INFO L480 AbstractCegarLoop]: Abstraction has 278295 states and 1216453 transitions. [2018-12-09 04:58:37,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:58:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 278295 states and 1216453 transitions. [2018-12-09 04:58:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 04:58:37,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:37,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:58:37,643 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:37,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1099982789, now seen corresponding path program 1 times [2018-12-09 04:58:37,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:37,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:37,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:37,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:37,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:58:37,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:58:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:58:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:58:37,687 INFO L87 Difference]: Start difference. First operand 278295 states and 1216453 transitions. Second operand 5 states. [2018-12-09 04:58:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:38,118 INFO L93 Difference]: Finished difference Result 103695 states and 412723 transitions. [2018-12-09 04:58:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:58:38,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 04:58:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:38,339 INFO L225 Difference]: With dead ends: 103695 [2018-12-09 04:58:38,339 INFO L226 Difference]: Without dead ends: 101383 [2018-12-09 04:58:38,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:58:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101383 states. [2018-12-09 04:58:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101383 to 101383. [2018-12-09 04:58:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101383 states. [2018-12-09 04:58:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101383 states to 101383 states and 404069 transitions. [2018-12-09 04:58:40,285 INFO L78 Accepts]: Start accepts. Automaton has 101383 states and 404069 transitions. Word has length 75 [2018-12-09 04:58:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 101383 states and 404069 transitions. [2018-12-09 04:58:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:58:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 101383 states and 404069 transitions. [2018-12-09 04:58:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 04:58:40,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:40,339 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] [2018-12-09 04:58:40,339 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:40,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:40,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2101075152, now seen corresponding path program 1 times [2018-12-09 04:58:40,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:40,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:40,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:40,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:40,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:40,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:40,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:58:40,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:40,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:58:40,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:58:40,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:40,391 INFO L87 Difference]: Start difference. First operand 101383 states and 404069 transitions. Second operand 4 states. [2018-12-09 04:58:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:41,000 INFO L93 Difference]: Finished difference Result 137259 states and 541050 transitions. [2018-12-09 04:58:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:58:41,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 04:58:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:41,303 INFO L225 Difference]: With dead ends: 137259 [2018-12-09 04:58:41,304 INFO L226 Difference]: Without dead ends: 137259 [2018-12-09 04:58:41,304 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-09 04:58:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137259 states. [2018-12-09 04:58:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137259 to 106891. [2018-12-09 04:58:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106891 states. [2018-12-09 04:58:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106891 states to 106891 states and 424746 transitions. [2018-12-09 04:58:43,381 INFO L78 Accepts]: Start accepts. Automaton has 106891 states and 424746 transitions. Word has length 81 [2018-12-09 04:58:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:43,382 INFO L480 AbstractCegarLoop]: Abstraction has 106891 states and 424746 transitions. [2018-12-09 04:58:43,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:58:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 106891 states and 424746 transitions. [2018-12-09 04:58:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 04:58:43,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:43,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] [2018-12-09 04:58:43,442 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:43,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:43,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1509145552, now seen corresponding path program 1 times [2018-12-09 04:58:43,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:43,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:43,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:43,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:43,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:58:43,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:43,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:58:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:58:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:43,482 INFO L87 Difference]: Start difference. First operand 106891 states and 424746 transitions. Second operand 4 states. [2018-12-09 04:58:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:44,634 INFO L93 Difference]: Finished difference Result 146326 states and 574564 transitions. [2018-12-09 04:58:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:58:44,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 04:58:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:44,956 INFO L225 Difference]: With dead ends: 146326 [2018-12-09 04:58:44,956 INFO L226 Difference]: Without dead ends: 146326 [2018-12-09 04:58:44,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:58:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146326 states. [2018-12-09 04:58:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146326 to 133031. [2018-12-09 04:58:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133031 states. [2018-12-09 04:58:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133031 states to 133031 states and 525207 transitions. [2018-12-09 04:58:48,454 INFO L78 Accepts]: Start accepts. Automaton has 133031 states and 525207 transitions. Word has length 81 [2018-12-09 04:58:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:48,454 INFO L480 AbstractCegarLoop]: Abstraction has 133031 states and 525207 transitions. [2018-12-09 04:58:48,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:58:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 133031 states and 525207 transitions. [2018-12-09 04:58:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 04:58:48,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:48,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:58:48,533 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:48,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1060340847, now seen corresponding path program 1 times [2018-12-09 04:58:48,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:48,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:48,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:58:48,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:58:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:58:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:58:48,631 INFO L87 Difference]: Start difference. First operand 133031 states and 525207 transitions. Second operand 8 states. [2018-12-09 04:58:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:50,429 INFO L93 Difference]: Finished difference Result 194789 states and 751751 transitions. [2018-12-09 04:58:50,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 04:58:50,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-09 04:58:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:50,836 INFO L225 Difference]: With dead ends: 194789 [2018-12-09 04:58:50,836 INFO L226 Difference]: Without dead ends: 193189 [2018-12-09 04:58:50,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:58:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193189 states. [2018-12-09 04:58:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193189 to 144856. [2018-12-09 04:58:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144856 states. [2018-12-09 04:58:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144856 states to 144856 states and 569157 transitions. [2018-12-09 04:58:53,625 INFO L78 Accepts]: Start accepts. Automaton has 144856 states and 569157 transitions. Word has length 81 [2018-12-09 04:58:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:53,626 INFO L480 AbstractCegarLoop]: Abstraction has 144856 states and 569157 transitions. [2018-12-09 04:58:53,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:58:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 144856 states and 569157 transitions. [2018-12-09 04:58:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 04:58:53,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:53,721 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] [2018-12-09 04:58:53,721 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:53,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:53,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1353743854, now seen corresponding path program 1 times [2018-12-09 04:58:53,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:53,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:53,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:53,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:53,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:53,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:58:53,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:53,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:58:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:58:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:58:53,791 INFO L87 Difference]: Start difference. First operand 144856 states and 569157 transitions. Second operand 6 states. [2018-12-09 04:58:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:54,862 INFO L93 Difference]: Finished difference Result 156050 states and 608690 transitions. [2018-12-09 04:58:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:58:54,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 04:58:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:55,181 INFO L225 Difference]: With dead ends: 156050 [2018-12-09 04:58:55,181 INFO L226 Difference]: Without dead ends: 156050 [2018-12-09 04:58:55,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:58:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156050 states. [2018-12-09 04:58:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156050 to 148143. [2018-12-09 04:58:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148143 states. [2018-12-09 04:58:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148143 states to 148143 states and 580735 transitions. [2018-12-09 04:58:57,748 INFO L78 Accepts]: Start accepts. Automaton has 148143 states and 580735 transitions. Word has length 81 [2018-12-09 04:58:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:57,748 INFO L480 AbstractCegarLoop]: Abstraction has 148143 states and 580735 transitions. [2018-12-09 04:58:57,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:58:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 148143 states and 580735 transitions. [2018-12-09 04:58:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 04:58:57,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:57,846 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] [2018-12-09 04:58:57,847 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:57,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:57,847 INFO L82 PathProgramCache]: Analyzing trace with hash -392129837, now seen corresponding path program 1 times [2018-12-09 04:58:57,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:57,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:57,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-09 04:58:57,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:57,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:58:57,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:57,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:58:57,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:58:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:58:57,890 INFO L87 Difference]: Start difference. First operand 148143 states and 580735 transitions. Second operand 6 states. [2018-12-09 04:58:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:57,977 INFO L93 Difference]: Finished difference Result 23151 states and 77583 transitions. [2018-12-09 04:58:57,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:58:57,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 04:58:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:58,004 INFO L225 Difference]: With dead ends: 23151 [2018-12-09 04:58:58,004 INFO L226 Difference]: Without dead ends: 19817 [2018-12-09 04:58:58,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:58:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19817 states. [2018-12-09 04:58:58,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19817 to 18332. [2018-12-09 04:58:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18332 states. [2018-12-09 04:58:58,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18332 states to 18332 states and 61725 transitions. [2018-12-09 04:58:58,219 INFO L78 Accepts]: Start accepts. Automaton has 18332 states and 61725 transitions. Word has length 81 [2018-12-09 04:58:58,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:58,219 INFO L480 AbstractCegarLoop]: Abstraction has 18332 states and 61725 transitions. [2018-12-09 04:58:58,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:58:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 18332 states and 61725 transitions. [2018-12-09 04:58:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 04:58:58,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:58,237 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-09 04:58:58,237 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:58,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:58,237 INFO L82 PathProgramCache]: Analyzing trace with hash 889360496, now seen corresponding path program 1 times [2018-12-09 04:58:58,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:58,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:58,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:58,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:58,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:58,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:58,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:58:58,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:58:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:58:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:58:58,291 INFO L87 Difference]: Start difference. First operand 18332 states and 61725 transitions. Second operand 5 states. [2018-12-09 04:58:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:58,453 INFO L93 Difference]: Finished difference Result 19982 states and 66740 transitions. [2018-12-09 04:58:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:58:58,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 04:58:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:58,477 INFO L225 Difference]: With dead ends: 19982 [2018-12-09 04:58:58,477 INFO L226 Difference]: Without dead ends: 19982 [2018-12-09 04:58:58,477 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-09 04:58:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19982 states. [2018-12-09 04:58:58,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19982 to 18522. [2018-12-09 04:58:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18522 states. [2018-12-09 04:58:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18522 states to 18522 states and 62397 transitions. [2018-12-09 04:58:58,691 INFO L78 Accepts]: Start accepts. Automaton has 18522 states and 62397 transitions. Word has length 100 [2018-12-09 04:58:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:58,691 INFO L480 AbstractCegarLoop]: Abstraction has 18522 states and 62397 transitions. [2018-12-09 04:58:58,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:58:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18522 states and 62397 transitions. [2018-12-09 04:58:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 04:58:58,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:58,709 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-09 04:58:58,709 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:58,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 577337737, now seen corresponding path program 1 times [2018-12-09 04:58:58,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:58,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:58,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:58,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:58,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:58,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:58:58,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:58,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:58:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:58:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:58,756 INFO L87 Difference]: Start difference. First operand 18522 states and 62397 transitions. Second operand 4 states. [2018-12-09 04:58:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:58,881 INFO L93 Difference]: Finished difference Result 21388 states and 71282 transitions. [2018-12-09 04:58:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:58:58,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 04:58:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:58,909 INFO L225 Difference]: With dead ends: 21388 [2018-12-09 04:58:58,909 INFO L226 Difference]: Without dead ends: 21248 [2018-12-09 04:58:58,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21248 states. [2018-12-09 04:58:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21248 to 20940. [2018-12-09 04:58:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20940 states. [2018-12-09 04:58:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20940 states to 20940 states and 69990 transitions. [2018-12-09 04:58:59,272 INFO L78 Accepts]: Start accepts. Automaton has 20940 states and 69990 transitions. Word has length 100 [2018-12-09 04:58:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:59,273 INFO L480 AbstractCegarLoop]: Abstraction has 20940 states and 69990 transitions. [2018-12-09 04:58:59,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:58:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 20940 states and 69990 transitions. [2018-12-09 04:58:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 04:58:59,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:59,290 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-09 04:58:59,290 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:59,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:59,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1546918760, now seen corresponding path program 1 times [2018-12-09 04:58:59,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:59,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:59,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:59,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:59,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:59,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:59,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:58:59,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:59,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:58:59,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:58:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:59,316 INFO L87 Difference]: Start difference. First operand 20940 states and 69990 transitions. Second operand 4 states. [2018-12-09 04:58:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:58:59,485 INFO L93 Difference]: Finished difference Result 25369 states and 85000 transitions. [2018-12-09 04:58:59,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:58:59,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 04:58:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:58:59,519 INFO L225 Difference]: With dead ends: 25369 [2018-12-09 04:58:59,519 INFO L226 Difference]: Without dead ends: 25369 [2018-12-09 04:58:59,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:58:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25369 states. [2018-12-09 04:58:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25369 to 20265. [2018-12-09 04:58:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20265 states. [2018-12-09 04:58:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20265 states to 20265 states and 67465 transitions. [2018-12-09 04:58:59,773 INFO L78 Accepts]: Start accepts. Automaton has 20265 states and 67465 transitions. Word has length 100 [2018-12-09 04:58:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:58:59,774 INFO L480 AbstractCegarLoop]: Abstraction has 20265 states and 67465 transitions. [2018-12-09 04:58:59,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:58:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 20265 states and 67465 transitions. [2018-12-09 04:58:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 04:58:59,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:58:59,792 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-09 04:58:59,792 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:58:59,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:58:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 811075834, now seen corresponding path program 2 times [2018-12-09 04:58:59,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:58:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:58:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:58:59,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:58:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:58:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:58:59,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:58:59,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:58:59,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:58:59,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:58:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:58:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:58:59,832 INFO L87 Difference]: Start difference. First operand 20265 states and 67465 transitions. Second operand 5 states. [2018-12-09 04:59:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:00,002 INFO L93 Difference]: Finished difference Result 22241 states and 73593 transitions. [2018-12-09 04:59:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:59:00,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 04:59:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:00,027 INFO L225 Difference]: With dead ends: 22241 [2018-12-09 04:59:00,027 INFO L226 Difference]: Without dead ends: 22101 [2018-12-09 04:59:00,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:59:00,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22101 states. [2018-12-09 04:59:00,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22101 to 20075. [2018-12-09 04:59:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20075 states. [2018-12-09 04:59:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20075 states to 20075 states and 66783 transitions. [2018-12-09 04:59:00,234 INFO L78 Accepts]: Start accepts. Automaton has 20075 states and 66783 transitions. Word has length 100 [2018-12-09 04:59:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:00,234 INFO L480 AbstractCegarLoop]: Abstraction has 20075 states and 66783 transitions. [2018-12-09 04:59:00,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:59:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 20075 states and 66783 transitions. [2018-12-09 04:59:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 04:59:00,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:00,250 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-09 04:59:00,250 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:00,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -598220666, now seen corresponding path program 1 times [2018-12-09 04:59:00,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:00,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:59:00,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:00,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:00,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:00,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:00,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:00,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:00,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:00,320 INFO L87 Difference]: Start difference. First operand 20075 states and 66783 transitions. Second operand 6 states. [2018-12-09 04:59:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:00,625 INFO L93 Difference]: Finished difference Result 21995 states and 72079 transitions. [2018-12-09 04:59:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:59:00,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 04:59:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:00,653 INFO L225 Difference]: With dead ends: 21995 [2018-12-09 04:59:00,653 INFO L226 Difference]: Without dead ends: 21370 [2018-12-09 04:59:00,653 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-09 04:59:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21370 states. [2018-12-09 04:59:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21370 to 20905. [2018-12-09 04:59:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20905 states. [2018-12-09 04:59:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20905 states to 20905 states and 69142 transitions. [2018-12-09 04:59:00,867 INFO L78 Accepts]: Start accepts. Automaton has 20905 states and 69142 transitions. Word has length 102 [2018-12-09 04:59:00,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:00,868 INFO L480 AbstractCegarLoop]: Abstraction has 20905 states and 69142 transitions. [2018-12-09 04:59:00,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20905 states and 69142 transitions. [2018-12-09 04:59:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 04:59:00,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:00,885 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-09 04:59:00,885 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:00,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1102519813, now seen corresponding path program 1 times [2018-12-09 04:59:00,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:00,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:00,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-09 04:59:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:59:00,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:00,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:59:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:59:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:00,944 INFO L87 Difference]: Start difference. First operand 20905 states and 69142 transitions. Second operand 7 states. [2018-12-09 04:59:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:01,238 INFO L93 Difference]: Finished difference Result 22399 states and 73925 transitions. [2018-12-09 04:59:01,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:59:01,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 04:59:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:01,263 INFO L225 Difference]: With dead ends: 22399 [2018-12-09 04:59:01,264 INFO L226 Difference]: Without dead ends: 22399 [2018-12-09 04:59:01,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22399 states. [2018-12-09 04:59:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22399 to 20865. [2018-12-09 04:59:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20865 states. [2018-12-09 04:59:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20865 states to 20865 states and 69050 transitions. [2018-12-09 04:59:01,479 INFO L78 Accepts]: Start accepts. Automaton has 20865 states and 69050 transitions. Word has length 102 [2018-12-09 04:59:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:01,479 INFO L480 AbstractCegarLoop]: Abstraction has 20865 states and 69050 transitions. [2018-12-09 04:59:01,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:59:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 20865 states and 69050 transitions. [2018-12-09 04:59:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 04:59:01,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:01,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:01,496 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1781567963, now seen corresponding path program 1 times [2018-12-09 04:59:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:01,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:01,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:01,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:59:01,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:01,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:59:01,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:59:01,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:59:01,551 INFO L87 Difference]: Start difference. First operand 20865 states and 69050 transitions. Second operand 5 states. [2018-12-09 04:59:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:01,660 INFO L93 Difference]: Finished difference Result 18121 states and 59842 transitions. [2018-12-09 04:59:01,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:59:01,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 04:59:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:01,682 INFO L225 Difference]: With dead ends: 18121 [2018-12-09 04:59:01,683 INFO L226 Difference]: Without dead ends: 18121 [2018-12-09 04:59:01,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2018-12-09 04:59:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17636. [2018-12-09 04:59:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17636 states. [2018-12-09 04:59:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17636 states to 17636 states and 58449 transitions. [2018-12-09 04:59:01,905 INFO L78 Accepts]: Start accepts. Automaton has 17636 states and 58449 transitions. Word has length 102 [2018-12-09 04:59:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:01,905 INFO L480 AbstractCegarLoop]: Abstraction has 17636 states and 58449 transitions. [2018-12-09 04:59:01,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:59:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 17636 states and 58449 transitions. [2018-12-09 04:59:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 04:59:01,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:01,920 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-09 04:59:01,920 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:01,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 727195942, now seen corresponding path program 1 times [2018-12-09 04:59:01,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:01,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:01,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:01,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:01,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:01,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:01,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:01,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:01,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:01,996 INFO L87 Difference]: Start difference. First operand 17636 states and 58449 transitions. Second operand 6 states. [2018-12-09 04:59:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:02,107 INFO L93 Difference]: Finished difference Result 14564 states and 47249 transitions. [2018-12-09 04:59:02,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:59:02,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 04:59:02,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:02,124 INFO L225 Difference]: With dead ends: 14564 [2018-12-09 04:59:02,124 INFO L226 Difference]: Without dead ends: 14564 [2018-12-09 04:59:02,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14564 states. [2018-12-09 04:59:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14564 to 12758. [2018-12-09 04:59:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2018-12-09 04:59:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 41647 transitions. [2018-12-09 04:59:02,280 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 41647 transitions. Word has length 102 [2018-12-09 04:59:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:02,280 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 41647 transitions. [2018-12-09 04:59:02,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 41647 transitions. [2018-12-09 04:59:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:02,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:02,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:02,291 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:02,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1551796347, now seen corresponding path program 1 times [2018-12-09 04:59:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:02,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:02,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:02,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:02,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:02,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:02,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:59:02,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:02,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:59:02,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:59:02,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:02,342 INFO L87 Difference]: Start difference. First operand 12758 states and 41647 transitions. Second operand 7 states. [2018-12-09 04:59:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:02,645 INFO L93 Difference]: Finished difference Result 20260 states and 64984 transitions. [2018-12-09 04:59:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 04:59:02,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-09 04:59:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:02,667 INFO L225 Difference]: With dead ends: 20260 [2018-12-09 04:59:02,667 INFO L226 Difference]: Without dead ends: 20260 [2018-12-09 04:59:02,668 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-09 04:59:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20260 states. [2018-12-09 04:59:02,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20260 to 14348. [2018-12-09 04:59:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14348 states. [2018-12-09 04:59:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14348 states to 14348 states and 46679 transitions. [2018-12-09 04:59:02,841 INFO L78 Accepts]: Start accepts. Automaton has 14348 states and 46679 transitions. Word has length 104 [2018-12-09 04:59:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 14348 states and 46679 transitions. [2018-12-09 04:59:02,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:59:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 14348 states and 46679 transitions. [2018-12-09 04:59:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:02,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:02,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:02,854 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:02,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -307031866, now seen corresponding path program 1 times [2018-12-09 04:59:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:02,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:02,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:02,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:02,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:02,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:02,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:02,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:02,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:02,896 INFO L87 Difference]: Start difference. First operand 14348 states and 46679 transitions. Second operand 6 states. [2018-12-09 04:59:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:03,030 INFO L93 Difference]: Finished difference Result 14998 states and 48254 transitions. [2018-12-09 04:59:03,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:59:03,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-09 04:59:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:03,048 INFO L225 Difference]: With dead ends: 14998 [2018-12-09 04:59:03,048 INFO L226 Difference]: Without dead ends: 14998 [2018-12-09 04:59:03,048 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-09 04:59:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14998 states. [2018-12-09 04:59:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14998 to 14348. [2018-12-09 04:59:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14348 states. [2018-12-09 04:59:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14348 states to 14348 states and 46504 transitions. [2018-12-09 04:59:03,203 INFO L78 Accepts]: Start accepts. Automaton has 14348 states and 46504 transitions. Word has length 104 [2018-12-09 04:59:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:03,204 INFO L480 AbstractCegarLoop]: Abstraction has 14348 states and 46504 transitions. [2018-12-09 04:59:03,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14348 states and 46504 transitions. [2018-12-09 04:59:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:03,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:03,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:03,217 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:03,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash -182958619, now seen corresponding path program 1 times [2018-12-09 04:59:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:03,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:03,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:03,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:03,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:03,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:03,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:03,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:03,275 INFO L87 Difference]: Start difference. First operand 14348 states and 46504 transitions. Second operand 6 states. [2018-12-09 04:59:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:03,398 INFO L93 Difference]: Finished difference Result 15103 states and 48713 transitions. [2018-12-09 04:59:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:59:03,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-09 04:59:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:03,415 INFO L225 Difference]: With dead ends: 15103 [2018-12-09 04:59:03,416 INFO L226 Difference]: Without dead ends: 15103 [2018-12-09 04:59:03,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:59:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15103 states. [2018-12-09 04:59:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15103 to 14533. [2018-12-09 04:59:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14533 states. [2018-12-09 04:59:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 47097 transitions. [2018-12-09 04:59:03,574 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 47097 transitions. Word has length 104 [2018-12-09 04:59:03,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 14533 states and 47097 transitions. [2018-12-09 04:59:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 47097 transitions. [2018-12-09 04:59:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:03,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:03,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:03,588 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:03,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash 205080899, now seen corresponding path program 1 times [2018-12-09 04:59:03,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:03,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:03,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:03,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:03,649 INFO L87 Difference]: Start difference. First operand 14533 states and 47097 transitions. Second operand 6 states. [2018-12-09 04:59:03,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:03,792 INFO L93 Difference]: Finished difference Result 19975 states and 65328 transitions. [2018-12-09 04:59:03,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:59:03,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-09 04:59:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:03,816 INFO L225 Difference]: With dead ends: 19975 [2018-12-09 04:59:03,816 INFO L226 Difference]: Without dead ends: 19975 [2018-12-09 04:59:03,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:59:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2018-12-09 04:59:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 18197. [2018-12-09 04:59:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18197 states. [2018-12-09 04:59:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18197 states to 18197 states and 59636 transitions. [2018-12-09 04:59:04,022 INFO L78 Accepts]: Start accepts. Automaton has 18197 states and 59636 transitions. Word has length 104 [2018-12-09 04:59:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:04,022 INFO L480 AbstractCegarLoop]: Abstraction has 18197 states and 59636 transitions. [2018-12-09 04:59:04,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18197 states and 59636 transitions. [2018-12-09 04:59:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:04,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:04,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:04,040 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:04,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1449845380, now seen corresponding path program 1 times [2018-12-09 04:59:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:04,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:04,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:04,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:04,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:59:04,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:04,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:59:04,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:59:04,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:04,114 INFO L87 Difference]: Start difference. First operand 18197 states and 59636 transitions. Second operand 7 states. [2018-12-09 04:59:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:04,355 INFO L93 Difference]: Finished difference Result 35039 states and 115284 transitions. [2018-12-09 04:59:04,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:59:04,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-09 04:59:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:04,376 INFO L225 Difference]: With dead ends: 35039 [2018-12-09 04:59:04,376 INFO L226 Difference]: Without dead ends: 17119 [2018-12-09 04:59:04,376 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-09 04:59:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17119 states. [2018-12-09 04:59:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17119 to 17111. [2018-12-09 04:59:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2018-12-09 04:59:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 56352 transitions. [2018-12-09 04:59:04,586 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 56352 transitions. Word has length 104 [2018-12-09 04:59:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:04,586 INFO L480 AbstractCegarLoop]: Abstraction has 17111 states and 56352 transitions. [2018-12-09 04:59:04,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:59:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 56352 transitions. [2018-12-09 04:59:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:04,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:04,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:04,602 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:04,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:04,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1624788262, now seen corresponding path program 1 times [2018-12-09 04:59:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:04,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:04,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:04,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:59:04,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:04,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:59:04,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:59:04,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:59:04,657 INFO L87 Difference]: Start difference. First operand 17111 states and 56352 transitions. Second operand 6 states. [2018-12-09 04:59:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:04,840 INFO L93 Difference]: Finished difference Result 17375 states and 57038 transitions. [2018-12-09 04:59:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:59:04,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-09 04:59:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:04,861 INFO L225 Difference]: With dead ends: 17375 [2018-12-09 04:59:04,861 INFO L226 Difference]: Without dead ends: 17295 [2018-12-09 04:59:04,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:59:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17295 states. [2018-12-09 04:59:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17295 to 17039. [2018-12-09 04:59:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17039 states. [2018-12-09 04:59:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17039 states to 17039 states and 56138 transitions. [2018-12-09 04:59:05,050 INFO L78 Accepts]: Start accepts. Automaton has 17039 states and 56138 transitions. Word has length 104 [2018-12-09 04:59:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:05,051 INFO L480 AbstractCegarLoop]: Abstraction has 17039 states and 56138 transitions. [2018-12-09 04:59:05,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:59:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 17039 states and 56138 transitions. [2018-12-09 04:59:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:05,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:05,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:05,067 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:05,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1486831737, now seen corresponding path program 2 times [2018-12-09 04:59:05,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:05,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:59:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:05,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:59:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:59:05,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:59:05,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:59:05,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:59:05,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:59:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:59:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:59:05,109 INFO L87 Difference]: Start difference. First operand 17039 states and 56138 transitions. Second operand 5 states. [2018-12-09 04:59:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:59:05,248 INFO L93 Difference]: Finished difference Result 19215 states and 63146 transitions. [2018-12-09 04:59:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:59:05,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-09 04:59:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:59:05,270 INFO L225 Difference]: With dead ends: 19215 [2018-12-09 04:59:05,270 INFO L226 Difference]: Without dead ends: 19087 [2018-12-09 04:59:05,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:59:05,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2018-12-09 04:59:05,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 15055. [2018-12-09 04:59:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15055 states. [2018-12-09 04:59:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 49718 transitions. [2018-12-09 04:59:05,457 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 49718 transitions. Word has length 104 [2018-12-09 04:59:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:59:05,458 INFO L480 AbstractCegarLoop]: Abstraction has 15055 states and 49718 transitions. [2018-12-09 04:59:05,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:59:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 49718 transitions. [2018-12-09 04:59:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 04:59:05,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:59:05,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:59:05,472 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:59:05,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:59:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 2 times [2018-12-09 04:59:05,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:59:05,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:05,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:59:05,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:59:05,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:59:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:59:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:59:05,523 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:59:05,599 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 04:59:05,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:59:05 BasicIcfg [2018-12-09 04:59:05,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:59:05,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:59:05,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:59:05,601 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:59:05,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:41" (3/4) ... [2018-12-09 04:59:05,603 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:59:05,675 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_54bdd73e-89ac-4253-8125-355c95c9f346/bin-2019/utaipan/witness.graphml [2018-12-09 04:59:05,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:59:05,675 INFO L168 Benchmark]: Toolchain (without parser) took 144900.52 ms. Allocated memory was 1.0 GB in the beginning and 8.5 GB in the end (delta: 7.5 GB). Free memory was 952.4 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,676 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:59:05,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,677 INFO L168 Benchmark]: Boogie Preprocessor took 19.71 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-09 04:59:05,677 INFO L168 Benchmark]: RCFGBuilder took 331.04 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,677 INFO L168 Benchmark]: TraceAbstraction took 144072.63 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.4 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,677 INFO L168 Benchmark]: Witness Printer took 74.17 ms. Allocated memory is still 8.5 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:59:05,678 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.43 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.71 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 331.04 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 144072.63 ms. Allocated memory was 1.2 GB in the beginning and 8.5 GB in the end (delta: 7.4 GB). Free memory was 1.1 GB in the beginning and 4.7 GB in the end (delta: -3.6 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 74.17 ms. Allocated memory is still 8.5 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 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] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1204; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1204, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1205; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1205, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1206; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1206, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L729] 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) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 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) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L766] 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 [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L731] 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 [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_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] [L733] 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 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L768] 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 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] -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) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L799] -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 [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L801] -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 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L808] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L808] -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) [L809] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L809] -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)) [L810] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L810] -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)) [L811] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L811] -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)) [L812] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L812] -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)) [L813] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L813] -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)) [L814] 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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L814] -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)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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, 200 locations, 3 error locations. UNSAFE Result, 144.0s OverallTime, 33 OverallIterations, 1 TraceHistogramMax, 43.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8390 SDtfs, 8177 SDslu, 18139 SDs, 0 SdLazy, 7522 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 86 SyntacticMatches, 21 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278295occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 81.7s AutomataMinimizationTime, 32 MinimizatonAttempts, 1086474 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2791 NumberOfCodeBlocks, 2791 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2655 ConstructedInterpolants, 0 QuantifiedInterpolants, 555603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...