./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.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_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/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 8779471c632a53a1c78816502893e61b74924e89 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:52:23,111 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:52:23,113 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:52:23,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:52:23,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:52:23,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:52:23,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:52:23,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:52:23,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:52:23,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:52:23,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:52:23,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:52:23,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:52:23,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:52:23,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:52:23,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:52:23,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:52:23,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:52:23,133 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:52:23,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:52:23,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:52:23,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:52:23,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:52:23,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:52:23,137 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:52:23,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:52:23,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:52:23,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:52:23,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:52:23,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:52:23,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:52:23,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:52:23,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:52:23,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:52:23,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:52:23,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:52:23,143 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:52:23,153 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:52:23,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:52:23,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:52:23,154 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:52:23,154 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:52:23,155 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:52:23,155 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:52:23,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:52:23,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:52:23,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:52:23,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:52:23,157 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_b2c5bce0-1e46-4033-8e36-d28d837018fa/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 -> 8779471c632a53a1c78816502893e61b74924e89 [2018-12-02 09:52:23,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:52:23,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:52:23,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:52:23,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:52:23,184 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:52:23,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-02 09:52:23,219 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/data/021678f39/760cc5671efb4d2a8dced4822ddb7bc7/FLAG7ea72cc2a [2018-12-02 09:52:23,698 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:52:23,699 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/sv-benchmarks/c/pthread-wmm/rfi001_tso.oepc_false-unreach-call.i [2018-12-02 09:52:23,705 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/data/021678f39/760cc5671efb4d2a8dced4822ddb7bc7/FLAG7ea72cc2a [2018-12-02 09:52:23,714 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/data/021678f39/760cc5671efb4d2a8dced4822ddb7bc7 [2018-12-02 09:52:23,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:52:23,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:52:23,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:52:23,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:52:23,721 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:52:23,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:52:23" (1/1) ... [2018-12-02 09:52:23,723 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 09:52:23, skipping insertion in model container [2018-12-02 09:52:23,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:52:23" (1/1) ... [2018-12-02 09:52:23,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:52:23,758 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:52:23,937 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:52:23,945 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:52:24,018 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:52:24,047 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:52:24,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24 WrapperNode [2018-12-02 09:52:24,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:52:24,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:52:24,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:52:24,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:52:24,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:52:24,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:52:24,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:52:24,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:52:24,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... [2018-12-02 09:52:24,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:52:24,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:52:24,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:52:24,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:52:24,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/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 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 09:52:24,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 09:52:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 09:52:24,135 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 09:52:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 09:52:24,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:52:24,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:52:24,136 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 09:52:24,413 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:52:24,413 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 09:52:24,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:24 BoogieIcfgContainer [2018-12-02 09:52:24,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:52:24,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:52:24,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:52:24,417 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:52:24,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:52:23" (1/3) ... [2018-12-02 09:52:24,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab87600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:52:24, skipping insertion in model container [2018-12-02 09:52:24,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:52:24" (2/3) ... [2018-12-02 09:52:24,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab87600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:52:24, skipping insertion in model container [2018-12-02 09:52:24,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:24" (3/3) ... [2018-12-02 09:52:24,420 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_tso.oepc_false-unreach-call.i [2018-12-02 09:52:24,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,443 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,443 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,443 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,444 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,445 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,446 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,447 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,448 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,449 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,450 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,451 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,452 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,453 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,454 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 09:52:24,458 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 09:52:24,458 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:52:24,465 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 09:52:24,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 09:52:24,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:52:24,490 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:52:24,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:52:24,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:52:24,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:52:24,490 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:52:24,490 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:52:24,490 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:52:24,496 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 09:52:25,325 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-02 09:52:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-02 09:52:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 09:52:25,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:25,332 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] [2018-12-02 09:52:25,334 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:25,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:25,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2006103772, now seen corresponding path program 1 times [2018-12-02 09:52:25,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:25,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:25,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:25,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:25,487 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 09:52:25,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:25,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:25,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:25,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:25,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:25,501 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-02 09:52:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:25,886 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-02 09:52:25,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:25,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-02 09:52:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:26,047 INFO L225 Difference]: With dead ends: 45389 [2018-12-02 09:52:26,047 INFO L226 Difference]: Without dead ends: 40629 [2018-12-02 09:52:26,049 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 09:52:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-02 09:52:26,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-02 09:52:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 09:52:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-02 09:52:26,730 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-02 09:52:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:26,730 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-02 09:52:26,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-02 09:52:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 09:52:26,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:26,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:26,734 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:26,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:26,735 INFO L82 PathProgramCache]: Analyzing trace with hash 455349977, now seen corresponding path program 1 times [2018-12-02 09:52:26,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:26,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:26,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:26,785 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 09:52:26,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:26,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:52:26,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:26,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:52:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:52:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:26,787 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-02 09:52:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:26,968 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-02 09:52:26,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:52:26,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 09:52:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:27,031 INFO L225 Difference]: With dead ends: 23663 [2018-12-02 09:52:27,032 INFO L226 Difference]: Without dead ends: 23663 [2018-12-02 09:52:27,032 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 09:52:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-02 09:52:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-02 09:52:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-02 09:52:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-02 09:52:27,462 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-02 09:52:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:27,462 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-02 09:52:27,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:52:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-02 09:52:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 09:52:27,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:27,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] [2018-12-02 09:52:27,464 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:27,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1341601382, now seen corresponding path program 1 times [2018-12-02 09:52:27,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:27,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:27,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:27,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:27,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:27,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:27,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:27,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:27,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:27,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:27,506 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-02 09:52:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:28,063 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-02 09:52:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:52:28,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-02 09:52:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:28,198 INFO L225 Difference]: With dead ends: 64831 [2018-12-02 09:52:28,198 INFO L226 Difference]: Without dead ends: 64671 [2018-12-02 09:52:28,198 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 09:52:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-02 09:52:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-02 09:52:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 09:52:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-02 09:52:28,959 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-02 09:52:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:28,960 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-02 09:52:28,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-02 09:52:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 09:52:28,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:28,962 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 09:52:28,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:28,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:28,962 INFO L82 PathProgramCache]: Analyzing trace with hash -636463316, now seen corresponding path program 1 times [2018-12-02 09:52:28,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:28,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:28,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:28,997 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 09:52:28,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:52:28,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:52:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:52:28,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:28,998 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-02 09:52:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:29,149 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-02 09:52:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:52:29,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 09:52:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:29,210 INFO L225 Difference]: With dead ends: 37143 [2018-12-02 09:52:29,210 INFO L226 Difference]: Without dead ends: 37143 [2018-12-02 09:52:29,210 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 09:52:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-02 09:52:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-02 09:52:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-02 09:52:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-02 09:52:29,854 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-02 09:52:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:29,854 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-02 09:52:29,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:52:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-02 09:52:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 09:52:29,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:29,857 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 09:52:29,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:29,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1106347019, now seen corresponding path program 1 times [2018-12-02 09:52:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:29,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:29,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:29,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:29,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:29,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:29,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:29,911 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 4 states. [2018-12-02 09:52:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:29,954 INFO L93 Difference]: Finished difference Result 12365 states and 41168 transitions. [2018-12-02 09:52:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:29,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 09:52:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:29,968 INFO L225 Difference]: With dead ends: 12365 [2018-12-02 09:52:29,969 INFO L226 Difference]: Without dead ends: 11844 [2018-12-02 09:52:29,969 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 09:52:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11844 states. [2018-12-02 09:52:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11844 to 11844. [2018-12-02 09:52:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11844 states. [2018-12-02 09:52:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11844 states to 11844 states and 39616 transitions. [2018-12-02 09:52:30,088 INFO L78 Accepts]: Start accepts. Automaton has 11844 states and 39616 transitions. Word has length 46 [2018-12-02 09:52:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:30,088 INFO L480 AbstractCegarLoop]: Abstraction has 11844 states and 39616 transitions. [2018-12-02 09:52:30,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 11844 states and 39616 transitions. [2018-12-02 09:52:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 09:52:30,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:30,090 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] [2018-12-02 09:52:30,090 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:30,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 597708037, now seen corresponding path program 1 times [2018-12-02 09:52:30,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:30,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:30,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:30,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:30,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:30,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:30,139 INFO L87 Difference]: Start difference. First operand 11844 states and 39616 transitions. Second operand 4 states. [2018-12-02 09:52:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:30,291 INFO L93 Difference]: Finished difference Result 17020 states and 55692 transitions. [2018-12-02 09:52:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:30,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 09:52:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:30,311 INFO L225 Difference]: With dead ends: 17020 [2018-12-02 09:52:30,311 INFO L226 Difference]: Without dead ends: 17020 [2018-12-02 09:52:30,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17020 states. [2018-12-02 09:52:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17020 to 12880. [2018-12-02 09:52:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12880 states. [2018-12-02 09:52:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12880 states to 12880 states and 42719 transitions. [2018-12-02 09:52:30,468 INFO L78 Accepts]: Start accepts. Automaton has 12880 states and 42719 transitions. Word has length 59 [2018-12-02 09:52:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:30,468 INFO L480 AbstractCegarLoop]: Abstraction has 12880 states and 42719 transitions. [2018-12-02 09:52:30,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 12880 states and 42719 transitions. [2018-12-02 09:52:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 09:52:30,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:30,471 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] [2018-12-02 09:52:30,471 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:30,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:30,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1954448924, now seen corresponding path program 1 times [2018-12-02 09:52:30,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:30,523 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 09:52:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:30,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:30,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:30,524 INFO L87 Difference]: Start difference. First operand 12880 states and 42719 transitions. Second operand 5 states. [2018-12-02 09:52:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:30,553 INFO L93 Difference]: Finished difference Result 2524 states and 6736 transitions. [2018-12-02 09:52:30,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:30,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-12-02 09:52:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:30,555 INFO L225 Difference]: With dead ends: 2524 [2018-12-02 09:52:30,555 INFO L226 Difference]: Without dead ends: 2112 [2018-12-02 09:52:30,556 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 09:52:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2018-12-02 09:52:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2009. [2018-12-02 09:52:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2009 states. [2018-12-02 09:52:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 5339 transitions. [2018-12-02 09:52:30,570 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 5339 transitions. Word has length 59 [2018-12-02 09:52:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:30,571 INFO L480 AbstractCegarLoop]: Abstraction has 2009 states and 5339 transitions. [2018-12-02 09:52:30,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 5339 transitions. [2018-12-02 09:52:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 09:52:30,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:30,573 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 09:52:30,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:30,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -226906360, now seen corresponding path program 1 times [2018-12-02 09:52:30,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:30,623 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 09:52:30,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:30,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:30,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:30,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:30,623 INFO L87 Difference]: Start difference. First operand 2009 states and 5339 transitions. Second operand 4 states. [2018-12-02 09:52:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:30,707 INFO L93 Difference]: Finished difference Result 2446 states and 6386 transitions. [2018-12-02 09:52:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:30,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 09:52:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:30,709 INFO L225 Difference]: With dead ends: 2446 [2018-12-02 09:52:30,710 INFO L226 Difference]: Without dead ends: 2446 [2018-12-02 09:52:30,710 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 09:52:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-12-02 09:52:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2098. [2018-12-02 09:52:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-12-02 09:52:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 5541 transitions. [2018-12-02 09:52:30,732 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 5541 transitions. Word has length 92 [2018-12-02 09:52:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:30,732 INFO L480 AbstractCegarLoop]: Abstraction has 2098 states and 5541 transitions. [2018-12-02 09:52:30,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 5541 transitions. [2018-12-02 09:52:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 09:52:30,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:30,735 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 09:52:30,735 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:30,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:30,735 INFO L82 PathProgramCache]: Analyzing trace with hash 742674663, now seen corresponding path program 1 times [2018-12-02 09:52:30,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:30,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:30,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:30,768 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 09:52:30,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:30,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:30,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:30,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:30,769 INFO L87 Difference]: Start difference. First operand 2098 states and 5541 transitions. Second operand 4 states. [2018-12-02 09:52:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:30,894 INFO L93 Difference]: Finished difference Result 3056 states and 8111 transitions. [2018-12-02 09:52:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:30,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 09:52:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:30,896 INFO L225 Difference]: With dead ends: 3056 [2018-12-02 09:52:30,897 INFO L226 Difference]: Without dead ends: 3056 [2018-12-02 09:52:30,897 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 09:52:30,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2018-12-02 09:52:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2063. [2018-12-02 09:52:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2018-12-02 09:52:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 5402 transitions. [2018-12-02 09:52:30,914 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 5402 transitions. Word has length 92 [2018-12-02 09:52:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:30,914 INFO L480 AbstractCegarLoop]: Abstraction has 2063 states and 5402 transitions. [2018-12-02 09:52:30,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 5402 transitions. [2018-12-02 09:52:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 09:52:30,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:30,916 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 09:52:30,916 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 6831737, now seen corresponding path program 2 times [2018-12-02 09:52:30,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:30,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:30,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 09:52:30,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:30,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:30,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:30,980 INFO L87 Difference]: Start difference. First operand 2063 states and 5402 transitions. Second operand 5 states. [2018-12-02 09:52:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:31,122 INFO L93 Difference]: Finished difference Result 2421 states and 6268 transitions. [2018-12-02 09:52:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:52:31,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-02 09:52:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:31,125 INFO L225 Difference]: With dead ends: 2421 [2018-12-02 09:52:31,125 INFO L226 Difference]: Without dead ends: 2421 [2018-12-02 09:52:31,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2018-12-02 09:52:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2059. [2018-12-02 09:52:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2059 states. [2018-12-02 09:52:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 5393 transitions. [2018-12-02 09:52:31,149 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 5393 transitions. Word has length 92 [2018-12-02 09:52:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:31,150 INFO L480 AbstractCegarLoop]: Abstraction has 2059 states and 5393 transitions. [2018-12-02 09:52:31,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 5393 transitions. [2018-12-02 09:52:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 09:52:31,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:31,153 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 09:52:31,153 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:31,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1791236764, now seen corresponding path program 1 times [2018-12-02 09:52:31,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:52:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:31,190 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 09:52:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:31,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:52:31,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:31,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:52:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:52:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:52:31,191 INFO L87 Difference]: Start difference. First operand 2059 states and 5393 transitions. Second operand 3 states. [2018-12-02 09:52:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:31,266 INFO L93 Difference]: Finished difference Result 2109 states and 5500 transitions. [2018-12-02 09:52:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:52:31,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-02 09:52:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:31,268 INFO L225 Difference]: With dead ends: 2109 [2018-12-02 09:52:31,268 INFO L226 Difference]: Without dead ends: 2109 [2018-12-02 09:52:31,268 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 09:52:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2018-12-02 09:52:31,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 2071. [2018-12-02 09:52:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-12-02 09:52:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5417 transitions. [2018-12-02 09:52:31,283 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5417 transitions. Word has length 92 [2018-12-02 09:52:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:31,283 INFO L480 AbstractCegarLoop]: Abstraction has 2071 states and 5417 transitions. [2018-12-02 09:52:31,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:52:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5417 transitions. [2018-12-02 09:52:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:31,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:31,285 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 09:52:31,285 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:31,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1380045558, now seen corresponding path program 1 times [2018-12-02 09:52:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:31,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:31,320 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 09:52:31,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:31,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:31,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:31,321 INFO L87 Difference]: Start difference. First operand 2071 states and 5417 transitions. Second operand 4 states. [2018-12-02 09:52:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:31,421 INFO L93 Difference]: Finished difference Result 3968 states and 10468 transitions. [2018-12-02 09:52:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:31,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 09:52:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:31,423 INFO L225 Difference]: With dead ends: 3968 [2018-12-02 09:52:31,424 INFO L226 Difference]: Without dead ends: 3968 [2018-12-02 09:52:31,424 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 09:52:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2018-12-02 09:52:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 2055. [2018-12-02 09:52:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2018-12-02 09:52:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5336 transitions. [2018-12-02 09:52:31,443 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5336 transitions. Word has length 94 [2018-12-02 09:52:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:31,443 INFO L480 AbstractCegarLoop]: Abstraction has 2055 states and 5336 transitions. [2018-12-02 09:52:31,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5336 transitions. [2018-12-02 09:52:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:31,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:31,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:31,445 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:31,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1050279797, now seen corresponding path program 1 times [2018-12-02 09:52:31,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:31,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:31,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:31,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:31,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:31,489 INFO L87 Difference]: Start difference. First operand 2055 states and 5336 transitions. Second operand 6 states. [2018-12-02 09:52:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:31,689 INFO L93 Difference]: Finished difference Result 2334 states and 5888 transitions. [2018-12-02 09:52:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:31,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 09:52:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:31,692 INFO L225 Difference]: With dead ends: 2334 [2018-12-02 09:52:31,692 INFO L226 Difference]: Without dead ends: 2264 [2018-12-02 09:52:31,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2018-12-02 09:52:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2197. [2018-12-02 09:52:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2197 states. [2018-12-02 09:52:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 5622 transitions. [2018-12-02 09:52:31,710 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 5622 transitions. Word has length 94 [2018-12-02 09:52:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:31,710 INFO L480 AbstractCegarLoop]: Abstraction has 2197 states and 5622 transitions. [2018-12-02 09:52:31,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 5622 transitions. [2018-12-02 09:52:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:31,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:31,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 09:52:31,712 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:31,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 650460682, now seen corresponding path program 1 times [2018-12-02 09:52:31,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:31,767 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 09:52:31,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:31,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:52:31,767 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:31,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 09:52:31,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 09:52:31,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:31,768 INFO L87 Difference]: Start difference. First operand 2197 states and 5622 transitions. Second operand 7 states. [2018-12-02 09:52:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:31,900 INFO L93 Difference]: Finished difference Result 2415 states and 6161 transitions. [2018-12-02 09:52:31,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:31,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 09:52:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:31,902 INFO L225 Difference]: With dead ends: 2415 [2018-12-02 09:52:31,902 INFO L226 Difference]: Without dead ends: 2415 [2018-12-02 09:52:31,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-12-02 09:52:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2181. [2018-12-02 09:52:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-12-02 09:52:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 5589 transitions. [2018-12-02 09:52:31,917 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 5589 transitions. Word has length 94 [2018-12-02 09:52:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:31,917 INFO L480 AbstractCegarLoop]: Abstraction has 2181 states and 5589 transitions. [2018-12-02 09:52:31,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 09:52:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 5589 transitions. [2018-12-02 09:52:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:31,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:31,919 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 09:52:31,919 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:31,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:31,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2061340202, now seen corresponding path program 1 times [2018-12-02 09:52:31,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:31,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:31,956 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 09:52:31,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:31,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:31,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:31,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:31,957 INFO L87 Difference]: Start difference. First operand 2181 states and 5589 transitions. Second operand 5 states. [2018-12-02 09:52:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:32,082 INFO L93 Difference]: Finished difference Result 4042 states and 10543 transitions. [2018-12-02 09:52:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:32,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 09:52:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:32,085 INFO L225 Difference]: With dead ends: 4042 [2018-12-02 09:52:32,085 INFO L226 Difference]: Without dead ends: 4016 [2018-12-02 09:52:32,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-12-02 09:52:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 2235. [2018-12-02 09:52:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-12-02 09:52:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 5715 transitions. [2018-12-02 09:52:32,104 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 5715 transitions. Word has length 94 [2018-12-02 09:52:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:32,105 INFO L480 AbstractCegarLoop]: Abstraction has 2235 states and 5715 transitions. [2018-12-02 09:52:32,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 5715 transitions. [2018-12-02 09:52:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:32,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:32,106 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 09:52:32,106 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:32,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1443186967, now seen corresponding path program 1 times [2018-12-02 09:52:32,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:32,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:32,164 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 09:52:32,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:32,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:32,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:32,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:32,165 INFO L87 Difference]: Start difference. First operand 2235 states and 5715 transitions. Second operand 5 states. [2018-12-02 09:52:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:32,228 INFO L93 Difference]: Finished difference Result 1991 states and 5072 transitions. [2018-12-02 09:52:32,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:32,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 09:52:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:32,230 INFO L225 Difference]: With dead ends: 1991 [2018-12-02 09:52:32,230 INFO L226 Difference]: Without dead ends: 1991 [2018-12-02 09:52:32,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2018-12-02 09:52:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1989. [2018-12-02 09:52:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-12-02 09:52:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 5068 transitions. [2018-12-02 09:52:32,244 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 5068 transitions. Word has length 94 [2018-12-02 09:52:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:32,244 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 5068 transitions. [2018-12-02 09:52:32,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 5068 transitions. [2018-12-02 09:52:32,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:32,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:32,246 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 09:52:32,246 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:32,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:32,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1220650390, now seen corresponding path program 1 times [2018-12-02 09:52:32,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:32,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:32,275 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 09:52:32,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:32,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:52:32,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:32,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:52:32,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:52:32,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:52:32,276 INFO L87 Difference]: Start difference. First operand 1989 states and 5068 transitions. Second operand 4 states. [2018-12-02 09:52:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:32,351 INFO L93 Difference]: Finished difference Result 2325 states and 5988 transitions. [2018-12-02 09:52:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:52:32,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 09:52:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:32,353 INFO L225 Difference]: With dead ends: 2325 [2018-12-02 09:52:32,353 INFO L226 Difference]: Without dead ends: 2325 [2018-12-02 09:52:32,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 09:52:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2018-12-02 09:52:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2293. [2018-12-02 09:52:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2018-12-02 09:52:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5908 transitions. [2018-12-02 09:52:32,369 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5908 transitions. Word has length 94 [2018-12-02 09:52:32,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:32,369 INFO L480 AbstractCegarLoop]: Abstraction has 2293 states and 5908 transitions. [2018-12-02 09:52:32,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:52:32,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5908 transitions. [2018-12-02 09:52:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 09:52:32,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:32,371 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 09:52:32,371 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:32,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash 997107563, now seen corresponding path program 1 times [2018-12-02 09:52:32,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:32,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:32,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:52:32,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:32,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:52:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:52:32,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:52:32,440 INFO L87 Difference]: Start difference. First operand 2293 states and 5908 transitions. Second operand 6 states. [2018-12-02 09:52:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:32,509 INFO L93 Difference]: Finished difference Result 2005 states and 5012 transitions. [2018-12-02 09:52:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:52:32,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 09:52:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:32,510 INFO L225 Difference]: With dead ends: 2005 [2018-12-02 09:52:32,510 INFO L226 Difference]: Without dead ends: 2005 [2018-12-02 09:52:32,511 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 09:52:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-02 09:52:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1668. [2018-12-02 09:52:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-12-02 09:52:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4216 transitions. [2018-12-02 09:52:32,523 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4216 transitions. Word has length 94 [2018-12-02 09:52:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:32,523 INFO L480 AbstractCegarLoop]: Abstraction has 1668 states and 4216 transitions. [2018-12-02 09:52:32,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:52:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4216 transitions. [2018-12-02 09:52:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:32,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:32,526 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 09:52:32,526 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:32,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash -896804400, now seen corresponding path program 1 times [2018-12-02 09:52:32,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:32,594 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 09:52:32,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:32,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 09:52:32,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:32,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:52:32,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:52:32,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:52:32,595 INFO L87 Difference]: Start difference. First operand 1668 states and 4216 transitions. Second operand 8 states. [2018-12-02 09:52:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:32,964 INFO L93 Difference]: Finished difference Result 4730 states and 12191 transitions. [2018-12-02 09:52:32,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 09:52:32,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 09:52:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:32,968 INFO L225 Difference]: With dead ends: 4730 [2018-12-02 09:52:32,968 INFO L226 Difference]: Without dead ends: 4730 [2018-12-02 09:52:32,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:52:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-02 09:52:32,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 2396. [2018-12-02 09:52:32,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2396 states. [2018-12-02 09:52:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 6085 transitions. [2018-12-02 09:52:32,992 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 6085 transitions. Word has length 96 [2018-12-02 09:52:32,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:32,992 INFO L480 AbstractCegarLoop]: Abstraction has 2396 states and 6085 transitions. [2018-12-02 09:52:32,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:52:32,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 6085 transitions. [2018-12-02 09:52:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:32,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:32,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:52:32,994 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:32,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash 347960081, now seen corresponding path program 1 times [2018-12-02 09:52:32,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:32,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:33,041 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 09:52:33,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:33,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:33,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:33,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:33,042 INFO L87 Difference]: Start difference. First operand 2396 states and 6085 transitions. Second operand 5 states. [2018-12-02 09:52:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:33,065 INFO L93 Difference]: Finished difference Result 4125 states and 10700 transitions. [2018-12-02 09:52:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:52:33,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 09:52:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:33,068 INFO L225 Difference]: With dead ends: 4125 [2018-12-02 09:52:33,068 INFO L226 Difference]: Without dead ends: 4125 [2018-12-02 09:52:33,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 09:52:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4125 states. [2018-12-02 09:52:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4125 to 2333. [2018-12-02 09:52:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2018-12-02 09:52:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 5892 transitions. [2018-12-02 09:52:33,090 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 5892 transitions. Word has length 96 [2018-12-02 09:52:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:33,090 INFO L480 AbstractCegarLoop]: Abstraction has 2333 states and 5892 transitions. [2018-12-02 09:52:33,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 5892 transitions. [2018-12-02 09:52:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:33,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:33,092 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 09:52:33,092 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:33,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:33,092 INFO L82 PathProgramCache]: Analyzing trace with hash -567038639, now seen corresponding path program 1 times [2018-12-02 09:52:33,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:33,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:33,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:33,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:52:33,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:33,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:52:33,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:52:33,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:52:33,145 INFO L87 Difference]: Start difference. First operand 2333 states and 5892 transitions. Second operand 5 states. [2018-12-02 09:52:33,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:33,238 INFO L93 Difference]: Finished difference Result 2653 states and 6692 transitions. [2018-12-02 09:52:33,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:52:33,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-02 09:52:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:33,240 INFO L225 Difference]: With dead ends: 2653 [2018-12-02 09:52:33,240 INFO L226 Difference]: Without dead ends: 2653 [2018-12-02 09:52:33,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:52:33,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2018-12-02 09:52:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2081. [2018-12-02 09:52:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2081 states. [2018-12-02 09:52:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 5265 transitions. [2018-12-02 09:52:33,255 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 5265 transitions. Word has length 96 [2018-12-02 09:52:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:33,255 INFO L480 AbstractCegarLoop]: Abstraction has 2081 states and 5265 transitions. [2018-12-02 09:52:33,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:52:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 5265 transitions. [2018-12-02 09:52:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:33,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:33,256 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 09:52:33,257 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:33,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash 677725842, now seen corresponding path program 1 times [2018-12-02 09:52:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:52:33,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:33,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 09:52:33,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:33,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:52:33,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:52:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:52:33,381 INFO L87 Difference]: Start difference. First operand 2081 states and 5265 transitions. Second operand 10 states. [2018-12-02 09:52:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:33,629 INFO L93 Difference]: Finished difference Result 3834 states and 9903 transitions. [2018-12-02 09:52:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:52:33,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-02 09:52:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:33,631 INFO L225 Difference]: With dead ends: 3834 [2018-12-02 09:52:33,631 INFO L226 Difference]: Without dead ends: 1799 [2018-12-02 09:52:33,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:52:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2018-12-02 09:52:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2018-12-02 09:52:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2018-12-02 09:52:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 4708 transitions. [2018-12-02 09:52:33,642 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 4708 transitions. Word has length 96 [2018-12-02 09:52:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:33,642 INFO L480 AbstractCegarLoop]: Abstraction has 1799 states and 4708 transitions. [2018-12-02 09:52:33,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:52:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 4708 transitions. [2018-12-02 09:52:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:33,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:33,644 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 09:52:33,644 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:33,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1311116434, now seen corresponding path program 2 times [2018-12-02 09:52:33,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:33,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:52:33,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:33,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:52:33,746 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 09:52:33,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:52:33,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 09:52:33,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:52:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 09:52:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 09:52:33,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 09:52:33,747 INFO L87 Difference]: Start difference. First operand 1799 states and 4708 transitions. Second operand 12 states. [2018-12-02 09:52:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:52:34,094 INFO L93 Difference]: Finished difference Result 3406 states and 9006 transitions. [2018-12-02 09:52:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 09:52:34,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 09:52:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:52:34,096 INFO L225 Difference]: With dead ends: 3406 [2018-12-02 09:52:34,096 INFO L226 Difference]: Without dead ends: 2430 [2018-12-02 09:52:34,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-02 09:52:34,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2018-12-02 09:52:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2278. [2018-12-02 09:52:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2018-12-02 09:52:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 5830 transitions. [2018-12-02 09:52:34,113 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 5830 transitions. Word has length 96 [2018-12-02 09:52:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:52:34,114 INFO L480 AbstractCegarLoop]: Abstraction has 2278 states and 5830 transitions. [2018-12-02 09:52:34,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 09:52:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 5830 transitions. [2018-12-02 09:52:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 09:52:34,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:52:34,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:34,116 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:52:34,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:52:34,116 INFO L82 PathProgramCache]: Analyzing trace with hash 187348118, now seen corresponding path program 3 times [2018-12-02 09:52:34,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:52:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:34,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:52:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:52:34,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:52:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:52:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:52:34,152 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:52:34,222 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 09:52:34,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:52:34 BasicIcfg [2018-12-02 09:52:34,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:52:34,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:52:34,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:52:34,223 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:52:34,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:52:24" (3/4) ... [2018-12-02 09:52:34,225 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 09:52:34,293 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b2c5bce0-1e46-4033-8e36-d28d837018fa/bin-2019/utaipan/witness.graphml [2018-12-02 09:52:34,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:52:34,293 INFO L168 Benchmark]: Toolchain (without parser) took 10577.21 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 947.0 MB in the beginning and 890.0 MB in the end (delta: 57.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 09:52:34,294 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:52:34,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:34,295 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.77 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:34,295 INFO L168 Benchmark]: Boogie Preprocessor took 20.00 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 09:52:34,295 INFO L168 Benchmark]: RCFGBuilder took 312.59 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 09:52:34,295 INFO L168 Benchmark]: TraceAbstraction took 9808.56 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 937.5 MB in the end (delta: 77.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 09:52:34,295 INFO L168 Benchmark]: Witness Printer took 69.90 ms. Allocated memory is still 2.3 GB. Free memory was 937.5 MB in the beginning and 890.0 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2018-12-02 09:52:34,297 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.77 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.00 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 312.59 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 9808.56 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 937.5 MB in the end (delta: 77.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 69.90 ms. Allocated memory is still 2.3 GB. Free memory was 937.5 MB in the beginning and 890.0 MB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 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] [L682] -1 _Bool y$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, y$flush_delayed=0] [L683] -1 int y$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, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] -1 pthread_t t1615; 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1615, ((void *)0), P0, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] -1 pthread_t t1616; 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1616, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L723] 0 y$w_buff1 = y$w_buff0 [L724] 0 y$w_buff0 = 2 [L725] 0 y$w_buff1_used = y$w_buff0_used [L726] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 0 y$r_buff0_thd2 = (_Bool)1 [L734] 0 z = 1 [L737] 0 __unbuffered_p1_EAX = z [L740] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L703] 1 x = 1 [L706] 1 y = 1 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=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L744] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y 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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L745] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L709] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2, z=1] [L709] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L710] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L747] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L750] 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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L711] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L712] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L712] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L713] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L713] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L716] 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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] -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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L775] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L776] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L777] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L778] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_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=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 y$flush_delayed = weak$$choice2 [L784] -1 y$mem_tmp = y 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L786] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L786] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L787] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L788] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(y == 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] EXPR -1 y$flush_delayed ? y$mem_tmp : y 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=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 y = y$flush_delayed ? y$mem_tmp : y [L794] -1 y$flush_delayed = (_Bool)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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 9.7s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4856 SDtfs, 4424 SDslu, 9815 SDs, 0 SdLazy, 3232 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 65 SyntacticMatches, 17 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37143occurred in iteration=3, 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: 3.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 59694 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1940 NumberOfCodeBlocks, 1940 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 342397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...