./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.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_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/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 e569b430217d4d95b0f56c5eff2b67b3953ad262 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 05:42:52,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:42:52,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:42:52,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:42:52,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:42:52,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:42:52,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:42:52,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:42:52,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:42:52,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:42:52,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:42:52,069 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:42:52,070 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:42:52,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:42:52,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:42:52,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:42:52,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:42:52,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:42:52,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:42:52,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:42:52,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:42:52,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:42:52,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:42:52,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:42:52,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:42:52,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:42:52,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:42:52,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:42:52,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:42:52,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:42:52,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:42:52,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:42:52,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:42:52,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:42:52,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:42:52,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:42:52,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:42:52,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:42:52,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:42:52,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:42:52,098 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:42:52,098 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:42:52,098 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:42:52,098 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:42:52,099 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:42:52,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:42:52,100 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:42:52,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:42:52,100 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:42:52,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:42:52,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:42:52,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:42:52,102 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:42:52,103 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_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/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 -> e569b430217d4d95b0f56c5eff2b67b3953ad262 [2018-12-02 05:42:52,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:42:52,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:42:52,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:42:52,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:42:52,133 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:42:52,133 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i [2018-12-02 05:42:52,166 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/data/cac113689/7c4af08e4ff7406f813ccf56575fdbb0/FLAG2e14b9a4d [2018-12-02 05:42:52,478 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:42:52,478 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/sv-benchmarks/c/pthread-wmm/rfi001_power.oepc_false-unreach-call.i [2018-12-02 05:42:52,485 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/data/cac113689/7c4af08e4ff7406f813ccf56575fdbb0/FLAG2e14b9a4d [2018-12-02 05:42:52,494 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/data/cac113689/7c4af08e4ff7406f813ccf56575fdbb0 [2018-12-02 05:42:52,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:42:52,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:42:52,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:52,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:42:52,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:42:52,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52, skipping insertion in model container [2018-12-02 05:42:52,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:42:52,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:42:52,703 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:52,711 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:42:52,783 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:42:52,813 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:42:52,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52 WrapperNode [2018-12-02 05:42:52,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:42:52,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:42:52,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:42:52,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:42:52,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:42:52,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:42:52,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:42:52,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:42:52,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... [2018-12-02 05:42:52,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:42:52,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:42:52,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:42:52,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:42:52,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/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 05:42:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:42:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:42:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 05:42:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:42:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 05:42:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 05:42:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 05:42:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 05:42:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 05:42:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:42:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:42:52,899 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 05:42:53,185 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:42:53,185 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:42:53,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:53 BoogieIcfgContainer [2018-12-02 05:42:53,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:42:53,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:42:53,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:42:53,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:42:53,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:42:52" (1/3) ... [2018-12-02 05:42:53,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:53, skipping insertion in model container [2018-12-02 05:42:53,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:42:52" (2/3) ... [2018-12-02 05:42:53,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bf0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:42:53, skipping insertion in model container [2018-12-02 05:42:53,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:53" (3/3) ... [2018-12-02 05:42:53,189 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc_false-unreach-call.i [2018-12-02 05:42:53,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,212 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,212 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,213 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,214 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,215 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,216 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,217 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,218 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,219 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,220 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,221 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,222 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,223 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,224 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,225 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,226 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,227 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,228 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:42:53,232 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:42:53,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:42:53,238 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 05:42:53,247 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 05:42:53,262 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:42:53,262 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:42:53,262 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:42:53,262 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:42:53,263 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:42:53,263 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:42:53,263 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:42:53,263 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:42:53,270 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-02 05:42:54,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-02 05:42:54,822 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-02 05:42:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:42:54,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:54,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:54,828 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:42:54,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 314479455, now seen corresponding path program 1 times [2018-12-02 05:42:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:42:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:54,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:54,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:42:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:54,965 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 05:42:54,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:54,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:42:54,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:42:54,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:42:54,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:42:54,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:42:54,979 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-02 05:42:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:55,460 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-02 05:42:55,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:42:55,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-02 05:42:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:55,615 INFO L225 Difference]: With dead ends: 60791 [2018-12-02 05:42:55,615 INFO L226 Difference]: Without dead ends: 44271 [2018-12-02 05:42:55,616 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 05:42:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-02 05:42:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-02 05:42:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 05:42:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-02 05:42:56,371 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-02 05:42:56,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:56,371 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-02 05:42:56,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:42:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-02 05:42:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:42:56,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:56,376 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 05:42:56,376 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:42:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -494436635, now seen corresponding path program 1 times [2018-12-02 05:42:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:42:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:56,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:56,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:56,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:42:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:56,415 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 05:42:56,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:56,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:42:56,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:42:56,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:42:56,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:42:56,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:42:56,417 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 3 states. [2018-12-02 05:42:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:56,555 INFO L93 Difference]: Finished difference Result 27339 states and 105223 transitions. [2018-12-02 05:42:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:42:56,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-02 05:42:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:56,610 INFO L225 Difference]: With dead ends: 27339 [2018-12-02 05:42:56,611 INFO L226 Difference]: Without dead ends: 27339 [2018-12-02 05:42:56,611 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 05:42:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27339 states. [2018-12-02 05:42:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27339 to 27339. [2018-12-02 05:42:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-02 05:42:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105223 transitions. [2018-12-02 05:42:57,108 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105223 transitions. Word has length 46 [2018-12-02 05:42:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:57,108 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105223 transitions. [2018-12-02 05:42:57,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:42:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105223 transitions. [2018-12-02 05:42:57,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 05:42:57,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:57,110 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 05:42:57,111 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:42:57,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1248373700, now seen corresponding path program 1 times [2018-12-02 05:42:57,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:42:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:57,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:57,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:42:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:57,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 05:42:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:57,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:57,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:42:57,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:42:57,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:42:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:42:57,166 INFO L87 Difference]: Start difference. First operand 27339 states and 105223 transitions. Second operand 5 states. [2018-12-02 05:42:57,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:57,659 INFO L93 Difference]: Finished difference Result 64005 states and 235022 transitions. [2018-12-02 05:42:57,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:42:57,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-02 05:42:57,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:57,768 INFO L225 Difference]: With dead ends: 64005 [2018-12-02 05:42:57,768 INFO L226 Difference]: Without dead ends: 63453 [2018-12-02 05:42:57,768 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 05:42:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-02 05:42:58,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-02 05:42:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-02 05:42:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152053 transitions. [2018-12-02 05:42:58,627 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152053 transitions. Word has length 46 [2018-12-02 05:42:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:42:58,628 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152053 transitions. [2018-12-02 05:42:58,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:42:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152053 transitions. [2018-12-02 05:42:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 05:42:58,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:42:58,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:42:58,631 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:42:58,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:42:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1026875031, now seen corresponding path program 1 times [2018-12-02 05:42:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:42:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:58,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:42:58,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:42:58,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:42:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:42:58,678 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 05:42:58,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:42:58,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:42:58,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:42:58,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:42:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:42:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:42:58,679 INFO L87 Difference]: Start difference. First operand 41421 states and 152053 transitions. Second operand 5 states. [2018-12-02 05:42:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:42:59,220 INFO L93 Difference]: Finished difference Result 81367 states and 297636 transitions. [2018-12-02 05:42:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:42:59,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-02 05:42:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:42:59,351 INFO L225 Difference]: With dead ends: 81367 [2018-12-02 05:42:59,351 INFO L226 Difference]: Without dead ends: 80855 [2018-12-02 05:42:59,351 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 05:42:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-02 05:43:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-02 05:43:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-02 05:43:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 165678 transitions. [2018-12-02 05:43:00,161 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 165678 transitions. Word has length 47 [2018-12-02 05:43:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:00,161 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 165678 transitions. [2018-12-02 05:43:00,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 165678 transitions. [2018-12-02 05:43:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:43:00,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:00,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:00,166 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:00,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:00,166 INFO L82 PathProgramCache]: Analyzing trace with hash -43389411, now seen corresponding path program 1 times [2018-12-02 05:43:00,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:00,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:00,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:00,189 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 05:43:00,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:00,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:43:00,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:00,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:43:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:43:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:43:00,190 INFO L87 Difference]: Start difference. First operand 45375 states and 165678 transitions. Second operand 3 states. [2018-12-02 05:43:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:00,387 INFO L93 Difference]: Finished difference Result 65251 states and 235338 transitions. [2018-12-02 05:43:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:43:00,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-02 05:43:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:00,510 INFO L225 Difference]: With dead ends: 65251 [2018-12-02 05:43:00,510 INFO L226 Difference]: Without dead ends: 65251 [2018-12-02 05:43:00,510 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 05:43:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-02 05:43:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-02 05:43:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-02 05:43:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 183963 transitions. [2018-12-02 05:43:01,389 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 183963 transitions. Word has length 49 [2018-12-02 05:43:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:01,390 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 183963 transitions. [2018-12-02 05:43:01,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:43:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 183963 transitions. [2018-12-02 05:43:01,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:43:01,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:01,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:01,397 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:01,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -860096332, now seen corresponding path program 1 times [2018-12-02 05:43:01,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:01,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:01,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:01,459 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 05:43:01,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:01,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:01,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:01,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:01,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:01,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:01,460 INFO L87 Difference]: Start difference. First operand 50945 states and 183963 transitions. Second operand 6 states. [2018-12-02 05:43:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:01,948 INFO L93 Difference]: Finished difference Result 67511 states and 241920 transitions. [2018-12-02 05:43:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:01,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 05:43:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:02,062 INFO L225 Difference]: With dead ends: 67511 [2018-12-02 05:43:02,062 INFO L226 Difference]: Without dead ends: 67511 [2018-12-02 05:43:02,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:43:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-02 05:43:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-02 05:43:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-02 05:43:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227319 transitions. [2018-12-02 05:43:03,044 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227319 transitions. Word has length 53 [2018-12-02 05:43:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:03,044 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227319 transitions. [2018-12-02 05:43:03,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227319 transitions. [2018-12-02 05:43:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:43:03,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:03,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:03,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:03,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:03,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1637919605, now seen corresponding path program 1 times [2018-12-02 05:43:03,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:03,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:03,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:03,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:03,121 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 05:43:03,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:03,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:03,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:03,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:03,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:03,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:03,122 INFO L87 Difference]: Start difference. First operand 63436 states and 227319 transitions. Second operand 7 states. [2018-12-02 05:43:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:03,861 INFO L93 Difference]: Finished difference Result 88528 states and 305936 transitions. [2018-12-02 05:43:03,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:43:03,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-02 05:43:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:04,003 INFO L225 Difference]: With dead ends: 88528 [2018-12-02 05:43:04,003 INFO L226 Difference]: Without dead ends: 88528 [2018-12-02 05:43:04,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:43:04,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-02 05:43:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-02 05:43:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-02 05:43:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262722 transitions. [2018-12-02 05:43:05,181 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262722 transitions. Word has length 53 [2018-12-02 05:43:05,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:05,181 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262722 transitions. [2018-12-02 05:43:05,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262722 transitions. [2018-12-02 05:43:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:43:05,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:05,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:05,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:05,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1769544010, now seen corresponding path program 1 times [2018-12-02 05:43:05,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:05,219 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 05:43:05,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:05,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:05,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:05,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:05,220 INFO L87 Difference]: Start difference. First operand 74881 states and 262722 transitions. Second operand 4 states. [2018-12-02 05:43:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:05,279 INFO L93 Difference]: Finished difference Result 15375 states and 48802 transitions. [2018-12-02 05:43:05,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:43:05,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-02 05:43:05,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:05,296 INFO L225 Difference]: With dead ends: 15375 [2018-12-02 05:43:05,296 INFO L226 Difference]: Without dead ends: 13789 [2018-12-02 05:43:05,296 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 05:43:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-02 05:43:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-02 05:43:05,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-02 05:43:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43328 transitions. [2018-12-02 05:43:05,432 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43328 transitions. Word has length 53 [2018-12-02 05:43:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:05,432 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43328 transitions. [2018-12-02 05:43:05,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43328 transitions. [2018-12-02 05:43:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 05:43:05,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:05,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:05,433 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:05,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash -431668952, now seen corresponding path program 1 times [2018-12-02 05:43:05,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:05,476 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 05:43:05,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:05,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:05,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:05,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:05,477 INFO L87 Difference]: Start difference. First operand 13740 states and 43328 transitions. Second operand 6 states. [2018-12-02 05:43:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:05,722 INFO L93 Difference]: Finished difference Result 19970 states and 62557 transitions. [2018-12-02 05:43:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:43:05,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-02 05:43:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:05,743 INFO L225 Difference]: With dead ends: 19970 [2018-12-02 05:43:05,743 INFO L226 Difference]: Without dead ends: 19898 [2018-12-02 05:43:05,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:43:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-02 05:43:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-02 05:43:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-02 05:43:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45025 transitions. [2018-12-02 05:43:05,906 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45025 transitions. Word has length 53 [2018-12-02 05:43:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:05,906 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45025 transitions. [2018-12-02 05:43:05,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45025 transitions. [2018-12-02 05:43:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 05:43:05,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:05,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:05,909 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:05,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash -488484476, now seen corresponding path program 1 times [2018-12-02 05:43:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:05,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:05,940 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 05:43:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:05,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:05,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:05,941 INFO L87 Difference]: Start difference. First operand 14314 states and 45025 transitions. Second operand 4 states. [2018-12-02 05:43:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:06,027 INFO L93 Difference]: Finished difference Result 16617 states and 52353 transitions. [2018-12-02 05:43:06,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:43:06,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 05:43:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:06,046 INFO L225 Difference]: With dead ends: 16617 [2018-12-02 05:43:06,047 INFO L226 Difference]: Without dead ends: 16617 [2018-12-02 05:43:06,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-02 05:43:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-02 05:43:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-02 05:43:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47615 transitions. [2018-12-02 05:43:06,203 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47615 transitions. Word has length 61 [2018-12-02 05:43:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:06,203 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47615 transitions. [2018-12-02 05:43:06,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47615 transitions. [2018-12-02 05:43:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 05:43:06,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:06,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:06,206 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:06,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1254325859, now seen corresponding path program 1 times [2018-12-02 05:43:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:06,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:06,256 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 05:43:06,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:06,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:06,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:06,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:06,256 INFO L87 Difference]: Start difference. First operand 15134 states and 47615 transitions. Second operand 6 states. [2018-12-02 05:43:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:06,537 INFO L93 Difference]: Finished difference Result 28106 states and 88091 transitions. [2018-12-02 05:43:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:43:06,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 05:43:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:06,570 INFO L225 Difference]: With dead ends: 28106 [2018-12-02 05:43:06,570 INFO L226 Difference]: Without dead ends: 28035 [2018-12-02 05:43:06,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:43:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-02 05:43:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-02 05:43:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-02 05:43:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54277 transitions. [2018-12-02 05:43:06,842 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54277 transitions. Word has length 61 [2018-12-02 05:43:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:06,842 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54277 transitions. [2018-12-02 05:43:06,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54277 transitions. [2018-12-02 05:43:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:43:06,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:06,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:06,846 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:06,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:06,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1214039529, now seen corresponding path program 1 times [2018-12-02 05:43:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:06,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:06,863 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 05:43:06,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:06,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:43:06,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:06,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:43:06,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:43:06,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:43:06,864 INFO L87 Difference]: Start difference. First operand 17412 states and 54277 transitions. Second operand 3 states. [2018-12-02 05:43:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:07,002 INFO L93 Difference]: Finished difference Result 18092 states and 56109 transitions. [2018-12-02 05:43:07,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:43:07,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-02 05:43:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:07,021 INFO L225 Difference]: With dead ends: 18092 [2018-12-02 05:43:07,021 INFO L226 Difference]: Without dead ends: 18092 [2018-12-02 05:43:07,022 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 05:43:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-02 05:43:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-02 05:43:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-02 05:43:07,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55193 transitions. [2018-12-02 05:43:07,191 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55193 transitions. Word has length 65 [2018-12-02 05:43:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:07,191 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55193 transitions. [2018-12-02 05:43:07,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:43:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55193 transitions. [2018-12-02 05:43:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 05:43:07,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:07,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:07,195 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:07,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 863169814, now seen corresponding path program 1 times [2018-12-02 05:43:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:07,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:07,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:07,234 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 05:43:07,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:07,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:07,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:07,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:07,235 INFO L87 Difference]: Start difference. First operand 17752 states and 55193 transitions. Second operand 4 states. [2018-12-02 05:43:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:07,408 INFO L93 Difference]: Finished difference Result 21696 states and 66682 transitions. [2018-12-02 05:43:07,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:43:07,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 05:43:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:07,430 INFO L225 Difference]: With dead ends: 21696 [2018-12-02 05:43:07,431 INFO L226 Difference]: Without dead ends: 21696 [2018-12-02 05:43:07,431 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 05:43:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-02 05:43:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-02 05:43:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-02 05:43:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60572 transitions. [2018-12-02 05:43:07,627 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60572 transitions. Word has length 65 [2018-12-02 05:43:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:07,627 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60572 transitions. [2018-12-02 05:43:07,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60572 transitions. [2018-12-02 05:43:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:07,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:07,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:07,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:07,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1085072735, now seen corresponding path program 1 times [2018-12-02 05:43:07,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:07,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:07,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:07,702 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 05:43:07,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:07,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:07,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:07,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:07,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:07,703 INFO L87 Difference]: Start difference. First operand 19646 states and 60572 transitions. Second operand 6 states. [2018-12-02 05:43:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:08,226 INFO L93 Difference]: Finished difference Result 23814 states and 72270 transitions. [2018-12-02 05:43:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:43:08,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 05:43:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:08,252 INFO L225 Difference]: With dead ends: 23814 [2018-12-02 05:43:08,252 INFO L226 Difference]: Without dead ends: 23814 [2018-12-02 05:43:08,252 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 05:43:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-02 05:43:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-02 05:43:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-02 05:43:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68700 transitions. [2018-12-02 05:43:08,476 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68700 transitions. Word has length 67 [2018-12-02 05:43:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:08,476 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68700 transitions. [2018-12-02 05:43:08,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68700 transitions. [2018-12-02 05:43:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:08,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:08,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:08,482 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:08,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -992136608, now seen corresponding path program 1 times [2018-12-02 05:43:08,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:08,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:08,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:08,543 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 05:43:08,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:08,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:08,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:08,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:08,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:08,543 INFO L87 Difference]: Start difference. First operand 22474 states and 68700 transitions. Second operand 6 states. [2018-12-02 05:43:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:08,819 INFO L93 Difference]: Finished difference Result 25702 states and 76160 transitions. [2018-12-02 05:43:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:43:08,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-02 05:43:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:08,845 INFO L225 Difference]: With dead ends: 25702 [2018-12-02 05:43:08,845 INFO L226 Difference]: Without dead ends: 25702 [2018-12-02 05:43:08,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-02 05:43:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-02 05:43:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-02 05:43:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68806 transitions. [2018-12-02 05:43:09,073 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68806 transitions. Word has length 67 [2018-12-02 05:43:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:09,074 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68806 transitions. [2018-12-02 05:43:09,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68806 transitions. [2018-12-02 05:43:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:09,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:09,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:09,080 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:09,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash -780785695, now seen corresponding path program 1 times [2018-12-02 05:43:09,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:09,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:09,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:09,118 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 05:43:09,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:09,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:09,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:09,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:09,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:09,119 INFO L87 Difference]: Start difference. First operand 22858 states and 68806 transitions. Second operand 5 states. [2018-12-02 05:43:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:09,342 INFO L93 Difference]: Finished difference Result 29793 states and 89371 transitions. [2018-12-02 05:43:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:43:09,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 05:43:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:09,373 INFO L225 Difference]: With dead ends: 29793 [2018-12-02 05:43:09,374 INFO L226 Difference]: Without dead ends: 29793 [2018-12-02 05:43:09,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-02 05:43:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-02 05:43:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-02 05:43:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80315 transitions. [2018-12-02 05:43:09,654 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80315 transitions. Word has length 67 [2018-12-02 05:43:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:09,655 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80315 transitions. [2018-12-02 05:43:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80315 transitions. [2018-12-02 05:43:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:09,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:09,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:09,663 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1291319872, now seen corresponding path program 1 times [2018-12-02 05:43:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:09,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:09,709 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 05:43:09,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:09,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:09,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:09,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:09,710 INFO L87 Difference]: Start difference. First operand 26814 states and 80315 transitions. Second operand 5 states. [2018-12-02 05:43:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:10,021 INFO L93 Difference]: Finished difference Result 36420 states and 108385 transitions. [2018-12-02 05:43:10,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:10,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 05:43:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:10,065 INFO L225 Difference]: With dead ends: 36420 [2018-12-02 05:43:10,065 INFO L226 Difference]: Without dead ends: 36420 [2018-12-02 05:43:10,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:43:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-02 05:43:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-02 05:43:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-02 05:43:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87791 transitions. [2018-12-02 05:43:10,436 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87791 transitions. Word has length 67 [2018-12-02 05:43:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:10,436 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87791 transitions. [2018-12-02 05:43:10,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87791 transitions. [2018-12-02 05:43:10,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:10,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:10,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:10,443 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:10,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1196192961, now seen corresponding path program 1 times [2018-12-02 05:43:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:10,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:10,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:10,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:10,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:43:10,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:10,481 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:10,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:10,482 INFO L87 Difference]: Start difference. First operand 29428 states and 87791 transitions. Second operand 4 states. [2018-12-02 05:43:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:10,834 INFO L93 Difference]: Finished difference Result 38892 states and 116477 transitions. [2018-12-02 05:43:10,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:43:10,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 05:43:10,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:10,875 INFO L225 Difference]: With dead ends: 38892 [2018-12-02 05:43:10,875 INFO L226 Difference]: Without dead ends: 38660 [2018-12-02 05:43:10,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:10,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38660 states. [2018-12-02 05:43:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38660 to 35784. [2018-12-02 05:43:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2018-12-02 05:43:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 107258 transitions. [2018-12-02 05:43:11,248 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 107258 transitions. Word has length 67 [2018-12-02 05:43:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:11,248 INFO L480 AbstractCegarLoop]: Abstraction has 35784 states and 107258 transitions. [2018-12-02 05:43:11,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 107258 transitions. [2018-12-02 05:43:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:11,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:11,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:11,255 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:11,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -600758398, now seen corresponding path program 1 times [2018-12-02 05:43:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:11,280 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 05:43:11,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:11,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:11,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:11,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:11,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:11,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:11,281 INFO L87 Difference]: Start difference. First operand 35784 states and 107258 transitions. Second operand 5 states. [2018-12-02 05:43:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:11,317 INFO L93 Difference]: Finished difference Result 9316 states and 22547 transitions. [2018-12-02 05:43:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:43:11,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-02 05:43:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:11,322 INFO L225 Difference]: With dead ends: 9316 [2018-12-02 05:43:11,322 INFO L226 Difference]: Without dead ends: 7464 [2018-12-02 05:43:11,322 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 05:43:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7464 states. [2018-12-02 05:43:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7464 to 6361. [2018-12-02 05:43:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6361 states. [2018-12-02 05:43:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6361 states to 6361 states and 15018 transitions. [2018-12-02 05:43:11,370 INFO L78 Accepts]: Start accepts. Automaton has 6361 states and 15018 transitions. Word has length 67 [2018-12-02 05:43:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 6361 states and 15018 transitions. [2018-12-02 05:43:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6361 states and 15018 transitions. [2018-12-02 05:43:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 05:43:11,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:11,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:11,373 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:11,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1144549580, now seen corresponding path program 1 times [2018-12-02 05:43:11,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:11,388 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 05:43:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:43:11,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:11,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:43:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:43:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:43:11,389 INFO L87 Difference]: Start difference. First operand 6361 states and 15018 transitions. Second operand 3 states. [2018-12-02 05:43:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:11,417 INFO L93 Difference]: Finished difference Result 8820 states and 20757 transitions. [2018-12-02 05:43:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:43:11,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 05:43:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:11,423 INFO L225 Difference]: With dead ends: 8820 [2018-12-02 05:43:11,423 INFO L226 Difference]: Without dead ends: 8820 [2018-12-02 05:43:11,423 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 05:43:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8820 states. [2018-12-02 05:43:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8820 to 6300. [2018-12-02 05:43:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2018-12-02 05:43:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 14558 transitions. [2018-12-02 05:43:11,473 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 14558 transitions. Word has length 67 [2018-12-02 05:43:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:11,473 INFO L480 AbstractCegarLoop]: Abstraction has 6300 states and 14558 transitions. [2018-12-02 05:43:11,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:43:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 14558 transitions. [2018-12-02 05:43:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:43:11,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:11,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:11,476 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:11,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:11,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1467487719, now seen corresponding path program 1 times [2018-12-02 05:43:11,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:11,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:11,514 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 05:43:11,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:11,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:11,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:11,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:11,515 INFO L87 Difference]: Start difference. First operand 6300 states and 14558 transitions. Second operand 5 states. [2018-12-02 05:43:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:11,609 INFO L93 Difference]: Finished difference Result 7470 states and 17199 transitions. [2018-12-02 05:43:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:43:11,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-02 05:43:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:11,614 INFO L225 Difference]: With dead ends: 7470 [2018-12-02 05:43:11,614 INFO L226 Difference]: Without dead ends: 7470 [2018-12-02 05:43:11,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-02 05:43:11,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 6744. [2018-12-02 05:43:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2018-12-02 05:43:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 15562 transitions. [2018-12-02 05:43:11,661 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 15562 transitions. Word has length 73 [2018-12-02 05:43:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:11,661 INFO L480 AbstractCegarLoop]: Abstraction has 6744 states and 15562 transitions. [2018-12-02 05:43:11,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 15562 transitions. [2018-12-02 05:43:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:43:11,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:11,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:11,664 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:11,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1084669242, now seen corresponding path program 1 times [2018-12-02 05:43:11,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:11,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:43:11,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:11,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:11,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:11,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:11,695 INFO L87 Difference]: Start difference. First operand 6744 states and 15562 transitions. Second operand 7 states. [2018-12-02 05:43:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:11,955 INFO L93 Difference]: Finished difference Result 7881 states and 17984 transitions. [2018-12-02 05:43:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:43:11,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-02 05:43:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:11,962 INFO L225 Difference]: With dead ends: 7881 [2018-12-02 05:43:11,963 INFO L226 Difference]: Without dead ends: 7762 [2018-12-02 05:43:11,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:43:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2018-12-02 05:43:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 6841. [2018-12-02 05:43:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6841 states. [2018-12-02 05:43:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 15655 transitions. [2018-12-02 05:43:12,017 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 15655 transitions. Word has length 73 [2018-12-02 05:43:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:12,017 INFO L480 AbstractCegarLoop]: Abstraction has 6841 states and 15655 transitions. [2018-12-02 05:43:12,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 15655 transitions. [2018-12-02 05:43:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 05:43:12,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:12,022 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 05:43:12,022 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:12,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash -604903176, now seen corresponding path program 1 times [2018-12-02 05:43:12,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:12,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:12,052 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 05:43:12,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:12,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:12,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:12,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:12,053 INFO L87 Difference]: Start difference. First operand 6841 states and 15655 transitions. Second operand 4 states. [2018-12-02 05:43:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:12,225 INFO L93 Difference]: Finished difference Result 10608 states and 24142 transitions. [2018-12-02 05:43:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:43:12,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 05:43:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:12,232 INFO L225 Difference]: With dead ends: 10608 [2018-12-02 05:43:12,233 INFO L226 Difference]: Without dead ends: 10608 [2018-12-02 05:43:12,233 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 05:43:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2018-12-02 05:43:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 7961. [2018-12-02 05:43:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7961 states. [2018-12-02 05:43:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7961 states to 7961 states and 17989 transitions. [2018-12-02 05:43:12,299 INFO L78 Accepts]: Start accepts. Automaton has 7961 states and 17989 transitions. Word has length 92 [2018-12-02 05:43:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:12,300 INFO L480 AbstractCegarLoop]: Abstraction has 7961 states and 17989 transitions. [2018-12-02 05:43:12,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 7961 states and 17989 transitions. [2018-12-02 05:43:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 05:43:12,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:12,305 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 05:43:12,305 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:12,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:12,305 INFO L82 PathProgramCache]: Analyzing trace with hash -972140710, now seen corresponding path program 2 times [2018-12-02 05:43:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:12,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:12,353 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 05:43:12,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:12,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:43:12,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:12,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:43:12,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:43:12,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:43:12,355 INFO L87 Difference]: Start difference. First operand 7961 states and 17989 transitions. Second operand 4 states. [2018-12-02 05:43:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:12,430 INFO L93 Difference]: Finished difference Result 8526 states and 19282 transitions. [2018-12-02 05:43:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:43:12,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-02 05:43:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:12,436 INFO L225 Difference]: With dead ends: 8526 [2018-12-02 05:43:12,436 INFO L226 Difference]: Without dead ends: 8526 [2018-12-02 05:43:12,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-12-02 05:43:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7867. [2018-12-02 05:43:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7867 states. [2018-12-02 05:43:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7867 states to 7867 states and 17884 transitions. [2018-12-02 05:43:12,497 INFO L78 Accepts]: Start accepts. Automaton has 7867 states and 17884 transitions. Word has length 92 [2018-12-02 05:43:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:12,498 INFO L480 AbstractCegarLoop]: Abstraction has 7867 states and 17884 transitions. [2018-12-02 05:43:12,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:43:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 7867 states and 17884 transitions. [2018-12-02 05:43:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:12,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:12,504 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 05:43:12,504 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:12,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1465486910, now seen corresponding path program 1 times [2018-12-02 05:43:12,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:12,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:43:12,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:12,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:12,567 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 05:43:12,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:12,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:12,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:12,568 INFO L87 Difference]: Start difference. First operand 7867 states and 17884 transitions. Second operand 7 states. [2018-12-02 05:43:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:12,979 INFO L93 Difference]: Finished difference Result 9705 states and 21992 transitions. [2018-12-02 05:43:12,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:43:12,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-02 05:43:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:12,986 INFO L225 Difference]: With dead ends: 9705 [2018-12-02 05:43:12,986 INFO L226 Difference]: Without dead ends: 9705 [2018-12-02 05:43:12,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2018-12-02 05:43:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 7979. [2018-12-02 05:43:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2018-12-02 05:43:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 18204 transitions. [2018-12-02 05:43:13,044 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 18204 transitions. Word has length 94 [2018-12-02 05:43:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:13,045 INFO L480 AbstractCegarLoop]: Abstraction has 7979 states and 18204 transitions. [2018-12-02 05:43:13,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 18204 transitions. [2018-12-02 05:43:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:13,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:13,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:13,049 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:13,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash 631244515, now seen corresponding path program 1 times [2018-12-02 05:43:13,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:13,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:13,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:13,101 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 05:43:13,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:13,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:13,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:13,102 INFO L87 Difference]: Start difference. First operand 7979 states and 18204 transitions. Second operand 5 states. [2018-12-02 05:43:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:13,158 INFO L93 Difference]: Finished difference Result 8886 states and 20162 transitions. [2018-12-02 05:43:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:43:13,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 05:43:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:13,164 INFO L225 Difference]: With dead ends: 8886 [2018-12-02 05:43:13,164 INFO L226 Difference]: Without dead ends: 8886 [2018-12-02 05:43:13,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:13,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8886 states. [2018-12-02 05:43:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8886 to 6875. [2018-12-02 05:43:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6875 states. [2018-12-02 05:43:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 15723 transitions. [2018-12-02 05:43:13,217 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 15723 transitions. Word has length 94 [2018-12-02 05:43:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:13,218 INFO L480 AbstractCegarLoop]: Abstraction has 6875 states and 15723 transitions. [2018-12-02 05:43:13,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 15723 transitions. [2018-12-02 05:43:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:13,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:13,222 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 05:43:13,223 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:13,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash 376507970, now seen corresponding path program 1 times [2018-12-02 05:43:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:13,262 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 05:43:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:43:13,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:13,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:43:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:43:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:43:13,262 INFO L87 Difference]: Start difference. First operand 6875 states and 15723 transitions. Second operand 5 states. [2018-12-02 05:43:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:13,438 INFO L93 Difference]: Finished difference Result 8123 states and 18363 transitions. [2018-12-02 05:43:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:43:13,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-02 05:43:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:13,443 INFO L225 Difference]: With dead ends: 8123 [2018-12-02 05:43:13,443 INFO L226 Difference]: Without dead ends: 7992 [2018-12-02 05:43:13,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 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 05:43:13,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2018-12-02 05:43:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7614. [2018-12-02 05:43:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7614 states. [2018-12-02 05:43:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7614 states to 7614 states and 17342 transitions. [2018-12-02 05:43:13,496 INFO L78 Accepts]: Start accepts. Automaton has 7614 states and 17342 transitions. Word has length 94 [2018-12-02 05:43:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:13,496 INFO L480 AbstractCegarLoop]: Abstraction has 7614 states and 17342 transitions. [2018-12-02 05:43:13,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:43:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7614 states and 17342 transitions. [2018-12-02 05:43:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:13,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:13,500 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 05:43:13,500 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:13,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1621272451, now seen corresponding path program 1 times [2018-12-02 05:43:13,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:13,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:13,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:13,546 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 05:43:13,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:13,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:13,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:13,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:13,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:13,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:13,547 INFO L87 Difference]: Start difference. First operand 7614 states and 17342 transitions. Second operand 6 states. [2018-12-02 05:43:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:13,726 INFO L93 Difference]: Finished difference Result 9775 states and 22056 transitions. [2018-12-02 05:43:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:43:13,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-02 05:43:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:13,732 INFO L225 Difference]: With dead ends: 9775 [2018-12-02 05:43:13,733 INFO L226 Difference]: Without dead ends: 9667 [2018-12-02 05:43:13,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:43:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2018-12-02 05:43:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7441. [2018-12-02 05:43:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7441 states. [2018-12-02 05:43:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7441 states to 7441 states and 16948 transitions. [2018-12-02 05:43:13,790 INFO L78 Accepts]: Start accepts. Automaton has 7441 states and 16948 transitions. Word has length 94 [2018-12-02 05:43:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:13,791 INFO L480 AbstractCegarLoop]: Abstraction has 7441 states and 16948 transitions. [2018-12-02 05:43:13,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7441 states and 16948 transitions. [2018-12-02 05:43:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:13,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:13,796 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 05:43:13,796 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:13,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 383295530, now seen corresponding path program 1 times [2018-12-02 05:43:13,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:13,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:13,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:13,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:13,871 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 05:43:13,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:13,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:43:13,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:13,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:43:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:43:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:13,872 INFO L87 Difference]: Start difference. First operand 7441 states and 16948 transitions. Second operand 9 states. [2018-12-02 05:43:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:14,171 INFO L93 Difference]: Finished difference Result 10480 states and 23807 transitions. [2018-12-02 05:43:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:43:14,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-02 05:43:14,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:14,178 INFO L225 Difference]: With dead ends: 10480 [2018-12-02 05:43:14,178 INFO L226 Difference]: Without dead ends: 10448 [2018-12-02 05:43:14,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:43:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10448 states. [2018-12-02 05:43:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10448 to 9009. [2018-12-02 05:43:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-02 05:43:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 20408 transitions. [2018-12-02 05:43:14,250 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 20408 transitions. Word has length 94 [2018-12-02 05:43:14,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:14,251 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 20408 transitions. [2018-12-02 05:43:14,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:43:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 20408 transitions. [2018-12-02 05:43:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:14,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:14,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] [2018-12-02 05:43:14,256 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:14,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1413655829, now seen corresponding path program 1 times [2018-12-02 05:43:14,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:14,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:14,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:14,334 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 05:43:14,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:14,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:43:14,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:14,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:43:14,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:43:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:43:14,335 INFO L87 Difference]: Start difference. First operand 9009 states and 20408 transitions. Second operand 8 states. [2018-12-02 05:43:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:14,580 INFO L93 Difference]: Finished difference Result 14006 states and 32226 transitions. [2018-12-02 05:43:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:43:14,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-02 05:43:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:14,590 INFO L225 Difference]: With dead ends: 14006 [2018-12-02 05:43:14,590 INFO L226 Difference]: Without dead ends: 14006 [2018-12-02 05:43:14,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:43:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14006 states. [2018-12-02 05:43:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14006 to 9587. [2018-12-02 05:43:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9587 states. [2018-12-02 05:43:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9587 states to 9587 states and 21909 transitions. [2018-12-02 05:43:14,677 INFO L78 Accepts]: Start accepts. Automaton has 9587 states and 21909 transitions. Word has length 94 [2018-12-02 05:43:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:14,677 INFO L480 AbstractCegarLoop]: Abstraction has 9587 states and 21909 transitions. [2018-12-02 05:43:14,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:43:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 9587 states and 21909 transitions. [2018-12-02 05:43:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:43:14,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:14,684 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 05:43:14,684 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:14,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:14,684 INFO L82 PathProgramCache]: Analyzing trace with hash -526152148, now seen corresponding path program 1 times [2018-12-02 05:43:14,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:14,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:14,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:14,710 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 05:43:14,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:14,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:43:14,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:14,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:43:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:43:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:43:14,712 INFO L87 Difference]: Start difference. First operand 9587 states and 21909 transitions. Second operand 3 states. [2018-12-02 05:43:14,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:14,741 INFO L93 Difference]: Finished difference Result 9331 states and 21109 transitions. [2018-12-02 05:43:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:43:14,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-12-02 05:43:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:14,749 INFO L225 Difference]: With dead ends: 9331 [2018-12-02 05:43:14,750 INFO L226 Difference]: Without dead ends: 9299 [2018-12-02 05:43:14,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:43:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9299 states. [2018-12-02 05:43:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9299 to 7512. [2018-12-02 05:43:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7512 states. [2018-12-02 05:43:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 16864 transitions. [2018-12-02 05:43:14,808 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 16864 transitions. Word has length 94 [2018-12-02 05:43:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:14,808 INFO L480 AbstractCegarLoop]: Abstraction has 7512 states and 16864 transitions. [2018-12-02 05:43:14,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:43:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 16864 transitions. [2018-12-02 05:43:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:14,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:14,813 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 05:43:14,813 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:14,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1587470612, now seen corresponding path program 1 times [2018-12-02 05:43:14,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:14,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:14,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:14,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:14,919 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 05:43:14,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:14,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:43:14,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:14,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:43:14,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:43:14,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:14,920 INFO L87 Difference]: Start difference. First operand 7512 states and 16864 transitions. Second operand 9 states. [2018-12-02 05:43:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:15,275 INFO L93 Difference]: Finished difference Result 9618 states and 21293 transitions. [2018-12-02 05:43:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:43:15,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 05:43:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:15,282 INFO L225 Difference]: With dead ends: 9618 [2018-12-02 05:43:15,282 INFO L226 Difference]: Without dead ends: 9618 [2018-12-02 05:43:15,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:43:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9618 states. [2018-12-02 05:43:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9618 to 8157. [2018-12-02 05:43:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8157 states. [2018-12-02 05:43:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8157 states to 8157 states and 18196 transitions. [2018-12-02 05:43:15,341 INFO L78 Accepts]: Start accepts. Automaton has 8157 states and 18196 transitions. Word has length 96 [2018-12-02 05:43:15,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:15,341 INFO L480 AbstractCegarLoop]: Abstraction has 8157 states and 18196 transitions. [2018-12-02 05:43:15,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:43:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8157 states and 18196 transitions. [2018-12-02 05:43:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:15,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:15,347 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 05:43:15,347 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:15,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:15,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1376119699, now seen corresponding path program 1 times [2018-12-02 05:43:15,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:15,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:15,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:15,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:15,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:15,456 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 05:43:15,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:15,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 05:43:15,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:15,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:43:15,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:43:15,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:43:15,457 INFO L87 Difference]: Start difference. First operand 8157 states and 18196 transitions. Second operand 13 states. [2018-12-02 05:43:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:16,093 INFO L93 Difference]: Finished difference Result 11618 states and 25550 transitions. [2018-12-02 05:43:16,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 05:43:16,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2018-12-02 05:43:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:16,104 INFO L225 Difference]: With dead ends: 11618 [2018-12-02 05:43:16,104 INFO L226 Difference]: Without dead ends: 11618 [2018-12-02 05:43:16,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2018-12-02 05:43:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11618 states. [2018-12-02 05:43:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11618 to 8808. [2018-12-02 05:43:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8808 states. [2018-12-02 05:43:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8808 states to 8808 states and 19682 transitions. [2018-12-02 05:43:16,178 INFO L78 Accepts]: Start accepts. Automaton has 8808 states and 19682 transitions. Word has length 96 [2018-12-02 05:43:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:16,178 INFO L480 AbstractCegarLoop]: Abstraction has 8808 states and 19682 transitions. [2018-12-02 05:43:16,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:43:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8808 states and 19682 transitions. [2018-12-02 05:43:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:16,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:16,184 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 05:43:16,185 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:16,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -488616018, now seen corresponding path program 1 times [2018-12-02 05:43:16,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:16,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:16,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:16,277 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 05:43:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:43:16,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:43:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:43:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:43:16,278 INFO L87 Difference]: Start difference. First operand 8808 states and 19682 transitions. Second operand 11 states. [2018-12-02 05:43:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:17,679 INFO L93 Difference]: Finished difference Result 16128 states and 36229 transitions. [2018-12-02 05:43:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:43:17,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 05:43:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:17,691 INFO L225 Difference]: With dead ends: 16128 [2018-12-02 05:43:17,691 INFO L226 Difference]: Without dead ends: 11177 [2018-12-02 05:43:17,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:43:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2018-12-02 05:43:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 8540. [2018-12-02 05:43:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8540 states. [2018-12-02 05:43:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8540 states to 8540 states and 19067 transitions. [2018-12-02 05:43:17,763 INFO L78 Accepts]: Start accepts. Automaton has 8540 states and 19067 transitions. Word has length 96 [2018-12-02 05:43:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:17,763 INFO L480 AbstractCegarLoop]: Abstraction has 8540 states and 19067 transitions. [2018-12-02 05:43:17,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:43:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8540 states and 19067 transitions. [2018-12-02 05:43:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:17,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:17,768 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 05:43:17,769 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:17,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash 537589784, now seen corresponding path program 1 times [2018-12-02 05:43:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:17,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:17,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:17,852 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 05:43:17,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:17,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:17,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:17,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:17,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:17,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:17,853 INFO L87 Difference]: Start difference. First operand 8540 states and 19067 transitions. Second operand 6 states. [2018-12-02 05:43:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:18,006 INFO L93 Difference]: Finished difference Result 7622 states and 16741 transitions. [2018-12-02 05:43:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:43:18,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 05:43:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:18,011 INFO L225 Difference]: With dead ends: 7622 [2018-12-02 05:43:18,012 INFO L226 Difference]: Without dead ends: 7622 [2018-12-02 05:43:18,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:18,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7622 states. [2018-12-02 05:43:18,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7622 to 7143. [2018-12-02 05:43:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7143 states. [2018-12-02 05:43:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7143 states to 7143 states and 15734 transitions. [2018-12-02 05:43:18,062 INFO L78 Accepts]: Start accepts. Automaton has 7143 states and 15734 transitions. Word has length 96 [2018-12-02 05:43:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:18,062 INFO L480 AbstractCegarLoop]: Abstraction has 7143 states and 15734 transitions. [2018-12-02 05:43:18,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7143 states and 15734 transitions. [2018-12-02 05:43:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:18,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:18,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:18,067 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:18,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1266537225, now seen corresponding path program 1 times [2018-12-02 05:43:18,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:18,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:18,170 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 05:43:18,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:18,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:18,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:18,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:18,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:18,170 INFO L87 Difference]: Start difference. First operand 7143 states and 15734 transitions. Second operand 7 states. [2018-12-02 05:43:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:18,381 INFO L93 Difference]: Finished difference Result 9361 states and 20510 transitions. [2018-12-02 05:43:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:43:18,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 05:43:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:18,387 INFO L225 Difference]: With dead ends: 9361 [2018-12-02 05:43:18,387 INFO L226 Difference]: Without dead ends: 9337 [2018-12-02 05:43:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:43:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9337 states. [2018-12-02 05:43:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9337 to 7491. [2018-12-02 05:43:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7491 states. [2018-12-02 05:43:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 16504 transitions. [2018-12-02 05:43:18,443 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 16504 transitions. Word has length 96 [2018-12-02 05:43:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:18,443 INFO L480 AbstractCegarLoop]: Abstraction has 7491 states and 16504 transitions. [2018-12-02 05:43:18,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 16504 transitions. [2018-12-02 05:43:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:18,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:18,448 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 05:43:18,448 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:18,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2066816054, now seen corresponding path program 2 times [2018-12-02 05:43:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:18,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 05:43:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:18,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:18,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:18,506 INFO L87 Difference]: Start difference. First operand 7491 states and 16504 transitions. Second operand 7 states. [2018-12-02 05:43:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:18,707 INFO L93 Difference]: Finished difference Result 8688 states and 19201 transitions. [2018-12-02 05:43:18,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:18,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 05:43:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:18,713 INFO L225 Difference]: With dead ends: 8688 [2018-12-02 05:43:18,713 INFO L226 Difference]: Without dead ends: 8688 [2018-12-02 05:43:18,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2018-12-02 05:43:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 7708. [2018-12-02 05:43:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7708 states. [2018-12-02 05:43:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7708 states to 7708 states and 16946 transitions. [2018-12-02 05:43:18,766 INFO L78 Accepts]: Start accepts. Automaton has 7708 states and 16946 transitions. Word has length 96 [2018-12-02 05:43:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:18,766 INFO L480 AbstractCegarLoop]: Abstraction has 7708 states and 16946 transitions. [2018-12-02 05:43:18,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7708 states and 16946 transitions. [2018-12-02 05:43:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:18,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:18,771 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 05:43:18,771 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:18,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:18,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1184419848, now seen corresponding path program 1 times [2018-12-02 05:43:18,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:43:18,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:18,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:43:18,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:18,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:18,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:18,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:18,821 INFO L87 Difference]: Start difference. First operand 7708 states and 16946 transitions. Second operand 6 states. [2018-12-02 05:43:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:19,126 INFO L93 Difference]: Finished difference Result 10649 states and 23221 transitions. [2018-12-02 05:43:19,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:43:19,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 05:43:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:19,133 INFO L225 Difference]: With dead ends: 10649 [2018-12-02 05:43:19,133 INFO L226 Difference]: Without dead ends: 10487 [2018-12-02 05:43:19,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:43:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2018-12-02 05:43:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 8465. [2018-12-02 05:43:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8465 states. [2018-12-02 05:43:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8465 states to 8465 states and 18676 transitions. [2018-12-02 05:43:19,195 INFO L78 Accepts]: Start accepts. Automaton has 8465 states and 18676 transitions. Word has length 96 [2018-12-02 05:43:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:19,195 INFO L480 AbstractCegarLoop]: Abstraction has 8465 states and 18676 transitions. [2018-12-02 05:43:19,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 8465 states and 18676 transitions. [2018-12-02 05:43:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:19,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:19,200 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 05:43:19,200 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:19,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1395770761, now seen corresponding path program 1 times [2018-12-02 05:43:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:19,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:19,253 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 05:43:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:43:19,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:19,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:43:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:43:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:43:19,253 INFO L87 Difference]: Start difference. First operand 8465 states and 18676 transitions. Second operand 6 states. [2018-12-02 05:43:19,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:19,523 INFO L93 Difference]: Finished difference Result 9364 states and 20420 transitions. [2018-12-02 05:43:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:43:19,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-02 05:43:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:19,529 INFO L225 Difference]: With dead ends: 9364 [2018-12-02 05:43:19,530 INFO L226 Difference]: Without dead ends: 9257 [2018-12-02 05:43:19,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:43:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9257 states. [2018-12-02 05:43:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9257 to 8391. [2018-12-02 05:43:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2018-12-02 05:43:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 18414 transitions. [2018-12-02 05:43:19,587 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 18414 transitions. Word has length 96 [2018-12-02 05:43:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:19,587 INFO L480 AbstractCegarLoop]: Abstraction has 8391 states and 18414 transitions. [2018-12-02 05:43:19,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:43:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 18414 transitions. [2018-12-02 05:43:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:19,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:19,592 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 05:43:19,592 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:19,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1877521545, now seen corresponding path program 1 times [2018-12-02 05:43:19,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:19,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:19,725 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 05:43:19,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:19,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:43:19,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:19,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:43:19,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:43:19,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:43:19,726 INFO L87 Difference]: Start difference. First operand 8391 states and 18414 transitions. Second operand 9 states. [2018-12-02 05:43:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:20,039 INFO L93 Difference]: Finished difference Result 10294 states and 22323 transitions. [2018-12-02 05:43:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:43:20,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-02 05:43:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:20,047 INFO L225 Difference]: With dead ends: 10294 [2018-12-02 05:43:20,047 INFO L226 Difference]: Without dead ends: 10294 [2018-12-02 05:43:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:43:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2018-12-02 05:43:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8718. [2018-12-02 05:43:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8718 states. [2018-12-02 05:43:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8718 states to 8718 states and 19083 transitions. [2018-12-02 05:43:20,110 INFO L78 Accepts]: Start accepts. Automaton has 8718 states and 19083 transitions. Word has length 96 [2018-12-02 05:43:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:20,110 INFO L480 AbstractCegarLoop]: Abstraction has 8718 states and 19083 transitions. [2018-12-02 05:43:20,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:43:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 8718 states and 19083 transitions. [2018-12-02 05:43:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:20,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:20,115 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 05:43:20,115 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:20,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 827237257, now seen corresponding path program 1 times [2018-12-02 05:43:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:20,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:20,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:20,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:20,189 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 05:43:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:20,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 05:43:20,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 05:43:20,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 05:43:20,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:43:20,190 INFO L87 Difference]: Start difference. First operand 8718 states and 19083 transitions. Second operand 8 states. [2018-12-02 05:43:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:20,617 INFO L93 Difference]: Finished difference Result 11773 states and 25703 transitions. [2018-12-02 05:43:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:43:20,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-02 05:43:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:20,627 INFO L225 Difference]: With dead ends: 11773 [2018-12-02 05:43:20,627 INFO L226 Difference]: Without dead ends: 11705 [2018-12-02 05:43:20,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:43:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11705 states. [2018-12-02 05:43:20,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11705 to 8959. [2018-12-02 05:43:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2018-12-02 05:43:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 19610 transitions. [2018-12-02 05:43:20,727 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 19610 transitions. Word has length 96 [2018-12-02 05:43:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:20,727 INFO L480 AbstractCegarLoop]: Abstraction has 8959 states and 19610 transitions. [2018-12-02 05:43:20,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 05:43:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 19610 transitions. [2018-12-02 05:43:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:20,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:20,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, 1, 1, 1, 1] [2018-12-02 05:43:20,735 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:20,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:20,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1249972086, now seen corresponding path program 2 times [2018-12-02 05:43:20,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:20,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:20,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:43:20,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:20,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:20,801 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 05:43:20,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:20,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:43:20,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:20,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:43:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:43:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:43:20,802 INFO L87 Difference]: Start difference. First operand 8959 states and 19610 transitions. Second operand 7 states. [2018-12-02 05:43:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:20,906 INFO L93 Difference]: Finished difference Result 11470 states and 25260 transitions. [2018-12-02 05:43:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:43:20,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 05:43:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:20,914 INFO L225 Difference]: With dead ends: 11470 [2018-12-02 05:43:20,914 INFO L226 Difference]: Without dead ends: 11470 [2018-12-02 05:43:20,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:43:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2018-12-02 05:43:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 7965. [2018-12-02 05:43:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7965 states. [2018-12-02 05:43:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 17356 transitions. [2018-12-02 05:43:20,997 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 17356 transitions. Word has length 96 [2018-12-02 05:43:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:20,997 INFO L480 AbstractCegarLoop]: Abstraction has 7965 states and 17356 transitions. [2018-12-02 05:43:20,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:43:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 17356 transitions. [2018-12-02 05:43:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:21,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:21,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:43:21,004 INFO L423 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash -556870389, now seen corresponding path program 2 times [2018-12-02 05:43:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:21,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:43:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:21,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:43:21,127 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 05:43:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:43:21,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:43:21,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:43:21,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:43:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:43:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:43:21,128 INFO L87 Difference]: Start difference. First operand 7965 states and 17356 transitions. Second operand 11 states. [2018-12-02 05:43:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:43:21,707 INFO L93 Difference]: Finished difference Result 10008 states and 21742 transitions. [2018-12-02 05:43:21,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:43:21,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-02 05:43:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:43:21,720 INFO L225 Difference]: With dead ends: 10008 [2018-12-02 05:43:21,720 INFO L226 Difference]: Without dead ends: 10008 [2018-12-02 05:43:21,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:43:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10008 states. [2018-12-02 05:43:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10008 to 7802. [2018-12-02 05:43:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7802 states. [2018-12-02 05:43:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7802 states to 7802 states and 17004 transitions. [2018-12-02 05:43:21,805 INFO L78 Accepts]: Start accepts. Automaton has 7802 states and 17004 transitions. Word has length 96 [2018-12-02 05:43:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:43:21,805 INFO L480 AbstractCegarLoop]: Abstraction has 7802 states and 17004 transitions. [2018-12-02 05:43:21,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:43:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7802 states and 17004 transitions. [2018-12-02 05:43:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:43:21,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:43:21,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:43:21,812 INFO L423 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:43:21,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:43:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash 330633292, now seen corresponding path program 2 times [2018-12-02 05:43:21,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:43:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:21,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:43:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:43:21,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:43:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:43:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:43:21,849 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:43:21,942 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:43:21,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:43:21 BasicIcfg [2018-12-02 05:43:21,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:43:21,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:43:21,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:43:21,943 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:43:21,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:42:53" (3/4) ... [2018-12-02 05:43:21,945 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:43:22,020 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc7e971d-4830-4cfd-9c31-8415ffbdc66d/bin-2019/utaipan/witness.graphml [2018-12-02 05:43:22,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:43:22,021 INFO L168 Benchmark]: Toolchain (without parser) took 29525.30 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.2 GB). Free memory was 957.1 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 391.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:43:22,022 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:43:22,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-02 05:43:22,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:43:22,022 INFO L168 Benchmark]: Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:43:22,022 INFO L168 Benchmark]: RCFGBuilder took 321.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:43:22,023 INFO L168 Benchmark]: TraceAbstraction took 28757.27 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-02 05:43:22,023 INFO L168 Benchmark]: Witness Printer took 77.34 ms. Allocated memory is still 4.3 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:43:22,024 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 321.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28757.27 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. * Witness Printer took 77.34 ms. Allocated memory is still 4.3 GB. Free memory is still 3.8 GB. There was no memory consumed. 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] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] -1 pthread_t t1603; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L703] 0 x$w_buff1 = x$w_buff0 [L704] 0 x$w_buff0 = 1 [L705] 0 x$w_buff1_used = x$w_buff0_used [L706] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L708] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L709] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L710] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L711] 0 x$r_buff0_thd1 = (_Bool)1 [L714] 0 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L717] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L780] -1 pthread_t t1604; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] FCALL, FORK -1 pthread_create(&t1604, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L731] 1 y = 2 [L734] 1 z = 1 [L737] 1 __unbuffered_p1_EAX = z [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 x$flush_delayed = weak$$choice2 [L743] 1 x$mem_tmp = x 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=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L750] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = x 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=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L752] EXPR 1 x$flush_delayed ? x$mem_tmp : x 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=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L717] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2, z=1] [L756] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L759] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L760] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L718] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L719] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L719] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L720] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L720] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L721] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L724] 0 __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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L788] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L790] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L791] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] -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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, 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=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 28.6s OverallTime, 44 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11487 SDtfs, 12911 SDslu, 28709 SDs, 0 SdLazy, 14271 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 114 SyntacticMatches, 42 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=7, 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: 10.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 189328 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3391 NumberOfCodeBlocks, 3391 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3252 ConstructedInterpolants, 0 QuantifiedInterpolants, 873382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...