./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_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_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/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 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:05:50,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:05:50,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:05:50,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:05:50,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:05:50,424 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:05:50,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:05:50,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:05:50,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:05:50,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:05:50,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:05:50,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:05:50,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:05:50,429 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:05:50,430 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:05:50,430 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:05:50,431 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:05:50,432 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:05:50,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:05:50,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:05:50,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:05:50,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:05:50,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:05:50,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:05:50,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:05:50,437 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:05:50,437 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:05:50,438 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:05:50,438 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:05:50,439 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:05:50,439 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:05:50,439 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:05:50,440 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:05:50,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:05:50,440 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:05:50,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:05:50,441 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:05:50,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:05:50,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:05:50,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:05:50,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:05:50,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:05:50,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:05:50,449 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:05:50,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:05:50,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:05:50,451 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:05:50,452 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:05:50,452 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:05:50,453 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:05:50,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:05:50,454 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_92d4a857-f498-4613-9d00-9191b2c72b1a/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 -> 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 [2018-12-02 14:05:50,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:05:50,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:05:50,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:05:50,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:05:50,484 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:05:50,485 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-02 14:05:50,528 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/data/480e3364b/5e2568f6c78848f88455c4303d465214/FLAGfa5620f30 [2018-12-02 14:05:50,958 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:05:50,958 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-02 14:05:50,967 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/data/480e3364b/5e2568f6c78848f88455c4303d465214/FLAGfa5620f30 [2018-12-02 14:05:50,975 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/data/480e3364b/5e2568f6c78848f88455c4303d465214 [2018-12-02 14:05:50,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:05:50,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:05:50,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:05:50,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:05:50,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:05:50,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:50" (1/1) ... [2018-12-02 14:05:50,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201b218f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:50, skipping insertion in model container [2018-12-02 14:05:50,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:05:50" (1/1) ... [2018-12-02 14:05:50,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:05:51,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:05:51,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:05:51,191 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:05:51,275 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:05:51,306 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:05:51,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51 WrapperNode [2018-12-02 14:05:51,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:05:51,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:05:51,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:05:51,307 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:05:51,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:05:51,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:05:51,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:05:51,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:05:51,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... [2018-12-02 14:05:51,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:05:51,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:05:51,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:05:51,358 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:05:51,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/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 14:05:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 14:05:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 14:05:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 14:05:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:05:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:05:51,394 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 14:05:51,688 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:05:51,688 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 14:05:51,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:05:51 BoogieIcfgContainer [2018-12-02 14:05:51,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:05:51,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:05:51,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:05:51,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:05:51,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:05:50" (1/3) ... [2018-12-02 14:05:51,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:05:51, skipping insertion in model container [2018-12-02 14:05:51,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:05:51" (2/3) ... [2018-12-02 14:05:51,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654c0bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:05:51, skipping insertion in model container [2018-12-02 14:05:51,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:05:51" (3/3) ... [2018-12-02 14:05:51,693 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc_false-unreach-call.i [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,715 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,716 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,717 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,718 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,730 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:05:51,735 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 14:05:51,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:05:51,740 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 14:05:51,749 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 14:05:51,764 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:05:51,764 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:05:51,764 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:05:51,765 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:05:51,765 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:05:51,765 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:05:51,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:05:51,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:05:51,771 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 14:05:53,296 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 14:05:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 14:05:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 14:05:53,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:05:53,302 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] [2018-12-02 14:05:53,304 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:05:53,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:05:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-02 14:05:53,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:05:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:53,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:05:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:53,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:05:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:05:53,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 14:05:53,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:05:53,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:05:53,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:05:53,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:05:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:05:53,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:05:53,460 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 14:05:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:05:53,970 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 14:05:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:05:53,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 14:05:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:05:54,121 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 14:05:54,121 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 14:05:54,122 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 14:05:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 14:05:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 14:05:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 14:05:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 14:05:54,864 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 14:05:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:05:54,864 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 14:05:54,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:05:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 14:05:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 14:05:54,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:05:54,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:05:54,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:05:54,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:05:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-02 14:05:54,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:05:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:54,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:05:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:54,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:05:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:05:54,929 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 14:05:54,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:05:54,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:05:54,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:05:54,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:05:54,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:05:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:05:54,931 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-02 14:05:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:05:55,493 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-02 14:05:55,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:05:55,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 14:05:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:05:55,749 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 14:05:55,749 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 14:05:55,750 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 14:05:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 14:05:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 14:05:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 14:05:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-02 14:05:56,451 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-02 14:05:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:05:56,452 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-02 14:05:56,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:05:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-02 14:05:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 14:05:56,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:05:56,455 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 14:05:56,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:05:56,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:05:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-02 14:05:56,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:05:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:05:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:56,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:05:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:05:56,507 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 14:05:56,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:05:56,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:05:56,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:05:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:05:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:05:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:05:56,509 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-02 14:05:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:05:57,034 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-02 14:05:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:05:57,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 14:05:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:05:57,205 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 14:05:57,205 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 14:05:57,205 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 14:05:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 14:05:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 14:05:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 14:05:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-02 14:05:58,130 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-02 14:05:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:05:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-02 14:05:58,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:05:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-02 14:05:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 14:05:58,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:05:58,135 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] [2018-12-02 14:05:58,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:05:58,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:05:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-02 14:05:58,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:05:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:05:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:58,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:05:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:05:58,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:05:58,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:05:58,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:05:58,159 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:05:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:05:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:05:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:05:58,160 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-02 14:05:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:05:58,375 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-02 14:05:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:05:58,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 14:05:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:05:58,480 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 14:05:58,481 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 14:05:58,481 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 14:05:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 14:05:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 14:05:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 14:05:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-02 14:05:59,412 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-02 14:05:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:05:59,413 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-02 14:05:59,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:05:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-02 14:05:59,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:05:59,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:05:59,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:05:59,420 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:05:59,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:05:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-02 14:05:59,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:05:59,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:59,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:05:59,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:05:59,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:05:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:05:59,500 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 14:05:59,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:05:59,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:05:59,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:05:59,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:05:59,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:05:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:05:59,501 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-02 14:06:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:00,018 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-02 14:06:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:06:00,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 14:06:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:00,128 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 14:06:00,128 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 14:06:00,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:06:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 14:06:00,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 14:06:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 14:06:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-02 14:06:01,096 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-02 14:06:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:01,096 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-02 14:06:01,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-02 14:06:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:06:01,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:01,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:01,105 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:01,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-02 14:06:01,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:01,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:01,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:01,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:01,179 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 14:06:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:06:01,180 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:01,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:06:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:06:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:01,180 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-02 14:06:01,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:01,911 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-02 14:06:01,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:06:01,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 14:06:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:02,050 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 14:06:02,050 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 14:06:02,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:06:02,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 14:06:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 14:06:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 14:06:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-02 14:06:03,298 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-02 14:06:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:03,298 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-02 14:06:03,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:06:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-02 14:06:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:06:03,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:03,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:03,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:03,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-02 14:06:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:03,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:03,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:03,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:03,340 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 14:06:03,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:03,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:06:03,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:03,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:06:03,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:06:03,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:03,341 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2018-12-02 14:06:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:03,391 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-02 14:06:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:06:03,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 14:06:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:03,408 INFO L225 Difference]: With dead ends: 15375 [2018-12-02 14:06:03,408 INFO L226 Difference]: Without dead ends: 13789 [2018-12-02 14:06:03,409 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 14:06:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-02 14:06:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-02 14:06:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-02 14:06:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-02 14:06:03,547 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-02 14:06:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:03,548 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-02 14:06:03,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:06:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-02 14:06:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:06:03,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:03,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:03,549 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:03,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-02 14:06:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:03,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:03,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:03,578 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 14:06:03,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:03,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:03,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:03,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:03,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:03,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:03,579 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-02 14:06:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:03,817 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-02 14:06:03,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:06:03,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 14:06:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:03,838 INFO L225 Difference]: With dead ends: 19970 [2018-12-02 14:06:03,838 INFO L226 Difference]: Without dead ends: 19898 [2018-12-02 14:06:03,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:06:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-02 14:06:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-02 14:06:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-02 14:06:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-02 14:06:04,000 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-02 14:06:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:04,000 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-02 14:06:04,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-02 14:06:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:06:04,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:04,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:04,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:04,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:04,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-02 14:06:04,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:04,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:04,040 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 14:06:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:04,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:06:04,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:04,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:06:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:06:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:04,041 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-02 14:06:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:04,134 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-02 14:06:04,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:06:04,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 14:06:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:04,153 INFO L225 Difference]: With dead ends: 16617 [2018-12-02 14:06:04,153 INFO L226 Difference]: Without dead ends: 16617 [2018-12-02 14:06:04,153 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 14:06:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-02 14:06:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-02 14:06:04,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-02 14:06:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-02 14:06:04,307 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-02 14:06:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:04,307 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-02 14:06:04,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:06:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-02 14:06:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:06:04,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:04,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] [2018-12-02 14:06:04,310 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:04,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-02 14:06:04,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:04,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:04,367 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 14:06:04,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:04,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:04,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:04,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:04,368 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-02 14:06:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:04,616 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-02 14:06:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:06:04,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 14:06:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:04,647 INFO L225 Difference]: With dead ends: 28106 [2018-12-02 14:06:04,647 INFO L226 Difference]: Without dead ends: 28035 [2018-12-02 14:06:04,648 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 14:06:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-02 14:06:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-02 14:06:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-02 14:06:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-02 14:06:04,867 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-02 14:06:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:04,867 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-02 14:06:04,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-02 14:06:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 14:06:04,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:04,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:04,871 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:04,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:04,871 INFO L82 PathProgramCache]: Analyzing trace with hash 527633642, now seen corresponding path program 1 times [2018-12-02 14:06:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:04,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:04,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:04,896 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 14:06:04,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:04,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:06:04,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:04,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:06:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:06:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:06:04,896 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-02 14:06:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:05,028 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-02 14:06:05,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:06:05,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 14:06:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:05,047 INFO L225 Difference]: With dead ends: 18092 [2018-12-02 14:06:05,047 INFO L226 Difference]: Without dead ends: 18092 [2018-12-02 14:06:05,047 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 14:06:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-02 14:06:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-02 14:06:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-02 14:06:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-02 14:06:05,232 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-02 14:06:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:05,233 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-02 14:06:05,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:06:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-02 14:06:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 14:06:05,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:05,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:05,236 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:05,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:05,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1690124311, now seen corresponding path program 1 times [2018-12-02 14:06:05,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:05,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:05,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:05,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:05,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:05,261 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 14:06:05,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:05,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:06:05,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:05,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:06:05,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:06:05,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:05,262 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-02 14:06:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:05,425 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-02 14:06:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:06:05,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 14:06:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:05,447 INFO L225 Difference]: With dead ends: 21696 [2018-12-02 14:06:05,447 INFO L226 Difference]: Without dead ends: 21696 [2018-12-02 14:06:05,448 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 14:06:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-02 14:06:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-02 14:06:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-02 14:06:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-02 14:06:05,643 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-02 14:06:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:05,643 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-02 14:06:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:06:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-02 14:06:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:05,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:05,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:05,649 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:05,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1735068466, now seen corresponding path program 1 times [2018-12-02 14:06:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:05,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:05,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:05,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:05,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:05,694 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 14:06:05,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:05,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:05,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:05,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:05,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:05,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:05,695 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-02 14:06:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:06,290 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-02 14:06:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:06,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 14:06:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:06,314 INFO L225 Difference]: With dead ends: 23814 [2018-12-02 14:06:06,314 INFO L226 Difference]: Without dead ends: 23814 [2018-12-02 14:06:06,315 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 14:06:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-02 14:06:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-02 14:06:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-02 14:06:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-02 14:06:06,530 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-02 14:06:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:06,531 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-02 14:06:06,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-02 14:06:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:06,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:06,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:06,538 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:06,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash -342140877, now seen corresponding path program 1 times [2018-12-02 14:06:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:06,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:06,592 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 14:06:06,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:06,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:06,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:06,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:06,593 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-02 14:06:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:06,858 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-02 14:06:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:06:06,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 14:06:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:06,884 INFO L225 Difference]: With dead ends: 25702 [2018-12-02 14:06:06,884 INFO L226 Difference]: Without dead ends: 25702 [2018-12-02 14:06:06,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:06:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-02 14:06:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-02 14:06:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-02 14:06:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-02 14:06:07,105 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-02 14:06:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:07,105 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-02 14:06:07,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-02 14:06:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:07,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:07,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:07,112 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -130789964, now seen corresponding path program 1 times [2018-12-02 14:06:07,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:07,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:07,149 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 14:06:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:07,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:07,150 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-02 14:06:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:07,404 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-02 14:06:07,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:07,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 14:06:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:07,436 INFO L225 Difference]: With dead ends: 29793 [2018-12-02 14:06:07,436 INFO L226 Difference]: Without dead ends: 29793 [2018-12-02 14:06:07,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 14:06:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-02 14:06:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-02 14:06:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-02 14:06:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-02 14:06:07,714 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-02 14:06:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:07,714 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-02 14:06:07,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-02 14:06:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:07,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:07,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:07,722 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:07,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:07,722 INFO L82 PathProgramCache]: Analyzing trace with hash -641324141, now seen corresponding path program 1 times [2018-12-02 14:06:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:07,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:07,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:07,764 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 14:06:07,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:07,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:07,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:07,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:07,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:07,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:07,765 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-02 14:06:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:08,055 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-02 14:06:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:06:08,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 14:06:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:08,092 INFO L225 Difference]: With dead ends: 36420 [2018-12-02 14:06:08,093 INFO L226 Difference]: Without dead ends: 36420 [2018-12-02 14:06:08,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:06:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-02 14:06:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-02 14:06:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-02 14:06:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-02 14:06:08,490 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-02 14:06:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:08,491 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-02 14:06:08,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-02 14:06:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:08,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:08,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:08,498 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:08,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:08,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1846188692, now seen corresponding path program 1 times [2018-12-02 14:06:08,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:08,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:08,526 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 14:06:08,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:08,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:08,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:08,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:08,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:08,527 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 5 states. [2018-12-02 14:06:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:08,557 INFO L93 Difference]: Finished difference Result 9076 states and 21915 transitions. [2018-12-02 14:06:08,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:06:08,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 14:06:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:08,562 INFO L225 Difference]: With dead ends: 9076 [2018-12-02 14:06:08,562 INFO L226 Difference]: Without dead ends: 7224 [2018-12-02 14:06:08,562 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 14:06:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-12-02 14:06:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6121. [2018-12-02 14:06:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-02 14:06:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14386 transitions. [2018-12-02 14:06:08,608 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14386 transitions. Word has length 67 [2018-12-02 14:06:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:08,608 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14386 transitions. [2018-12-02 14:06:08,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14386 transitions. [2018-12-02 14:06:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:06:08,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:08,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:08,612 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:08,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:08,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-02 14:06:08,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:08,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:08,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:06:08,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:08,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:06:08,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:08,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:06:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:06:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:06:08,640 INFO L87 Difference]: Start difference. First operand 6121 states and 14386 transitions. Second operand 3 states. [2018-12-02 14:06:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:08,670 INFO L93 Difference]: Finished difference Result 8340 states and 19493 transitions. [2018-12-02 14:06:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:06:08,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 14:06:08,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:08,677 INFO L225 Difference]: With dead ends: 8340 [2018-12-02 14:06:08,677 INFO L226 Difference]: Without dead ends: 8340 [2018-12-02 14:06:08,677 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 14:06:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2018-12-02 14:06:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 6060. [2018-12-02 14:06:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6060 states. [2018-12-02 14:06:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 13926 transitions. [2018-12-02 14:06:08,722 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 13926 transitions. Word has length 67 [2018-12-02 14:06:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:08,723 INFO L480 AbstractCegarLoop]: Abstraction has 6060 states and 13926 transitions. [2018-12-02 14:06:08,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:06:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 13926 transitions. [2018-12-02 14:06:08,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 14:06:08,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:08,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:08,726 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:08,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-02 14:06:08,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:08,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:08,762 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 14:06:08,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:08,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:08,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:08,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:08,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:08,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:08,763 INFO L87 Difference]: Start difference. First operand 6060 states and 13926 transitions. Second operand 5 states. [2018-12-02 14:06:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:08,866 INFO L93 Difference]: Finished difference Result 7230 states and 16567 transitions. [2018-12-02 14:06:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:06:08,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 14:06:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:08,871 INFO L225 Difference]: With dead ends: 7230 [2018-12-02 14:06:08,871 INFO L226 Difference]: Without dead ends: 7230 [2018-12-02 14:06:08,871 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 14:06:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2018-12-02 14:06:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 6504. [2018-12-02 14:06:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2018-12-02 14:06:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 14930 transitions. [2018-12-02 14:06:08,916 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 14930 transitions. Word has length 73 [2018-12-02 14:06:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:08,916 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 14930 transitions. [2018-12-02 14:06:08,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 14930 transitions. [2018-12-02 14:06:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 14:06:08,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:08,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:08,920 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:08,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-02 14:06:08,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:08,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:08,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:08,971 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 14:06:08,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:08,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:06:08,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:08,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:06:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:06:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:08,972 INFO L87 Difference]: Start difference. First operand 6504 states and 14930 transitions. Second operand 7 states. [2018-12-02 14:06:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:09,220 INFO L93 Difference]: Finished difference Result 7577 states and 17192 transitions. [2018-12-02 14:06:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:06:09,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 14:06:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:09,225 INFO L225 Difference]: With dead ends: 7577 [2018-12-02 14:06:09,225 INFO L226 Difference]: Without dead ends: 7458 [2018-12-02 14:06:09,225 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 14:06:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2018-12-02 14:06:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6601. [2018-12-02 14:06:09,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-02 14:06:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 15023 transitions. [2018-12-02 14:06:09,275 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 15023 transitions. Word has length 73 [2018-12-02 14:06:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:09,275 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 15023 transitions. [2018-12-02 14:06:09,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:06:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 15023 transitions. [2018-12-02 14:06:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 14:06:09,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:09,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:09,280 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:09,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1914844155, now seen corresponding path program 1 times [2018-12-02 14:06:09,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:09,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:09,303 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 14:06:09,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:09,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:06:09,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:09,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:06:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:06:09,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:09,304 INFO L87 Difference]: Start difference. First operand 6601 states and 15023 transitions. Second operand 4 states. [2018-12-02 14:06:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:09,468 INFO L93 Difference]: Finished difference Result 10288 states and 23294 transitions. [2018-12-02 14:06:09,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:06:09,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 14:06:09,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:09,474 INFO L225 Difference]: With dead ends: 10288 [2018-12-02 14:06:09,475 INFO L226 Difference]: Without dead ends: 10288 [2018-12-02 14:06:09,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2018-12-02 14:06:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 7721. [2018-12-02 14:06:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2018-12-02 14:06:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 17357 transitions. [2018-12-02 14:06:09,539 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 17357 transitions. Word has length 92 [2018-12-02 14:06:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:09,540 INFO L480 AbstractCegarLoop]: Abstraction has 7721 states and 17357 transitions. [2018-12-02 14:06:09,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:06:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 17357 transitions. [2018-12-02 14:06:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 14:06:09,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:09,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:09,545 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:09,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1127474233, now seen corresponding path program 2 times [2018-12-02 14:06:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:09,588 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 14:06:09,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:06:09,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:09,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:06:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:06:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:06:09,589 INFO L87 Difference]: Start difference. First operand 7721 states and 17357 transitions. Second operand 4 states. [2018-12-02 14:06:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:09,651 INFO L93 Difference]: Finished difference Result 8286 states and 18650 transitions. [2018-12-02 14:06:09,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:06:09,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 14:06:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:09,658 INFO L225 Difference]: With dead ends: 8286 [2018-12-02 14:06:09,659 INFO L226 Difference]: Without dead ends: 8286 [2018-12-02 14:06:09,659 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 14:06:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-02 14:06:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 7627. [2018-12-02 14:06:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2018-12-02 14:06:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 17252 transitions. [2018-12-02 14:06:09,719 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 17252 transitions. Word has length 92 [2018-12-02 14:06:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:09,719 INFO L480 AbstractCegarLoop]: Abstraction has 7627 states and 17252 transitions. [2018-12-02 14:06:09,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:06:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 17252 transitions. [2018-12-02 14:06:09,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:09,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:09,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:09,724 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:09,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash 879761931, now seen corresponding path program 1 times [2018-12-02 14:06:09,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:06:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:09,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:09,789 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 14:06:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:09,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:06:09,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:09,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:06:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:06:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:09,790 INFO L87 Difference]: Start difference. First operand 7627 states and 17252 transitions. Second operand 7 states. [2018-12-02 14:06:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:10,108 INFO L93 Difference]: Finished difference Result 9401 states and 21200 transitions. [2018-12-02 14:06:10,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:10,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 14:06:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:10,115 INFO L225 Difference]: With dead ends: 9401 [2018-12-02 14:06:10,115 INFO L226 Difference]: Without dead ends: 9401 [2018-12-02 14:06:10,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2018-12-02 14:06:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 7739. [2018-12-02 14:06:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2018-12-02 14:06:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 17572 transitions. [2018-12-02 14:06:10,176 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 17572 transitions. Word has length 94 [2018-12-02 14:06:10,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:10,177 INFO L480 AbstractCegarLoop]: Abstraction has 7739 states and 17572 transitions. [2018-12-02 14:06:10,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:06:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 17572 transitions. [2018-12-02 14:06:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:10,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:10,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:10,182 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:10,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 45519536, now seen corresponding path program 1 times [2018-12-02 14:06:10,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:10,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:10,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:10,224 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 14:06:10,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:10,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:10,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:10,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:10,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:10,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:10,225 INFO L87 Difference]: Start difference. First operand 7739 states and 17572 transitions. Second operand 5 states. [2018-12-02 14:06:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:10,289 INFO L93 Difference]: Finished difference Result 8646 states and 19530 transitions. [2018-12-02 14:06:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:10,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 14:06:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:10,295 INFO L225 Difference]: With dead ends: 8646 [2018-12-02 14:06:10,295 INFO L226 Difference]: Without dead ends: 8646 [2018-12-02 14:06:10,296 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 14:06:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-12-02 14:06:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 6635. [2018-12-02 14:06:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6635 states. [2018-12-02 14:06:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 15091 transitions. [2018-12-02 14:06:10,348 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 15091 transitions. Word has length 94 [2018-12-02 14:06:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:10,348 INFO L480 AbstractCegarLoop]: Abstraction has 6635 states and 15091 transitions. [2018-12-02 14:06:10,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 15091 transitions. [2018-12-02 14:06:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:10,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:10,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:10,354 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:10,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash -209217009, now seen corresponding path program 1 times [2018-12-02 14:06:10,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:10,398 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 14:06:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:10,398 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:10,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:10,399 INFO L87 Difference]: Start difference. First operand 6635 states and 15091 transitions. Second operand 5 states. [2018-12-02 14:06:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:10,639 INFO L93 Difference]: Finished difference Result 10801 states and 24708 transitions. [2018-12-02 14:06:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:06:10,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 14:06:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:10,646 INFO L225 Difference]: With dead ends: 10801 [2018-12-02 14:06:10,646 INFO L226 Difference]: Without dead ends: 10723 [2018-12-02 14:06:10,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:06:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10723 states. [2018-12-02 14:06:10,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10723 to 7776. [2018-12-02 14:06:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7776 states. [2018-12-02 14:06:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7776 states to 7776 states and 17738 transitions. [2018-12-02 14:06:10,707 INFO L78 Accepts]: Start accepts. Automaton has 7776 states and 17738 transitions. Word has length 94 [2018-12-02 14:06:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:10,708 INFO L480 AbstractCegarLoop]: Abstraction has 7776 states and 17738 transitions. [2018-12-02 14:06:10,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7776 states and 17738 transitions. [2018-12-02 14:06:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:10,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:10,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:10,712 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:10,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1035547472, now seen corresponding path program 1 times [2018-12-02 14:06:10,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:10,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:10,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:10,758 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 14:06:10,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:10,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:10,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:10,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:10,759 INFO L87 Difference]: Start difference. First operand 7776 states and 17738 transitions. Second operand 6 states. [2018-12-02 14:06:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:10,930 INFO L93 Difference]: Finished difference Result 9783 states and 22140 transitions. [2018-12-02 14:06:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:06:10,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 14:06:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:10,936 INFO L225 Difference]: With dead ends: 9783 [2018-12-02 14:06:10,937 INFO L226 Difference]: Without dead ends: 9704 [2018-12-02 14:06:10,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:06:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-02 14:06:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7375. [2018-12-02 14:06:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2018-12-02 14:06:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16848 transitions. [2018-12-02 14:06:10,995 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16848 transitions. Word has length 94 [2018-12-02 14:06:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:10,995 INFO L480 AbstractCegarLoop]: Abstraction has 7375 states and 16848 transitions. [2018-12-02 14:06:10,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16848 transitions. [2018-12-02 14:06:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:11,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:11,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:11,000 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:11,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash -202429449, now seen corresponding path program 1 times [2018-12-02 14:06:11,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:11,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:11,074 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 14:06:11,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:11,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:06:11,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:11,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:06:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:06:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:06:11,075 INFO L87 Difference]: Start difference. First operand 7375 states and 16848 transitions. Second operand 9 states. [2018-12-02 14:06:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:11,379 INFO L93 Difference]: Finished difference Result 10375 states and 23670 transitions. [2018-12-02 14:06:11,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 14:06:11,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 14:06:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:11,386 INFO L225 Difference]: With dead ends: 10375 [2018-12-02 14:06:11,386 INFO L226 Difference]: Without dead ends: 10343 [2018-12-02 14:06:11,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:06:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2018-12-02 14:06:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 9164. [2018-12-02 14:06:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-02 14:06:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 20930 transitions. [2018-12-02 14:06:11,458 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 20930 transitions. Word has length 94 [2018-12-02 14:06:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:11,458 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 20930 transitions. [2018-12-02 14:06:11,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:06:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 20930 transitions. [2018-12-02 14:06:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:11,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:11,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:11,464 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:11,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1999380808, now seen corresponding path program 1 times [2018-12-02 14:06:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:06:11,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:11,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 14:06:11,534 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:06:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:06:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:06:11,535 INFO L87 Difference]: Start difference. First operand 9164 states and 20930 transitions. Second operand 8 states. [2018-12-02 14:06:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:11,771 INFO L93 Difference]: Finished difference Result 14572 states and 33838 transitions. [2018-12-02 14:06:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:06:11,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 14:06:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:11,781 INFO L225 Difference]: With dead ends: 14572 [2018-12-02 14:06:11,781 INFO L226 Difference]: Without dead ends: 14572 [2018-12-02 14:06:11,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 14:06:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2018-12-02 14:06:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 9802. [2018-12-02 14:06:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9802 states. [2018-12-02 14:06:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 22597 transitions. [2018-12-02 14:06:11,868 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 22597 transitions. Word has length 94 [2018-12-02 14:06:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:11,869 INFO L480 AbstractCegarLoop]: Abstraction has 9802 states and 22597 transitions. [2018-12-02 14:06:11,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:06:11,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 22597 transitions. [2018-12-02 14:06:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:11,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:11,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:11,876 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:11,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1111877127, now seen corresponding path program 1 times [2018-12-02 14:06:11,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:11,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:11,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:11,950 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 14:06:11,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:11,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:06:11,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:11,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:06:11,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:06:11,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:11,950 INFO L87 Difference]: Start difference. First operand 9802 states and 22597 transitions. Second operand 7 states. [2018-12-02 14:06:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:12,043 INFO L93 Difference]: Finished difference Result 13733 states and 31919 transitions. [2018-12-02 14:06:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:12,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 14:06:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:12,053 INFO L225 Difference]: With dead ends: 13733 [2018-12-02 14:06:12,053 INFO L226 Difference]: Without dead ends: 13733 [2018-12-02 14:06:12,053 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 14:06:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2018-12-02 14:06:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 9882. [2018-12-02 14:06:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9882 states. [2018-12-02 14:06:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9882 states to 9882 states and 22528 transitions. [2018-12-02 14:06:12,133 INFO L78 Accepts]: Start accepts. Automaton has 9882 states and 22528 transitions. Word has length 94 [2018-12-02 14:06:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:12,133 INFO L480 AbstractCegarLoop]: Abstraction has 9882 states and 22528 transitions. [2018-12-02 14:06:12,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:06:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9882 states and 22528 transitions. [2018-12-02 14:06:12,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:06:12,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:12,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:12,140 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:12,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:12,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1451114617, now seen corresponding path program 1 times [2018-12-02 14:06:12,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:12,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:12,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:12,216 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 14:06:12,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:12,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:12,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:12,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:12,216 INFO L87 Difference]: Start difference. First operand 9882 states and 22528 transitions. Second operand 6 states. [2018-12-02 14:06:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:12,298 INFO L93 Difference]: Finished difference Result 9610 states and 21576 transitions. [2018-12-02 14:06:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:12,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 14:06:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:12,304 INFO L225 Difference]: With dead ends: 9610 [2018-12-02 14:06:12,304 INFO L226 Difference]: Without dead ends: 9610 [2018-12-02 14:06:12,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:06:12,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-02 14:06:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 5823. [2018-12-02 14:06:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5823 states. [2018-12-02 14:06:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5823 states to 5823 states and 13050 transitions. [2018-12-02 14:06:12,358 INFO L78 Accepts]: Start accepts. Automaton has 5823 states and 13050 transitions. Word has length 94 [2018-12-02 14:06:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:12,358 INFO L480 AbstractCegarLoop]: Abstraction has 5823 states and 13050 transitions. [2018-12-02 14:06:12,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5823 states and 13050 transitions. [2018-12-02 14:06:12,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:12,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:12,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:12,361 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:12,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 322215098, now seen corresponding path program 1 times [2018-12-02 14:06:12,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:12,448 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 14:06:12,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:12,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:06:12,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:12,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:06:12,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:06:12,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:06:12,449 INFO L87 Difference]: Start difference. First operand 5823 states and 13050 transitions. Second operand 9 states. [2018-12-02 14:06:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:12,706 INFO L93 Difference]: Finished difference Result 6968 states and 15490 transitions. [2018-12-02 14:06:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 14:06:12,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 14:06:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:12,711 INFO L225 Difference]: With dead ends: 6968 [2018-12-02 14:06:12,711 INFO L226 Difference]: Without dead ends: 6968 [2018-12-02 14:06:12,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:06:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2018-12-02 14:06:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 6729. [2018-12-02 14:06:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-02 14:06:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 15021 transitions. [2018-12-02 14:06:12,755 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 15021 transitions. Word has length 96 [2018-12-02 14:06:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:12,755 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 15021 transitions. [2018-12-02 14:06:12,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:06:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 15021 transitions. [2018-12-02 14:06:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:12,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:12,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:12,759 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:12,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:12,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1209718779, now seen corresponding path program 1 times [2018-12-02 14:06:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:12,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:12,858 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 14:06:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 14:06:12,858 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:12,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:06:12,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:06:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:06:12,859 INFO L87 Difference]: Start difference. First operand 6729 states and 15021 transitions. Second operand 11 states. [2018-12-02 14:06:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:13,634 INFO L93 Difference]: Finished difference Result 12990 states and 29183 transitions. [2018-12-02 14:06:13,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:06:13,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 14:06:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:13,640 INFO L225 Difference]: With dead ends: 12990 [2018-12-02 14:06:13,640 INFO L226 Difference]: Without dead ends: 8864 [2018-12-02 14:06:13,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:06:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2018-12-02 14:06:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 6572. [2018-12-02 14:06:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6572 states. [2018-12-02 14:06:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 14628 transitions. [2018-12-02 14:06:13,695 INFO L78 Accepts]: Start accepts. Automaton has 6572 states and 14628 transitions. Word has length 96 [2018-12-02 14:06:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 6572 states and 14628 transitions. [2018-12-02 14:06:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:06:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6572 states and 14628 transitions. [2018-12-02 14:06:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:13,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:13,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:13,700 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:13,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1847691802, now seen corresponding path program 1 times [2018-12-02 14:06:13,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:13,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:13,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:13,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:13,760 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 14:06:13,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:13,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:06:13,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:13,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:06:13,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:06:13,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:06:13,761 INFO L87 Difference]: Start difference. First operand 6572 states and 14628 transitions. Second operand 5 states. [2018-12-02 14:06:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:13,875 INFO L93 Difference]: Finished difference Result 5952 states and 13080 transitions. [2018-12-02 14:06:13,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:06:13,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 14:06:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:13,879 INFO L225 Difference]: With dead ends: 5952 [2018-12-02 14:06:13,879 INFO L226 Difference]: Without dead ends: 5931 [2018-12-02 14:06:13,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2018-12-02 14:06:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5552. [2018-12-02 14:06:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-12-02 14:06:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12239 transitions. [2018-12-02 14:06:13,916 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12239 transitions. Word has length 96 [2018-12-02 14:06:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:13,916 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12239 transitions. [2018-12-02 14:06:13,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:06:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12239 transitions. [2018-12-02 14:06:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:13,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:13,920 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:13,921 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:13,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:13,921 INFO L82 PathProgramCache]: Analyzing trace with hash -157130344, now seen corresponding path program 2 times [2018-12-02 14:06:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:13,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:13,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:13,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:13,979 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 14:06:13,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:13,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:13,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:13,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:13,980 INFO L87 Difference]: Start difference. First operand 5552 states and 12239 transitions. Second operand 6 states. [2018-12-02 14:06:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:14,146 INFO L93 Difference]: Finished difference Result 6325 states and 13928 transitions. [2018-12-02 14:06:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:06:14,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 14:06:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:14,150 INFO L225 Difference]: With dead ends: 6325 [2018-12-02 14:06:14,150 INFO L226 Difference]: Without dead ends: 6283 [2018-12-02 14:06:14,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:06:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2018-12-02 14:06:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 5716. [2018-12-02 14:06:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-02 14:06:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12591 transitions. [2018-12-02 14:06:14,188 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12591 transitions. Word has length 96 [2018-12-02 14:06:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:14,188 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12591 transitions. [2018-12-02 14:06:14,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12591 transitions. [2018-12-02 14:06:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:14,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:14,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:14,192 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:14,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2092257192, now seen corresponding path program 1 times [2018-12-02 14:06:14,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:14,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:06:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:14,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:06:14,245 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 14:06:14,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:06:14,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:06:14,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:06:14,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:06:14,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:06:14,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:06:14,246 INFO L87 Difference]: Start difference. First operand 5716 states and 12591 transitions. Second operand 6 states. [2018-12-02 14:06:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:06:14,325 INFO L93 Difference]: Finished difference Result 6530 states and 14233 transitions. [2018-12-02 14:06:14,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:06:14,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 14:06:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:06:14,329 INFO L225 Difference]: With dead ends: 6530 [2018-12-02 14:06:14,329 INFO L226 Difference]: Without dead ends: 6480 [2018-12-02 14:06:14,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:06:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2018-12-02 14:06:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 5593. [2018-12-02 14:06:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5593 states. [2018-12-02 14:06:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 12240 transitions. [2018-12-02 14:06:14,367 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 12240 transitions. Word has length 96 [2018-12-02 14:06:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:06:14,367 INFO L480 AbstractCegarLoop]: Abstraction has 5593 states and 12240 transitions. [2018-12-02 14:06:14,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:06:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 12240 transitions. [2018-12-02 14:06:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 14:06:14,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:06:14,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:06:14,370 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:06:14,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:06:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1130643175, now seen corresponding path program 2 times [2018-12-02 14:06:14,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:06:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:06:14,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:06:14,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:06:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:06:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:06:14,406 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:06:14,468 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 14:06:14,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:06:14 BasicIcfg [2018-12-02 14:06:14,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:06:14,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:06:14,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:06:14,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:06:14,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:05:51" (3/4) ... [2018-12-02 14:06:14,471 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:06:14,536 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_92d4a857-f498-4613-9d00-9191b2c72b1a/bin-2019/utaipan/witness.graphml [2018-12-02 14:06:14,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:06:14,537 INFO L168 Benchmark]: Toolchain (without parser) took 23559.51 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 947.0 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 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 14:06:14,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 INFO L168 Benchmark]: Boogie Preprocessor took 20.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 INFO L168 Benchmark]: RCFGBuilder took 331.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 INFO L168 Benchmark]: TraceAbstraction took 22779.83 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,538 INFO L168 Benchmark]: Witness Printer took 67.00 ms. Allocated memory is still 4.1 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:06:14,539 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 328.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -143.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 331.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22779.83 ms. Allocated memory was 1.1 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 67.00 ms. Allocated memory is still 4.1 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1099; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1100; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 22.7s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9628 SDtfs, 10818 SDslu, 21968 SDs, 0 SdLazy, 9600 SolverSat, 590 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 91 SyntacticMatches, 31 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred 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: 8.7s AutomataMinimizationTime, 35 MinimizatonAttempts, 175848 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2700 NumberOfCodeBlocks, 2700 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 599295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...