./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc_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_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/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 7a89974c080718a05b9cfe62a5ae979ce71efdb8 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:35:54,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:35:54,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:35:54,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:35:54,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:35:54,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:35:54,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:35:54,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:35:54,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:35:54,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:35:54,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:35:54,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:35:54,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:35:54,186 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:35:54,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:35:54,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:35:54,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:35:54,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:35:54,190 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:35:54,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:35:54,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:35:54,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:35:54,193 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:35:54,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:35:54,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:35:54,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:35:54,194 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:35:54,195 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:35:54,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:35:54,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:35:54,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:35:54,196 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:35:54,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:35:54,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:35:54,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:35:54,197 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:35:54,197 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 12:35:54,205 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:35:54,205 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:35:54,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 12:35:54,206 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 12:35:54,206 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 12:35:54,207 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 12:35:54,207 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 12:35:54,207 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 12:35:54,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:35:54,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:35:54,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:35:54,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:35:54,209 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:35:54,210 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 12:35:54,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:35:54,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:35:54,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 12:35:54,210 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_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/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 -> 7a89974c080718a05b9cfe62a5ae979ce71efdb8 [2018-12-02 12:35:54,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:35:54,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:35:54,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:35:54,241 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:35:54,241 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:35:54,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc_false-unreach-call.i [2018-12-02 12:35:54,277 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/data/a510dcfb7/f9e1e738646c457782df73c639e29a7e/FLAG1077a8357 [2018-12-02 12:35:54,668 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:35:54,668 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/sv-benchmarks/c/pthread-wmm/mix000_rmo.oepc_false-unreach-call.i [2018-12-02 12:35:54,675 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/data/a510dcfb7/f9e1e738646c457782df73c639e29a7e/FLAG1077a8357 [2018-12-02 12:35:55,020 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/data/a510dcfb7/f9e1e738646c457782df73c639e29a7e [2018-12-02 12:35:55,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:35:55,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:35:55,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:35:55,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:35:55,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:35:55,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,044 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 02.12 12:35:55, skipping insertion in model container [2018-12-02 12:35:55,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:35:55,069 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:35:55,251 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:35:55,259 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:35:55,347 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:35:55,381 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:35:55,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55 WrapperNode [2018-12-02 12:35:55,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:35:55,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:35:55,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:35:55,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:35:55,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:35:55,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:35:55,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:35:55,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:35:55,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... [2018-12-02 12:35:55,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:35:55,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:35:55,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:35:55,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:35:55,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 12:35:55,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 12:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 12:35:55,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 12:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 12:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:35:55,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:35:55,499 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 12:35:55,845 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:35:55,845 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 12:35:55,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:55 BoogieIcfgContainer [2018-12-02 12:35:55,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:35:55,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 12:35:55,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 12:35:55,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 12:35:55,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:35:55" (1/3) ... [2018-12-02 12:35:55,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aabeb8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:35:55, skipping insertion in model container [2018-12-02 12:35:55,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:35:55" (2/3) ... [2018-12-02 12:35:55,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aabeb8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:35:55, skipping insertion in model container [2018-12-02 12:35:55,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:55" (3/3) ... [2018-12-02 12:35:55,849 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc_false-unreach-call.i [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,875 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,876 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,877 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,878 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,879 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,880 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,881 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,882 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,883 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,887 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 12:35:55,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 12:35:55,901 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 12:35:55,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 12:35:55,915 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 12:35:55,929 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 12:35:55,930 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 12:35:55,930 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 12:35:55,930 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:35:55,930 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:35:55,930 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 12:35:55,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:35:55,930 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 12:35:55,937 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-02 12:36:03,926 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-02 12:36:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-02 12:36:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:36:03,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:03,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:03,934 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:03,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1413658612, now seen corresponding path program 1 times [2018-12-02 12:36:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:03,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:04,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:04,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:04,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:04,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:04,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:04,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:04,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:04,093 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-02 12:36:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:05,113 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-02 12:36:05,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:36:05,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 12:36:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:05,803 INFO L225 Difference]: With dead ends: 192000 [2018-12-02 12:36:05,803 INFO L226 Difference]: Without dead ends: 135832 [2018-12-02 12:36:05,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-02 12:36:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-02 12:36:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-02 12:36:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-02 12:36:08,602 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-02 12:36:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:08,602 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-02 12:36:08,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-02 12:36:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 12:36:08,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:08,608 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] [2018-12-02 12:36:08,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:08,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 512759921, now seen corresponding path program 1 times [2018-12-02 12:36:08,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:08,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:08,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:08,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:08,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:08,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:08,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:08,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:08,674 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-02 12:36:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:11,437 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-02 12:36:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:11,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 12:36:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:11,827 INFO L225 Difference]: With dead ends: 195844 [2018-12-02 12:36:11,827 INFO L226 Difference]: Without dead ends: 195292 [2018-12-02 12:36:11,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-02 12:36:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-02 12:36:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-02 12:36:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-02 12:36:15,277 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-02 12:36:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:15,278 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-02 12:36:15,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-02 12:36:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 12:36:15,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:15,282 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] [2018-12-02 12:36:15,282 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:15,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1044252158, now seen corresponding path program 1 times [2018-12-02 12:36:15,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:15,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:15,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:15,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:15,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:15,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:15,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:15,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:15,339 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-02 12:36:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:16,600 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-02 12:36:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:36:16,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-02 12:36:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:17,506 INFO L225 Difference]: With dead ends: 253868 [2018-12-02 12:36:17,506 INFO L226 Difference]: Without dead ends: 253356 [2018-12-02 12:36:17,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:36:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-02 12:36:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-02 12:36:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-02 12:36:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-02 12:36:23,513 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-02 12:36:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:23,514 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-02 12:36:23,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-02 12:36:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 12:36:23,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:23,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:23,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:23,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1766694552, now seen corresponding path program 1 times [2018-12-02 12:36:23,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:23,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:23,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:23,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:36:23,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:23,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:36:23,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:36:23,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:23,554 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-02 12:36:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:24,467 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-02 12:36:24,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:36:24,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-02 12:36:24,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:24,951 INFO L225 Difference]: With dead ends: 234162 [2018-12-02 12:36:24,951 INFO L226 Difference]: Without dead ends: 234162 [2018-12-02 12:36:24,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-02 12:36:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-02 12:36:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-02 12:36:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-02 12:36:30,072 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-02 12:36:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:30,072 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-02 12:36:30,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:36:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-02 12:36:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:36:30,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:30,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:30,086 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:30,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1751055411, now seen corresponding path program 1 times [2018-12-02 12:36:30,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:30,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:30,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:30,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:30,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:30,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:30,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:30,154 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-02 12:36:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:32,542 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-02 12:36:32,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:36:32,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-02 12:36:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:33,406 INFO L225 Difference]: With dead ends: 402833 [2018-12-02 12:36:33,406 INFO L226 Difference]: Without dead ends: 402257 [2018-12-02 12:36:33,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 12:36:38,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-02 12:36:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-02 12:36:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-02 12:36:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-02 12:36:42,651 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-02 12:36:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-02 12:36:42,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-02 12:36:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:36:42,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:42,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:42,666 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:42,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 8397738, now seen corresponding path program 1 times [2018-12-02 12:36:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:42,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:42,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:42,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:42,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:42,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:36:42,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:42,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:36:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:36:42,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:42,732 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-02 12:36:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:44,573 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-02 12:36:44,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 12:36:44,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-02 12:36:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:45,259 INFO L225 Difference]: With dead ends: 325852 [2018-12-02 12:36:45,259 INFO L226 Difference]: Without dead ends: 325852 [2018-12-02 12:36:45,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:36:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-02 12:36:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-02 12:36:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-02 12:36:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-02 12:36:53,948 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-02 12:36:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:53,948 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-02 12:36:53,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:36:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-02 12:36:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 12:36:53,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:53,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:53,966 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:53,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 895901419, now seen corresponding path program 1 times [2018-12-02 12:36:53,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:53,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:53,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:54,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:54,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:54,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:54,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:54,003 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 4 states. [2018-12-02 12:36:54,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:54,114 INFO L93 Difference]: Finished difference Result 40004 states and 128000 transitions. [2018-12-02 12:36:54,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:36:54,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 12:36:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:54,156 INFO L225 Difference]: With dead ends: 40004 [2018-12-02 12:36:54,157 INFO L226 Difference]: Without dead ends: 32121 [2018-12-02 12:36:54,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32121 states. [2018-12-02 12:36:54,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32121 to 31856. [2018-12-02 12:36:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31856 states. [2018-12-02 12:36:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31856 states to 31856 states and 99339 transitions. [2018-12-02 12:36:54,518 INFO L78 Accepts]: Start accepts. Automaton has 31856 states and 99339 transitions. Word has length 54 [2018-12-02 12:36:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:54,518 INFO L480 AbstractCegarLoop]: Abstraction has 31856 states and 99339 transitions. [2018-12-02 12:36:54,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 31856 states and 99339 transitions. [2018-12-02 12:36:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 12:36:54,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:54,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:54,522 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:54,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 642841615, now seen corresponding path program 1 times [2018-12-02 12:36:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:54,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:54,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:54,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:54,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:36:54,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:54,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:36:54,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:36:54,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:36:54,552 INFO L87 Difference]: Start difference. First operand 31856 states and 99339 transitions. Second operand 4 states. [2018-12-02 12:36:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:54,754 INFO L93 Difference]: Finished difference Result 37101 states and 115387 transitions. [2018-12-02 12:36:54,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:36:54,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 12:36:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:55,140 INFO L225 Difference]: With dead ends: 37101 [2018-12-02 12:36:55,140 INFO L226 Difference]: Without dead ends: 37101 [2018-12-02 12:36:55,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-12-02 12:36:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 36125. [2018-12-02 12:36:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36125 states. [2018-12-02 12:36:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36125 states to 36125 states and 112472 transitions. [2018-12-02 12:36:55,528 INFO L78 Accepts]: Start accepts. Automaton has 36125 states and 112472 transitions. Word has length 62 [2018-12-02 12:36:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:55,528 INFO L480 AbstractCegarLoop]: Abstraction has 36125 states and 112472 transitions. [2018-12-02 12:36:55,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:36:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 36125 states and 112472 transitions. [2018-12-02 12:36:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 12:36:55,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:55,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:36:55,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:55,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1909315346, now seen corresponding path program 1 times [2018-12-02 12:36:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:55,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:55,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:55,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:36:55,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:55,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:36:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:36:55,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:36:55,588 INFO L87 Difference]: Start difference. First operand 36125 states and 112472 transitions. Second operand 6 states. [2018-12-02 12:36:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:56,158 INFO L93 Difference]: Finished difference Result 74227 states and 229198 transitions. [2018-12-02 12:36:56,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:36:56,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-02 12:36:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:56,255 INFO L225 Difference]: With dead ends: 74227 [2018-12-02 12:36:56,255 INFO L226 Difference]: Without dead ends: 74156 [2018-12-02 12:36:56,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:36:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74156 states. [2018-12-02 12:36:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74156 to 44213. [2018-12-02 12:36:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44213 states. [2018-12-02 12:36:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44213 states to 44213 states and 135208 transitions. [2018-12-02 12:36:56,902 INFO L78 Accepts]: Start accepts. Automaton has 44213 states and 135208 transitions. Word has length 62 [2018-12-02 12:36:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:56,903 INFO L480 AbstractCegarLoop]: Abstraction has 44213 states and 135208 transitions. [2018-12-02 12:36:56,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:36:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 44213 states and 135208 transitions. [2018-12-02 12:36:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 12:36:56,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:56,909 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-02 12:36:56,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:56,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:56,909 INFO L82 PathProgramCache]: Analyzing trace with hash -941424289, now seen corresponding path program 1 times [2018-12-02 12:36:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:56,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:36:56,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:56,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:36:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:36:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:56,943 INFO L87 Difference]: Start difference. First operand 44213 states and 135208 transitions. Second operand 3 states. [2018-12-02 12:36:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:57,099 INFO L93 Difference]: Finished difference Result 55070 states and 166417 transitions. [2018-12-02 12:36:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:36:57,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 12:36:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:57,169 INFO L225 Difference]: With dead ends: 55070 [2018-12-02 12:36:57,169 INFO L226 Difference]: Without dead ends: 55070 [2018-12-02 12:36:57,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:36:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55070 states. [2018-12-02 12:36:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55070 to 45329. [2018-12-02 12:36:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45329 states. [2018-12-02 12:36:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45329 states to 45329 states and 135858 transitions. [2018-12-02 12:36:57,880 INFO L78 Accepts]: Start accepts. Automaton has 45329 states and 135858 transitions. Word has length 68 [2018-12-02 12:36:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 45329 states and 135858 transitions. [2018-12-02 12:36:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:36:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 45329 states and 135858 transitions. [2018-12-02 12:36:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 12:36:57,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:57,889 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-02 12:36:57,890 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:57,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:57,890 INFO L82 PathProgramCache]: Analyzing trace with hash 53745586, now seen corresponding path program 1 times [2018-12-02 12:36:57,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:57,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:57,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:57,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:57,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:57,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:36:57,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:57,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:36:57,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:36:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:36:57,954 INFO L87 Difference]: Start difference. First operand 45329 states and 135858 transitions. Second operand 5 states. [2018-12-02 12:36:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:58,275 INFO L93 Difference]: Finished difference Result 51158 states and 153082 transitions. [2018-12-02 12:36:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:36:58,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-02 12:36:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:58,337 INFO L225 Difference]: With dead ends: 51158 [2018-12-02 12:36:58,337 INFO L226 Difference]: Without dead ends: 51158 [2018-12-02 12:36:58,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:36:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2018-12-02 12:36:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 45794. [2018-12-02 12:36:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45794 states. [2018-12-02 12:36:58,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45794 states to 45794 states and 137141 transitions. [2018-12-02 12:36:58,852 INFO L78 Accepts]: Start accepts. Automaton has 45794 states and 137141 transitions. Word has length 74 [2018-12-02 12:36:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:36:58,852 INFO L480 AbstractCegarLoop]: Abstraction has 45794 states and 137141 transitions. [2018-12-02 12:36:58,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:36:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45794 states and 137141 transitions. [2018-12-02 12:36:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 12:36:58,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:36:58,862 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-02 12:36:58,862 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:36:58,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:36:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1796555921, now seen corresponding path program 1 times [2018-12-02 12:36:58,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:36:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:36:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:36:58,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:36:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:36:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:36:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:36:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:36:58,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:36:58,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:36:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:36:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:36:58,911 INFO L87 Difference]: Start difference. First operand 45794 states and 137141 transitions. Second operand 7 states. [2018-12-02 12:36:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:36:59,454 INFO L93 Difference]: Finished difference Result 54436 states and 163097 transitions. [2018-12-02 12:36:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 12:36:59,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-02 12:36:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:36:59,589 INFO L225 Difference]: With dead ends: 54436 [2018-12-02 12:36:59,589 INFO L226 Difference]: Without dead ends: 54349 [2018-12-02 12:36:59,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 12:36:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54349 states. [2018-12-02 12:36:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54349 to 42854. [2018-12-02 12:36:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42854 states. [2018-12-02 12:37:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42854 states to 42854 states and 129588 transitions. [2018-12-02 12:37:00,059 INFO L78 Accepts]: Start accepts. Automaton has 42854 states and 129588 transitions. Word has length 74 [2018-12-02 12:37:00,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:00,059 INFO L480 AbstractCegarLoop]: Abstraction has 42854 states and 129588 transitions. [2018-12-02 12:37:00,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:00,059 INFO L276 IsEmpty]: Start isEmpty. Operand 42854 states and 129588 transitions. [2018-12-02 12:37:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 12:37:00,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:00,069 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] [2018-12-02 12:37:00,069 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:00,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:00,069 INFO L82 PathProgramCache]: Analyzing trace with hash -744614695, now seen corresponding path program 1 times [2018-12-02 12:37:00,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:00,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:00,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:00,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:00,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:37:00,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:00,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:37:00,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:37:00,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:00,111 INFO L87 Difference]: Start difference. First operand 42854 states and 129588 transitions. Second operand 4 states. [2018-12-02 12:37:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:00,621 INFO L93 Difference]: Finished difference Result 56907 states and 168235 transitions. [2018-12-02 12:37:00,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:37:00,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 12:37:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:00,688 INFO L225 Difference]: With dead ends: 56907 [2018-12-02 12:37:00,689 INFO L226 Difference]: Without dead ends: 56907 [2018-12-02 12:37:00,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56907 states. [2018-12-02 12:37:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56907 to 51423. [2018-12-02 12:37:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51423 states. [2018-12-02 12:37:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51423 states to 51423 states and 153222 transitions. [2018-12-02 12:37:01,297 INFO L78 Accepts]: Start accepts. Automaton has 51423 states and 153222 transitions. Word has length 76 [2018-12-02 12:37:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:01,297 INFO L480 AbstractCegarLoop]: Abstraction has 51423 states and 153222 transitions. [2018-12-02 12:37:01,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:37:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 51423 states and 153222 transitions. [2018-12-02 12:37:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 12:37:01,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:01,310 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] [2018-12-02 12:37:01,310 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:01,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash 608695002, now seen corresponding path program 1 times [2018-12-02 12:37:01,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:01,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:01,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:01,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:01,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:01,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:01,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:01,365 INFO L87 Difference]: Start difference. First operand 51423 states and 153222 transitions. Second operand 7 states. [2018-12-02 12:37:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:02,355 INFO L93 Difference]: Finished difference Result 106618 states and 315348 transitions. [2018-12-02 12:37:02,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:37:02,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-02 12:37:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:02,495 INFO L225 Difference]: With dead ends: 106618 [2018-12-02 12:37:02,495 INFO L226 Difference]: Without dead ends: 106554 [2018-12-02 12:37:02,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-02 12:37:02,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106554 states. [2018-12-02 12:37:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106554 to 56647. [2018-12-02 12:37:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56647 states. [2018-12-02 12:37:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56647 states to 56647 states and 166937 transitions. [2018-12-02 12:37:03,402 INFO L78 Accepts]: Start accepts. Automaton has 56647 states and 166937 transitions. Word has length 76 [2018-12-02 12:37:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:03,402 INFO L480 AbstractCegarLoop]: Abstraction has 56647 states and 166937 transitions. [2018-12-02 12:37:03,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 56647 states and 166937 transitions. [2018-12-02 12:37:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:37:03,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:03,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:03,425 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:03,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash 153257945, now seen corresponding path program 1 times [2018-12-02 12:37:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:03,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:37:03,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:03,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:37:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:37:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:03,465 INFO L87 Difference]: Start difference. First operand 56647 states and 166937 transitions. Second operand 4 states. [2018-12-02 12:37:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:03,750 INFO L93 Difference]: Finished difference Result 62874 states and 184413 transitions. [2018-12-02 12:37:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:37:03,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 12:37:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:03,821 INFO L225 Difference]: With dead ends: 62874 [2018-12-02 12:37:03,822 INFO L226 Difference]: Without dead ends: 62874 [2018-12-02 12:37:03,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62874 states. [2018-12-02 12:37:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62874 to 61596. [2018-12-02 12:37:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61596 states. [2018-12-02 12:37:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61596 states to 61596 states and 180682 transitions. [2018-12-02 12:37:04,545 INFO L78 Accepts]: Start accepts. Automaton has 61596 states and 180682 transitions. Word has length 82 [2018-12-02 12:37:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 61596 states and 180682 transitions. [2018-12-02 12:37:04,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:37:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61596 states and 180682 transitions. [2018-12-02 12:37:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 12:37:04,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:04,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:04,570 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:04,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:04,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1923951398, now seen corresponding path program 1 times [2018-12-02 12:37:04,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:04,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:04,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:04,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:04,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:37:04,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:04,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:37:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:37:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:04,604 INFO L87 Difference]: Start difference. First operand 61596 states and 180682 transitions. Second operand 3 states. [2018-12-02 12:37:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:04,914 INFO L93 Difference]: Finished difference Result 73882 states and 212774 transitions. [2018-12-02 12:37:04,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:37:04,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-02 12:37:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:04,999 INFO L225 Difference]: With dead ends: 73882 [2018-12-02 12:37:04,999 INFO L226 Difference]: Without dead ends: 73882 [2018-12-02 12:37:04,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73882 states. [2018-12-02 12:37:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73882 to 69194. [2018-12-02 12:37:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69194 states. [2018-12-02 12:37:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69194 states to 69194 states and 200395 transitions. [2018-12-02 12:37:05,784 INFO L78 Accepts]: Start accepts. Automaton has 69194 states and 200395 transitions. Word has length 82 [2018-12-02 12:37:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:05,784 INFO L480 AbstractCegarLoop]: Abstraction has 69194 states and 200395 transitions. [2018-12-02 12:37:05,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:37:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 69194 states and 200395 transitions. [2018-12-02 12:37:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 12:37:05,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:05,812 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] [2018-12-02 12:37:05,812 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:05,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:05,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1319576706, now seen corresponding path program 1 times [2018-12-02 12:37:05,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:05,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:05,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:05,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:05,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:05,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:05,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:37:05,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:05,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:37:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:37:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:05,851 INFO L87 Difference]: Start difference. First operand 69194 states and 200395 transitions. Second operand 4 states. [2018-12-02 12:37:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:06,080 INFO L93 Difference]: Finished difference Result 75677 states and 216537 transitions. [2018-12-02 12:37:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:37:06,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 12:37:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:06,267 INFO L225 Difference]: With dead ends: 75677 [2018-12-02 12:37:06,267 INFO L226 Difference]: Without dead ends: 75677 [2018-12-02 12:37:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02 12:37:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75677 states. [2018-12-02 12:37:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75677 to 70724. [2018-12-02 12:37:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70724 states. [2018-12-02 12:37:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70724 states to 70724 states and 202400 transitions. [2018-12-02 12:37:07,013 INFO L78 Accepts]: Start accepts. Automaton has 70724 states and 202400 transitions. Word has length 83 [2018-12-02 12:37:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:07,013 INFO L480 AbstractCegarLoop]: Abstraction has 70724 states and 202400 transitions. [2018-12-02 12:37:07,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:37:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 70724 states and 202400 transitions. [2018-12-02 12:37:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 12:37:07,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:07,039 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] [2018-12-02 12:37:07,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:07,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1201211927, now seen corresponding path program 1 times [2018-12-02 12:37:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:07,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:07,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:07,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:37:07,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:07,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 12:37:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:37:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:37:07,068 INFO L87 Difference]: Start difference. First operand 70724 states and 202400 transitions. Second operand 4 states. [2018-12-02 12:37:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:07,275 INFO L93 Difference]: Finished difference Result 76557 states and 218374 transitions. [2018-12-02 12:37:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:37:07,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 12:37:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:07,362 INFO L225 Difference]: With dead ends: 76557 [2018-12-02 12:37:07,362 INFO L226 Difference]: Without dead ends: 76557 [2018-12-02 12:37:07,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02 12:37:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76557 states. [2018-12-02 12:37:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76557 to 71702. [2018-12-02 12:37:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71702 states. [2018-12-02 12:37:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71702 states to 71702 states and 205099 transitions. [2018-12-02 12:37:08,174 INFO L78 Accepts]: Start accepts. Automaton has 71702 states and 205099 transitions. Word has length 83 [2018-12-02 12:37:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:08,174 INFO L480 AbstractCegarLoop]: Abstraction has 71702 states and 205099 transitions. [2018-12-02 12:37:08,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 12:37:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 71702 states and 205099 transitions. [2018-12-02 12:37:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 12:37:08,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:08,323 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] [2018-12-02 12:37:08,323 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:08,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2103727433, now seen corresponding path program 1 times [2018-12-02 12:37:08,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:08,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:08,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:08,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:08,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:37:08,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:08,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:37:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:37:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:37:08,397 INFO L87 Difference]: Start difference. First operand 71702 states and 205099 transitions. Second operand 8 states. [2018-12-02 12:37:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:10,905 INFO L93 Difference]: Finished difference Result 164487 states and 482593 transitions. [2018-12-02 12:37:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 12:37:10,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-12-02 12:37:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:11,125 INFO L225 Difference]: With dead ends: 164487 [2018-12-02 12:37:11,125 INFO L226 Difference]: Without dead ends: 164487 [2018-12-02 12:37:11,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2018-12-02 12:37:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164487 states. [2018-12-02 12:37:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164487 to 99573. [2018-12-02 12:37:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99573 states. [2018-12-02 12:37:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99573 states to 99573 states and 291954 transitions. [2018-12-02 12:37:12,853 INFO L78 Accepts]: Start accepts. Automaton has 99573 states and 291954 transitions. Word has length 83 [2018-12-02 12:37:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:12,853 INFO L480 AbstractCegarLoop]: Abstraction has 99573 states and 291954 transitions. [2018-12-02 12:37:12,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:37:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 99573 states and 291954 transitions. [2018-12-02 12:37:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 12:37:12,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:12,889 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] [2018-12-02 12:37:12,889 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:12,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1216223752, now seen corresponding path program 1 times [2018-12-02 12:37:12,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:12,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:12,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:12,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:37:12,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:12,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:37:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:37:12,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:12,925 INFO L87 Difference]: Start difference. First operand 99573 states and 291954 transitions. Second operand 5 states. [2018-12-02 12:37:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:13,012 INFO L93 Difference]: Finished difference Result 35805 states and 86792 transitions. [2018-12-02 12:37:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:37:13,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-12-02 12:37:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:13,038 INFO L225 Difference]: With dead ends: 35805 [2018-12-02 12:37:13,038 INFO L226 Difference]: Without dead ends: 31165 [2018-12-02 12:37:13,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31165 states. [2018-12-02 12:37:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31165 to 26658. [2018-12-02 12:37:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26658 states. [2018-12-02 12:37:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26658 states to 26658 states and 63590 transitions. [2018-12-02 12:37:13,309 INFO L78 Accepts]: Start accepts. Automaton has 26658 states and 63590 transitions. Word has length 83 [2018-12-02 12:37:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:13,309 INFO L480 AbstractCegarLoop]: Abstraction has 26658 states and 63590 transitions. [2018-12-02 12:37:13,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:37:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 26658 states and 63590 transitions. [2018-12-02 12:37:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 12:37:13,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:13,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:13,329 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:13,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2021292097, now seen corresponding path program 1 times [2018-12-02 12:37:13,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:13,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:13,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:13,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:37:13,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:13,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:37:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:37:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:13,379 INFO L87 Difference]: Start difference. First operand 26658 states and 63590 transitions. Second operand 5 states. [2018-12-02 12:37:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:13,482 INFO L93 Difference]: Finished difference Result 30725 states and 72487 transitions. [2018-12-02 12:37:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:37:13,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 12:37:13,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:13,504 INFO L225 Difference]: With dead ends: 30725 [2018-12-02 12:37:13,504 INFO L226 Difference]: Without dead ends: 30725 [2018-12-02 12:37:13,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30725 states. [2018-12-02 12:37:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30725 to 24444. [2018-12-02 12:37:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24444 states. [2018-12-02 12:37:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24444 states to 24444 states and 57727 transitions. [2018-12-02 12:37:13,737 INFO L78 Accepts]: Start accepts. Automaton has 24444 states and 57727 transitions. Word has length 111 [2018-12-02 12:37:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:13,737 INFO L480 AbstractCegarLoop]: Abstraction has 24444 states and 57727 transitions. [2018-12-02 12:37:13,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:37:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 24444 states and 57727 transitions. [2018-12-02 12:37:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 12:37:13,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:13,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:13,757 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:13,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2013532738, now seen corresponding path program 1 times [2018-12-02 12:37:13,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:13,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:13,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:13,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:13,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:13,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:37:13,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:13,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:37:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:37:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:37:13,861 INFO L87 Difference]: Start difference. First operand 24444 states and 57727 transitions. Second operand 8 states. [2018-12-02 12:37:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:14,505 INFO L93 Difference]: Finished difference Result 36935 states and 85768 transitions. [2018-12-02 12:37:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 12:37:14,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-02 12:37:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:14,532 INFO L225 Difference]: With dead ends: 36935 [2018-12-02 12:37:14,533 INFO L226 Difference]: Without dead ends: 36697 [2018-12-02 12:37:14,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:37:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36697 states. [2018-12-02 12:37:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36697 to 29289. [2018-12-02 12:37:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29289 states. [2018-12-02 12:37:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29289 states to 29289 states and 68874 transitions. [2018-12-02 12:37:14,828 INFO L78 Accepts]: Start accepts. Automaton has 29289 states and 68874 transitions. Word has length 111 [2018-12-02 12:37:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 29289 states and 68874 transitions. [2018-12-02 12:37:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:37:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 29289 states and 68874 transitions. [2018-12-02 12:37:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 12:37:14,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:14,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:14,850 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:14,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash -251307648, now seen corresponding path program 1 times [2018-12-02 12:37:14,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:14,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:14,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:14,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:14,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:14,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:14,923 INFO L87 Difference]: Start difference. First operand 29289 states and 68874 transitions. Second operand 7 states. [2018-12-02 12:37:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:15,391 INFO L93 Difference]: Finished difference Result 37107 states and 86468 transitions. [2018-12-02 12:37:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:37:15,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-02 12:37:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:15,421 INFO L225 Difference]: With dead ends: 37107 [2018-12-02 12:37:15,421 INFO L226 Difference]: Without dead ends: 37107 [2018-12-02 12:37:15,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:37:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37107 states. [2018-12-02 12:37:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37107 to 30673. [2018-12-02 12:37:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30673 states. [2018-12-02 12:37:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30673 states to 30673 states and 71460 transitions. [2018-12-02 12:37:15,740 INFO L78 Accepts]: Start accepts. Automaton has 30673 states and 71460 transitions. Word has length 111 [2018-12-02 12:37:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:15,740 INFO L480 AbstractCegarLoop]: Abstraction has 30673 states and 71460 transitions. [2018-12-02 12:37:15,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 30673 states and 71460 transitions. [2018-12-02 12:37:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 12:37:15,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:15,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:15,763 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:15,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash 190679158, now seen corresponding path program 2 times [2018-12-02 12:37:15,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:15,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:15,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:15,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:15,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:15,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:15,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:37:15,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:15,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:37:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:37:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:15,795 INFO L87 Difference]: Start difference. First operand 30673 states and 71460 transitions. Second operand 5 states. [2018-12-02 12:37:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:15,995 INFO L93 Difference]: Finished difference Result 31480 states and 73245 transitions. [2018-12-02 12:37:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:37:15,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-02 12:37:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:16,018 INFO L225 Difference]: With dead ends: 31480 [2018-12-02 12:37:16,019 INFO L226 Difference]: Without dead ends: 31480 [2018-12-02 12:37:16,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31480 states. [2018-12-02 12:37:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31480 to 31107. [2018-12-02 12:37:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31107 states. [2018-12-02 12:37:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31107 states to 31107 states and 72433 transitions. [2018-12-02 12:37:16,292 INFO L78 Accepts]: Start accepts. Automaton has 31107 states and 72433 transitions. Word has length 111 [2018-12-02 12:37:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:16,292 INFO L480 AbstractCegarLoop]: Abstraction has 31107 states and 72433 transitions. [2018-12-02 12:37:16,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:37:16,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31107 states and 72433 transitions. [2018-12-02 12:37:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 12:37:16,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:16,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:16,316 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:16,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:16,316 INFO L82 PathProgramCache]: Analyzing trace with hash -817303495, now seen corresponding path program 1 times [2018-12-02 12:37:16,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:16,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:37:16,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:16,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:16,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:16,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:16,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:16,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:16,406 INFO L87 Difference]: Start difference. First operand 31107 states and 72433 transitions. Second operand 7 states. [2018-12-02 12:37:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:16,642 INFO L93 Difference]: Finished difference Result 38217 states and 88199 transitions. [2018-12-02 12:37:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:37:16,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-02 12:37:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:16,669 INFO L225 Difference]: With dead ends: 38217 [2018-12-02 12:37:16,669 INFO L226 Difference]: Without dead ends: 38217 [2018-12-02 12:37:16,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:37:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38217 states. [2018-12-02 12:37:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38217 to 32959. [2018-12-02 12:37:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32959 states. [2018-12-02 12:37:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32959 states to 32959 states and 76574 transitions. [2018-12-02 12:37:16,972 INFO L78 Accepts]: Start accepts. Automaton has 32959 states and 76574 transitions. Word has length 113 [2018-12-02 12:37:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:16,972 INFO L480 AbstractCegarLoop]: Abstraction has 32959 states and 76574 transitions. [2018-12-02 12:37:16,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 32959 states and 76574 transitions. [2018-12-02 12:37:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 12:37:16,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:16,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:16,994 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:16,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 245847002, now seen corresponding path program 1 times [2018-12-02 12:37:16,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:16,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:16,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:16,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:17,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:17,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:37:17,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:17,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:37:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:37:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:17,025 INFO L87 Difference]: Start difference. First operand 32959 states and 76574 transitions. Second operand 3 states. [2018-12-02 12:37:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:17,085 INFO L93 Difference]: Finished difference Result 32799 states and 76046 transitions. [2018-12-02 12:37:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:37:17,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-02 12:37:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:17,108 INFO L225 Difference]: With dead ends: 32799 [2018-12-02 12:37:17,108 INFO L226 Difference]: Without dead ends: 32799 [2018-12-02 12:37:17,108 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-02 12:37:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32799 states. [2018-12-02 12:37:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32799 to 28973. [2018-12-02 12:37:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28973 states. [2018-12-02 12:37:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28973 states to 28973 states and 67355 transitions. [2018-12-02 12:37:17,375 INFO L78 Accepts]: Start accepts. Automaton has 28973 states and 67355 transitions. Word has length 113 [2018-12-02 12:37:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:17,375 INFO L480 AbstractCegarLoop]: Abstraction has 28973 states and 67355 transitions. [2018-12-02 12:37:17,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:37:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28973 states and 67355 transitions. [2018-12-02 12:37:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 12:37:17,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:17,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:17,395 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:17,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -876320510, now seen corresponding path program 1 times [2018-12-02 12:37:17,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:17,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:17,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:17,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 12:37:17,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:17,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 12:37:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:37:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:37:17,446 INFO L87 Difference]: Start difference. First operand 28973 states and 67355 transitions. Second operand 6 states. [2018-12-02 12:37:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:17,724 INFO L93 Difference]: Finished difference Result 33141 states and 76462 transitions. [2018-12-02 12:37:17,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:37:17,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-02 12:37:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:17,747 INFO L225 Difference]: With dead ends: 33141 [2018-12-02 12:37:17,747 INFO L226 Difference]: Without dead ends: 33141 [2018-12-02 12:37:17,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:37:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33141 states. [2018-12-02 12:37:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33141 to 28994. [2018-12-02 12:37:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28994 states. [2018-12-02 12:37:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28994 states to 28994 states and 67381 transitions. [2018-12-02 12:37:18,036 INFO L78 Accepts]: Start accepts. Automaton has 28994 states and 67381 transitions. Word has length 113 [2018-12-02 12:37:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:18,036 INFO L480 AbstractCegarLoop]: Abstraction has 28994 states and 67381 transitions. [2018-12-02 12:37:18,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 12:37:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28994 states and 67381 transitions. [2018-12-02 12:37:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:18,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:18,058 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:18,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2066243424, now seen corresponding path program 1 times [2018-12-02 12:37:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:18,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:18,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:18,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:37:18,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:18,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 12:37:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:37:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:37:18,104 INFO L87 Difference]: Start difference. First operand 28994 states and 67381 transitions. Second operand 5 states. [2018-12-02 12:37:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:18,496 INFO L93 Difference]: Finished difference Result 33739 states and 78376 transitions. [2018-12-02 12:37:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:37:18,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-02 12:37:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:18,522 INFO L225 Difference]: With dead ends: 33739 [2018-12-02 12:37:18,522 INFO L226 Difference]: Without dead ends: 33711 [2018-12-02 12:37:18,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33711 states. [2018-12-02 12:37:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33711 to 30690. [2018-12-02 12:37:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30690 states. [2018-12-02 12:37:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30690 states to 30690 states and 71690 transitions. [2018-12-02 12:37:18,814 INFO L78 Accepts]: Start accepts. Automaton has 30690 states and 71690 transitions. Word has length 115 [2018-12-02 12:37:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:18,814 INFO L480 AbstractCegarLoop]: Abstraction has 30690 states and 71690 transitions. [2018-12-02 12:37:18,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 12:37:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 30690 states and 71690 transitions. [2018-12-02 12:37:18,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:18,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:18,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:18,838 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:18,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 935060026, now seen corresponding path program 2 times [2018-12-02 12:37:18,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:18,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:18,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:18,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 12:37:18,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:18,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 12:37:18,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 12:37:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:37:18,967 INFO L87 Difference]: Start difference. First operand 30690 states and 71690 transitions. Second operand 12 states. [2018-12-02 12:37:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:20,225 INFO L93 Difference]: Finished difference Result 47089 states and 107047 transitions. [2018-12-02 12:37:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 12:37:20,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 115 [2018-12-02 12:37:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:20,263 INFO L225 Difference]: With dead ends: 47089 [2018-12-02 12:37:20,263 INFO L226 Difference]: Without dead ends: 47089 [2018-12-02 12:37:20,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-12-02 12:37:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47089 states. [2018-12-02 12:37:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47089 to 36887. [2018-12-02 12:37:20,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36887 states. [2018-12-02 12:37:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36887 states to 36887 states and 85013 transitions. [2018-12-02 12:37:20,661 INFO L78 Accepts]: Start accepts. Automaton has 36887 states and 85013 transitions. Word has length 115 [2018-12-02 12:37:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:20,661 INFO L480 AbstractCegarLoop]: Abstraction has 36887 states and 85013 transitions. [2018-12-02 12:37:20,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 12:37:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 36887 states and 85013 transitions. [2018-12-02 12:37:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:20,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:20,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:20,691 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:20,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 303190561, now seen corresponding path program 1 times [2018-12-02 12:37:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:20,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:20,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:37:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:20,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:20,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:20,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:20,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:20,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:20,781 INFO L87 Difference]: Start difference. First operand 36887 states and 85013 transitions. Second operand 7 states. [2018-12-02 12:37:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:21,089 INFO L93 Difference]: Finished difference Result 47749 states and 109000 transitions. [2018-12-02 12:37:21,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:37:21,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 12:37:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:21,126 INFO L225 Difference]: With dead ends: 47749 [2018-12-02 12:37:21,126 INFO L226 Difference]: Without dead ends: 47708 [2018-12-02 12:37:21,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 12:37:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47708 states. [2018-12-02 12:37:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47708 to 38778. [2018-12-02 12:37:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38778 states. [2018-12-02 12:37:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38778 states to 38778 states and 89117 transitions. [2018-12-02 12:37:21,527 INFO L78 Accepts]: Start accepts. Automaton has 38778 states and 89117 transitions. Word has length 115 [2018-12-02 12:37:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:21,527 INFO L480 AbstractCegarLoop]: Abstraction has 38778 states and 89117 transitions. [2018-12-02 12:37:21,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 38778 states and 89117 transitions. [2018-12-02 12:37:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:21,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:21,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:21,555 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:21,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:21,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1774018782, now seen corresponding path program 1 times [2018-12-02 12:37:21,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:21,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:21,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:21,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 12:37:21,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:21,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 12:37:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 12:37:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 12:37:21,635 INFO L87 Difference]: Start difference. First operand 38778 states and 89117 transitions. Second operand 8 states. [2018-12-02 12:37:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:22,623 INFO L93 Difference]: Finished difference Result 47733 states and 108787 transitions. [2018-12-02 12:37:22,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 12:37:22,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2018-12-02 12:37:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:22,662 INFO L225 Difference]: With dead ends: 47733 [2018-12-02 12:37:22,662 INFO L226 Difference]: Without dead ends: 47704 [2018-12-02 12:37:22,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-02 12:37:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47704 states. [2018-12-02 12:37:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47704 to 42682. [2018-12-02 12:37:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42682 states. [2018-12-02 12:37:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42682 states to 42682 states and 98097 transitions. [2018-12-02 12:37:23,090 INFO L78 Accepts]: Start accepts. Automaton has 42682 states and 98097 transitions. Word has length 115 [2018-12-02 12:37:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:23,090 INFO L480 AbstractCegarLoop]: Abstraction has 42682 states and 98097 transitions. [2018-12-02 12:37:23,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 12:37:23,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42682 states and 98097 transitions. [2018-12-02 12:37:23,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:23,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:23,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:23,121 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:23,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:23,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1562667869, now seen corresponding path program 1 times [2018-12-02 12:37:23,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:23,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:23,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:23,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:23,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:37:23,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:23,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 12:37:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:37:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:23,145 INFO L87 Difference]: Start difference. First operand 42682 states and 98097 transitions. Second operand 3 states. [2018-12-02 12:37:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:23,242 INFO L93 Difference]: Finished difference Result 52797 states and 120484 transitions. [2018-12-02 12:37:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:37:23,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-12-02 12:37:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:23,285 INFO L225 Difference]: With dead ends: 52797 [2018-12-02 12:37:23,285 INFO L226 Difference]: Without dead ends: 52797 [2018-12-02 12:37:23,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:37:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52797 states. [2018-12-02 12:37:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52797 to 52246. [2018-12-02 12:37:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52246 states. [2018-12-02 12:37:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52246 states to 52246 states and 119278 transitions. [2018-12-02 12:37:23,775 INFO L78 Accepts]: Start accepts. Automaton has 52246 states and 119278 transitions. Word has length 115 [2018-12-02 12:37:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:23,775 INFO L480 AbstractCegarLoop]: Abstraction has 52246 states and 119278 transitions. [2018-12-02 12:37:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 12:37:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 52246 states and 119278 transitions. [2018-12-02 12:37:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:23,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:23,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:23,816 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:23,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash 162813028, now seen corresponding path program 1 times [2018-12-02 12:37:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:23,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:23,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:23,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:23,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:23,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:23,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:23,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:23,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:23,901 INFO L87 Difference]: Start difference. First operand 52246 states and 119278 transitions. Second operand 7 states. [2018-12-02 12:37:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:24,158 INFO L93 Difference]: Finished difference Result 53612 states and 122180 transitions. [2018-12-02 12:37:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:37:24,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 12:37:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:24,202 INFO L225 Difference]: With dead ends: 53612 [2018-12-02 12:37:24,203 INFO L226 Difference]: Without dead ends: 53612 [2018-12-02 12:37:24,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 12:37:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53612 states. [2018-12-02 12:37:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53612 to 52694. [2018-12-02 12:37:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52694 states. [2018-12-02 12:37:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52694 states to 52694 states and 120302 transitions. [2018-12-02 12:37:24,702 INFO L78 Accepts]: Start accepts. Automaton has 52694 states and 120302 transitions. Word has length 115 [2018-12-02 12:37:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:24,702 INFO L480 AbstractCegarLoop]: Abstraction has 52694 states and 120302 transitions. [2018-12-02 12:37:24,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52694 states and 120302 transitions. [2018-12-02 12:37:24,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:24,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:24,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:24,745 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:24,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:24,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1050316709, now seen corresponding path program 1 times [2018-12-02 12:37:24,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:24,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:24,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:24,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:24,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:24,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:24,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:24,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:24,835 INFO L87 Difference]: Start difference. First operand 52694 states and 120302 transitions. Second operand 7 states. [2018-12-02 12:37:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:25,074 INFO L93 Difference]: Finished difference Result 57762 states and 130167 transitions. [2018-12-02 12:37:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 12:37:25,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 12:37:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:25,122 INFO L225 Difference]: With dead ends: 57762 [2018-12-02 12:37:25,123 INFO L226 Difference]: Without dead ends: 57762 [2018-12-02 12:37:25,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:37:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57762 states. [2018-12-02 12:37:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57762 to 47085. [2018-12-02 12:37:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47085 states. [2018-12-02 12:37:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47085 states to 47085 states and 107248 transitions. [2018-12-02 12:37:25,589 INFO L78 Accepts]: Start accepts. Automaton has 47085 states and 107248 transitions. Word has length 115 [2018-12-02 12:37:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:25,589 INFO L480 AbstractCegarLoop]: Abstraction has 47085 states and 107248 transitions. [2018-12-02 12:37:25,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 47085 states and 107248 transitions. [2018-12-02 12:37:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:25,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:25,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:25,622 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:25,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 850281923, now seen corresponding path program 1 times [2018-12-02 12:37:25,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:25,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:25,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:25,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:25,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:37:25,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:25,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 12:37:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:37:25,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:37:25,686 INFO L87 Difference]: Start difference. First operand 47085 states and 107248 transitions. Second operand 7 states. [2018-12-02 12:37:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:26,097 INFO L93 Difference]: Finished difference Result 57250 states and 128587 transitions. [2018-12-02 12:37:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 12:37:26,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-02 12:37:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:26,143 INFO L225 Difference]: With dead ends: 57250 [2018-12-02 12:37:26,143 INFO L226 Difference]: Without dead ends: 57224 [2018-12-02 12:37:26,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 12:37:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57224 states. [2018-12-02 12:37:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57224 to 49954. [2018-12-02 12:37:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49954 states. [2018-12-02 12:37:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49954 states to 49954 states and 112814 transitions. [2018-12-02 12:37:26,667 INFO L78 Accepts]: Start accepts. Automaton has 49954 states and 112814 transitions. Word has length 115 [2018-12-02 12:37:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:26,668 INFO L480 AbstractCegarLoop]: Abstraction has 49954 states and 112814 transitions. [2018-12-02 12:37:26,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 12:37:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 49954 states and 112814 transitions. [2018-12-02 12:37:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:26,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:26,709 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:26,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1061632836, now seen corresponding path program 1 times [2018-12-02 12:37:26,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:26,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:26,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:26,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:26,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:26,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 12:37:26,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:26,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 12:37:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 12:37:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:37:26,842 INFO L87 Difference]: Start difference. First operand 49954 states and 112814 transitions. Second operand 15 states. [2018-12-02 12:37:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:28,709 INFO L93 Difference]: Finished difference Result 79660 states and 180495 transitions. [2018-12-02 12:37:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 12:37:28,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-12-02 12:37:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:28,765 INFO L225 Difference]: With dead ends: 79660 [2018-12-02 12:37:28,765 INFO L226 Difference]: Without dead ends: 66881 [2018-12-02 12:37:28,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2018-12-02 12:37:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66881 states. [2018-12-02 12:37:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66881 to 55791. [2018-12-02 12:37:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55791 states. [2018-12-02 12:37:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55791 states to 55791 states and 125426 transitions. [2018-12-02 12:37:29,352 INFO L78 Accepts]: Start accepts. Automaton has 55791 states and 125426 transitions. Word has length 115 [2018-12-02 12:37:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:29,353 INFO L480 AbstractCegarLoop]: Abstraction has 55791 states and 125426 transitions. [2018-12-02 12:37:29,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 12:37:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 55791 states and 125426 transitions. [2018-12-02 12:37:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:29,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:29,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:29,476 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:29,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2085529924, now seen corresponding path program 2 times [2018-12-02 12:37:29,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:29,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:29,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:29,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 12:37:29,600 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:29,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 12:37:29,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 12:37:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:37:29,600 INFO L87 Difference]: Start difference. First operand 55791 states and 125426 transitions. Second operand 15 states. [2018-12-02 12:37:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:31,759 INFO L93 Difference]: Finished difference Result 138823 states and 314845 transitions. [2018-12-02 12:37:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-02 12:37:31,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 115 [2018-12-02 12:37:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:31,854 INFO L225 Difference]: With dead ends: 138823 [2018-12-02 12:37:31,854 INFO L226 Difference]: Without dead ends: 105645 [2018-12-02 12:37:31,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-12-02 12:37:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105645 states. [2018-12-02 12:37:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105645 to 66209. [2018-12-02 12:37:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66209 states. [2018-12-02 12:37:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66209 states to 66209 states and 147238 transitions. [2018-12-02 12:37:32,734 INFO L78 Accepts]: Start accepts. Automaton has 66209 states and 147238 transitions. Word has length 115 [2018-12-02 12:37:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:32,735 INFO L480 AbstractCegarLoop]: Abstraction has 66209 states and 147238 transitions. [2018-12-02 12:37:32,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 12:37:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 66209 states and 147238 transitions. [2018-12-02 12:37:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:32,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:32,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:32,787 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:32,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:32,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1226976344, now seen corresponding path program 3 times [2018-12-02 12:37:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:32,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:37:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:32,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:32,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:32,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 12:37:32,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:32,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 12:37:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 12:37:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-02 12:37:32,889 INFO L87 Difference]: Start difference. First operand 66209 states and 147238 transitions. Second operand 13 states. [2018-12-02 12:37:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:33,524 INFO L93 Difference]: Finished difference Result 89422 states and 200081 transitions. [2018-12-02 12:37:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 12:37:33,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2018-12-02 12:37:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:33,586 INFO L225 Difference]: With dead ends: 89422 [2018-12-02 12:37:33,586 INFO L226 Difference]: Without dead ends: 79005 [2018-12-02 12:37:33,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2018-12-02 12:37:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79005 states. [2018-12-02 12:37:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79005 to 67019. [2018-12-02 12:37:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67019 states. [2018-12-02 12:37:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67019 states to 67019 states and 149103 transitions. [2018-12-02 12:37:34,366 INFO L78 Accepts]: Start accepts. Automaton has 67019 states and 149103 transitions. Word has length 115 [2018-12-02 12:37:34,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:34,366 INFO L480 AbstractCegarLoop]: Abstraction has 67019 states and 149103 transitions. [2018-12-02 12:37:34,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 12:37:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 67019 states and 149103 transitions. [2018-12-02 12:37:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:34,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:34,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:34,419 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:34,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash 861923247, now seen corresponding path program 1 times [2018-12-02 12:37:34,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:34,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:37:34,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:34,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:34,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:34,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-02 12:37:34,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 12:37:34,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 12:37:34,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-02 12:37:34,581 INFO L87 Difference]: Start difference. First operand 67019 states and 149103 transitions. Second operand 19 states. [2018-12-02 12:37:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:35,313 INFO L93 Difference]: Finished difference Result 86652 states and 194878 transitions. [2018-12-02 12:37:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-02 12:37:35,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-12-02 12:37:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:35,377 INFO L225 Difference]: With dead ends: 86652 [2018-12-02 12:37:35,378 INFO L226 Difference]: Without dead ends: 80800 [2018-12-02 12:37:35,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2018-12-02 12:37:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80800 states. [2018-12-02 12:37:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80800 to 70714. [2018-12-02 12:37:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70714 states. [2018-12-02 12:37:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70714 states to 70714 states and 157457 transitions. [2018-12-02 12:37:36,106 INFO L78 Accepts]: Start accepts. Automaton has 70714 states and 157457 transitions. Word has length 115 [2018-12-02 12:37:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:36,106 INFO L480 AbstractCegarLoop]: Abstraction has 70714 states and 157457 transitions. [2018-12-02 12:37:36,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 12:37:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70714 states and 157457 transitions. [2018-12-02 12:37:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:36,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:36,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:36,163 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:36,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1369109039, now seen corresponding path program 2 times [2018-12-02 12:37:36,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:36,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:36,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:36,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:36,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:36,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 12:37:36,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:36,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 12:37:36,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 12:37:36,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-12-02 12:37:36,285 INFO L87 Difference]: Start difference. First operand 70714 states and 157457 transitions. Second operand 16 states. [2018-12-02 12:37:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:37,083 INFO L93 Difference]: Finished difference Result 84020 states and 187646 transitions. [2018-12-02 12:37:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 12:37:37,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-12-02 12:37:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:37,145 INFO L225 Difference]: With dead ends: 84020 [2018-12-02 12:37:37,145 INFO L226 Difference]: Without dead ends: 79070 [2018-12-02 12:37:37,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 12:37:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79070 states. [2018-12-02 12:37:37,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79070 to 66358. [2018-12-02 12:37:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66358 states. [2018-12-02 12:37:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66358 states to 66358 states and 147762 transitions. [2018-12-02 12:37:37,968 INFO L78 Accepts]: Start accepts. Automaton has 66358 states and 147762 transitions. Word has length 115 [2018-12-02 12:37:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:37,968 INFO L480 AbstractCegarLoop]: Abstraction has 66358 states and 147762 transitions. [2018-12-02 12:37:37,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 12:37:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 66358 states and 147762 transitions. [2018-12-02 12:37:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:38,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:38,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:38,018 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:38,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash -141669914, now seen corresponding path program 4 times [2018-12-02 12:37:38,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:38,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:37:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:38,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:37:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:37:38,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:37:38,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 12:37:38,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 12:37:38,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 12:37:38,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 12:37:38,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 12:37:38,110 INFO L87 Difference]: Start difference. First operand 66358 states and 147762 transitions. Second operand 10 states. [2018-12-02 12:37:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:37:38,533 INFO L93 Difference]: Finished difference Result 76003 states and 168852 transitions. [2018-12-02 12:37:38,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 12:37:38,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-12-02 12:37:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 12:37:38,537 INFO L225 Difference]: With dead ends: 76003 [2018-12-02 12:37:38,538 INFO L226 Difference]: Without dead ends: 7007 [2018-12-02 12:37:38,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-02 12:37:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2018-12-02 12:37:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 7007. [2018-12-02 12:37:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2018-12-02 12:37:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 16479 transitions. [2018-12-02 12:37:38,585 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 16479 transitions. Word has length 115 [2018-12-02 12:37:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 12:37:38,585 INFO L480 AbstractCegarLoop]: Abstraction has 7007 states and 16479 transitions. [2018-12-02 12:37:38,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 12:37:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 16479 transitions. [2018-12-02 12:37:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 12:37:38,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 12:37:38,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:37:38,590 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 12:37:38,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:37:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1293718377, now seen corresponding path program 1 times [2018-12-02 12:37:38,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 12:37:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:38,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:37:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:37:38,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 12:37:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:37:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:37:38,628 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 12:37:38,708 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 12:37:38,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:37:38 BasicIcfg [2018-12-02 12:37:38,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 12:37:38,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:37:38,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:37:38,709 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:37:38,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:35:55" (3/4) ... [2018-12-02 12:37:38,711 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:37:38,788 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0fcbb7d7-6651-4c2d-8bd6-296e16257ce5/bin-2019/utaipan/witness.graphml [2018-12-02 12:37:38,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:37:38,789 INFO L168 Benchmark]: Toolchain (without parser) took 103763.04 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.5 GB). Free memory was 952.4 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,790 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-02 12:37:38,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,790 INFO L168 Benchmark]: Boogie Preprocessor took 30.98 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-02 12:37:38,791 INFO L168 Benchmark]: RCFGBuilder took 386.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,791 INFO L168 Benchmark]: TraceAbstraction took 102863.30 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,791 INFO L168 Benchmark]: Witness Printer took 79.61 ms. Allocated memory is still 7.5 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-12-02 12:37:38,792 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 351.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -158.6 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.98 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 386.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 102863.30 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 79.61 ms. Allocated memory is still 7.5 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 pthread_t t8; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] FCALL, FORK -1 pthread_create(&t8, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] -1 pthread_t t9; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK -1 pthread_create(&t9, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L706] 0 y$w_buff1 = y$w_buff0 [L707] 0 y$w_buff0 = 1 [L708] 0 y$w_buff1_used = y$w_buff0_used [L709] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L712] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L713] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L714] 0 y$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 y$flush_delayed = weak$$choice2 [L720] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L726] 0 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 y = y$flush_delayed ? y$mem_tmp : y [L730] 0 y$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 x = 1 [L753] 1 __unbuffered_p1_EAX = x [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 y$flush_delayed = weak$$choice2 [L759] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L736] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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=0] [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L772] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L773] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, 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] [L774] 1 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 [L775] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 1 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 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] -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) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] -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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 102.7s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 36.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20204 SDtfs, 26974 SDslu, 77227 SDs, 0 SdLazy, 19921 SolverSat, 1246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 119 SyntacticMatches, 33 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, 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: 54.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 902066 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3838 NumberOfCodeBlocks, 3838 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3682 ConstructedInterpolants, 0 QuantifiedInterpolants, 1115618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...