./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c --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_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 ........................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:55:34,132 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:55:34,133 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:55:34,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:55:34,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:55:34,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:55:34,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:55:34,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:55:34,142 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:55:34,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:55:34,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:55:34,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:55:34,144 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:55:34,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:55:34,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:55:34,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:55:34,146 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:55:34,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:55:34,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:55:34,149 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:55:34,150 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:55:34,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:55:34,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:55:34,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:55:34,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:55:34,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:55:34,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:55:34,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:55:34,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:55:34,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:55:34,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:55:34,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:55:34,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:55:34,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:55:34,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:55:34,156 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:55:34,156 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:55:34,163 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:55:34,164 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:55:34,164 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:55:34,164 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:55:34,164 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:55:34,164 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:55:34,165 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:55:34,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:55:34,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:55:34,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:55:34,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:55:34,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:55:34,166 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:55:34,167 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:55:34,167 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:55:34,168 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:55:34,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:55:34,169 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:55:34,169 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_ecc1e72b-d160-4c8f-841b-e2573b987ba7/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-12-03 02:55:34,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:55:34,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:55:34,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:55:34,196 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:55:34,196 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:55:34,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-03 02:55:34,231 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/0634d9211/11cffbd210bc49ee8fb274c4509245a7/FLAG87e9a503f [2018-12-03 02:55:34,626 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:55:34,626 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-03 02:55:34,634 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/0634d9211/11cffbd210bc49ee8fb274c4509245a7/FLAG87e9a503f [2018-12-03 02:55:34,964 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/0634d9211/11cffbd210bc49ee8fb274c4509245a7 [2018-12-03 02:55:34,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:55:34,967 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:55:34,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:55:34,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:55:34,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:55:34,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:55:34" (1/1) ... [2018-12-03 02:55:34,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8029e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:34, skipping insertion in model container [2018-12-03 02:55:34,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:55:34" (1/1) ... [2018-12-03 02:55:34,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:55:35,005 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:55:35,243 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:55:35,254 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:55:35,334 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:55:35,351 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:55:35,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35 WrapperNode [2018-12-03 02:55:35,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:55:35,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:55:35,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:55:35,352 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:55:35,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:55:35,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:55:35,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:55:35,382 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:55:35,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... [2018-12-03 02:55:35,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:55:35,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:55:35,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:55:35,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:55:35,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/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-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 02:55:35,484 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:55:35,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 02:55:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 02:55:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-03 02:55:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-03 02:55:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-03 02:55:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 02:55:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 02:55:35,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:55:35,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:55:35,683 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 02:55:35,683 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 02:55:36,054 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:55:36,054 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 02:55:36,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:55:36 BoogieIcfgContainer [2018-12-03 02:55:36,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:55:36,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:55:36,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:55:36,057 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:55:36,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:55:34" (1/3) ... [2018-12-03 02:55:36,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beefd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:55:36, skipping insertion in model container [2018-12-03 02:55:36,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:55:35" (2/3) ... [2018-12-03 02:55:36,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4beefd0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:55:36, skipping insertion in model container [2018-12-03 02:55:36,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:55:36" (3/3) ... [2018-12-03 02:55:36,059 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-03 02:55:36,064 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:55:36,069 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 02:55:36,078 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 02:55:36,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:55:36,098 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:55:36,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:55:36,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:55:36,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:55:36,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:55:36,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:55:36,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:55:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-03 02:55:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 02:55:36,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:36,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] [2018-12-03 02:55:36,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:36,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:36,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1546919168, now seen corresponding path program 1 times [2018-12-03 02:55:36,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:36,306 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-03 02:55:36,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:36,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:36,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:36,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:36,321 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-03 02:55:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:36,566 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-03 02:55:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:36,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-03 02:55:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:36,575 INFO L225 Difference]: With dead ends: 333 [2018-12-03 02:55:36,575 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 02:55:36,577 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-03 02:55:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 02:55:36,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-03 02:55:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 02:55:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-03 02:55:36,613 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-03 02:55:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:36,613 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-03 02:55:36,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-03 02:55:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:55:36,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:36,615 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:36,616 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:36,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:36,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1039083406, now seen corresponding path program 1 times [2018-12-03 02:55:36,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:36,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:36,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:36,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:36,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:36,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:36,709 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-03 02:55:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:36,914 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-03 02:55:36,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:36,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 02:55:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:36,916 INFO L225 Difference]: With dead ends: 296 [2018-12-03 02:55:36,916 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 02:55:36,916 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-03 02:55:36,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 02:55:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-03 02:55:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 02:55:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-03 02:55:36,922 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-03 02:55:36,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:36,922 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-03 02:55:36,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-03 02:55:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:55:36,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:36,924 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:36,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:36,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash -7342962, now seen corresponding path program 1 times [2018-12-03 02:55:36,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:36,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:36,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:36,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:55:36,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:55:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:55:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:55:36,977 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-03 02:55:37,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:37,275 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-03 02:55:37,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:55:37,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-03 02:55:37,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:37,277 INFO L225 Difference]: With dead ends: 300 [2018-12-03 02:55:37,277 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 02:55:37,278 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-03 02:55:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 02:55:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-03 02:55:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 02:55:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-03 02:55:37,286 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-03 02:55:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:37,286 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-03 02:55:37,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:55:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-03 02:55:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:55:37,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:37,287 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:37,287 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:37,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1814299397, now seen corresponding path program 1 times [2018-12-03 02:55:37,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:37,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:37,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:37,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:37,349 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-03 02:55:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:37,523 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-03 02:55:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:37,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 02:55:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:37,524 INFO L225 Difference]: With dead ends: 333 [2018-12-03 02:55:37,524 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 02:55:37,524 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-03 02:55:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 02:55:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-03 02:55:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 02:55:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-03 02:55:37,530 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-03 02:55:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:37,530 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-03 02:55:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-03 02:55:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:55:37,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:37,531 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:37,531 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:37,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash 170767942, now seen corresponding path program 1 times [2018-12-03 02:55:37,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:37,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:37,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:37,579 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-03 02:55:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:37,714 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-03 02:55:37,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:37,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 02:55:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:37,715 INFO L225 Difference]: With dead ends: 332 [2018-12-03 02:55:37,715 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 02:55:37,715 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-03 02:55:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 02:55:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 02:55:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 02:55:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-03 02:55:37,719 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-03 02:55:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:37,719 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-03 02:55:37,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-03 02:55:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 02:55:37,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:37,720 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:37,720 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1692923025, now seen corresponding path program 1 times [2018-12-03 02:55:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:37,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:37,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:37,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:37,764 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-03 02:55:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:37,903 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-03 02:55:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:37,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 02:55:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:37,904 INFO L225 Difference]: With dead ends: 332 [2018-12-03 02:55:37,904 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 02:55:37,904 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-03 02:55:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 02:55:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 02:55:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 02:55:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-03 02:55:37,908 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-03 02:55:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:37,908 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-03 02:55:37,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-03 02:55:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 02:55:37,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:37,908 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:37,909 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:37,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1847214462, now seen corresponding path program 1 times [2018-12-03 02:55:37,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:37,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:37,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:37,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:37,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:37,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:37,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:37,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:37,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:37,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:37,951 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-03 02:55:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:38,093 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-03 02:55:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:38,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-03 02:55:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:38,094 INFO L225 Difference]: With dead ends: 332 [2018-12-03 02:55:38,094 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 02:55:38,095 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-03 02:55:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 02:55:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 02:55:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 02:55:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-03 02:55:38,098 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-03 02:55:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:38,098 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-03 02:55:38,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:38,098 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-03 02:55:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 02:55:38,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:38,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:38,099 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:38,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1649145975, now seen corresponding path program 1 times [2018-12-03 02:55:38,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:38,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:38,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:38,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:38,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:38,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:38,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:38,133 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-03 02:55:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:38,285 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-03 02:55:38,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:38,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-03 02:55:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:38,286 INFO L225 Difference]: With dead ends: 361 [2018-12-03 02:55:38,286 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 02:55:38,286 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-03 02:55:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 02:55:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-03 02:55:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-03 02:55:38,290 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-03 02:55:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:38,290 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-03 02:55:38,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-03 02:55:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 02:55:38,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:38,291 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:38,291 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:38,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 677650986, now seen corresponding path program 1 times [2018-12-03 02:55:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:38,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:38,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:38,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:38,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:38,321 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-03 02:55:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:38,449 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-03 02:55:38,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:38,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-03 02:55:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:38,450 INFO L225 Difference]: With dead ends: 376 [2018-12-03 02:55:38,450 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 02:55:38,450 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-03 02:55:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 02:55:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-03 02:55:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-03 02:55:38,454 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-03 02:55:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:38,455 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-03 02:55:38,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-03 02:55:38,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 02:55:38,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:38,455 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:38,456 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:38,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:38,456 INFO L82 PathProgramCache]: Analyzing trace with hash 357033949, now seen corresponding path program 1 times [2018-12-03 02:55:38,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:38,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:38,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:38,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:38,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:38,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:38,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:38,487 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-03 02:55:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:38,614 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-03 02:55:38,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:38,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 02:55:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:38,615 INFO L225 Difference]: With dead ends: 366 [2018-12-03 02:55:38,615 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 02:55:38,615 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-03 02:55:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 02:55:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-03 02:55:38,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-03 02:55:38,619 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-03 02:55:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:38,619 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-03 02:55:38,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:38,619 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-03 02:55:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 02:55:38,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:38,620 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:38,620 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:38,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:38,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1058138999, now seen corresponding path program 1 times [2018-12-03 02:55:38,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:38,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:38,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:38,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:38,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:38,653 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-03 02:55:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:38,838 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-03 02:55:38,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:38,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-03 02:55:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:38,839 INFO L225 Difference]: With dead ends: 383 [2018-12-03 02:55:38,839 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 02:55:38,840 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-03 02:55:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 02:55:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-03 02:55:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-03 02:55:38,844 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-03 02:55:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:38,844 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-03 02:55:38,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-03 02:55:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:55:38,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:38,845 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:38,845 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:38,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1223576014, now seen corresponding path program 1 times [2018-12-03 02:55:38,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:38,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:38,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:38,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:38,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:38,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:38,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:38,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:38,884 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-03 02:55:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:39,070 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-03 02:55:39,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:39,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-03 02:55:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:39,071 INFO L225 Difference]: With dead ends: 381 [2018-12-03 02:55:39,071 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 02:55:39,071 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-03 02:55:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 02:55:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-03 02:55:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-03 02:55:39,075 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-03 02:55:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:39,075 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-03 02:55:39,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-03 02:55:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 02:55:39,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:39,075 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,076 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:39,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash -419955441, now seen corresponding path program 1 times [2018-12-03 02:55:39,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:39,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:39,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:39,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:39,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:39,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,105 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-03 02:55:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:39,264 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-03 02:55:39,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:39,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-03 02:55:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:39,265 INFO L225 Difference]: With dead ends: 380 [2018-12-03 02:55:39,265 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 02:55:39,266 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-03 02:55:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 02:55:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 02:55:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-03 02:55:39,269 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-03 02:55:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:39,269 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-03 02:55:39,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-03 02:55:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 02:55:39,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:39,270 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:39,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1469488582, now seen corresponding path program 1 times [2018-12-03 02:55:39,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:39,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:39,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:39,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:39,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:39,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:39,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:39,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:39,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,306 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-03 02:55:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:39,465 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-03 02:55:39,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:39,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-03 02:55:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:39,466 INFO L225 Difference]: With dead ends: 380 [2018-12-03 02:55:39,466 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 02:55:39,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 02:55:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 02:55:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-03 02:55:39,472 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-03 02:55:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:39,472 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-03 02:55:39,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-03 02:55:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 02:55:39,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:39,473 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,473 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:39,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1698264843, now seen corresponding path program 1 times [2018-12-03 02:55:39,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:39,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:39,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:39,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:39,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:39,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:39,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:39,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,521 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-03 02:55:39,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:39,678 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-03 02:55:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:39,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-03 02:55:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:39,679 INFO L225 Difference]: With dead ends: 380 [2018-12-03 02:55:39,679 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 02:55:39,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 02:55:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 02:55:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-03 02:55:39,683 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-03 02:55:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:39,684 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-03 02:55:39,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-03 02:55:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 02:55:39,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:39,684 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,684 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:39,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1081640255, now seen corresponding path program 1 times [2018-12-03 02:55:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:39,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:39,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:39,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:39,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:39,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,723 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-03 02:55:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:39,860 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-03 02:55:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:39,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-03 02:55:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:39,862 INFO L225 Difference]: With dead ends: 380 [2018-12-03 02:55:39,862 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 02:55:39,862 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-03 02:55:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 02:55:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 02:55:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-03 02:55:39,866 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-03 02:55:39,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:39,866 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-03 02:55:39,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-03 02:55:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 02:55:39,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:39,867 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:39,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:39,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:39,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1653580326, now seen corresponding path program 1 times [2018-12-03 02:55:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:39,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:39,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:55:39,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:39,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:39,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:39,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:39,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:39,910 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-03 02:55:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:40,067 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-03 02:55:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:40,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-03 02:55:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:40,068 INFO L225 Difference]: With dead ends: 370 [2018-12-03 02:55:40,068 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 02:55:40,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 02:55:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-03 02:55:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 02:55:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-03 02:55:40,072 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-03 02:55:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:40,072 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-03 02:55:40,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-03 02:55:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 02:55:40,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:40,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:40,073 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:40,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash -586078850, now seen corresponding path program 1 times [2018-12-03 02:55:40,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:40,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:40,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:40,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:40,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:40,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:40,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:40,126 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-03 02:55:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:40,378 INFO L93 Difference]: Finished difference Result 467 states and 692 transitions. [2018-12-03 02:55:40,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:40,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 02:55:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:40,379 INFO L225 Difference]: With dead ends: 467 [2018-12-03 02:55:40,379 INFO L226 Difference]: Without dead ends: 298 [2018-12-03 02:55:40,379 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-03 02:55:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-03 02:55:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 224. [2018-12-03 02:55:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-03 02:55:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-03 02:55:40,384 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-03 02:55:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:40,384 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-03 02:55:40,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-03 02:55:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 02:55:40,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:40,385 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:40,385 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:40,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash -658465408, now seen corresponding path program 1 times [2018-12-03 02:55:40,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:40,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:40,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:40,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:40,419 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:40,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:40,420 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-03 02:55:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:40,616 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-03 02:55:40,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:40,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 02:55:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:40,617 INFO L225 Difference]: With dead ends: 472 [2018-12-03 02:55:40,617 INFO L226 Difference]: Without dead ends: 273 [2018-12-03 02:55:40,618 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-03 02:55:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-03 02:55:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-03 02:55:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-03 02:55:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-03 02:55:40,623 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-03 02:55:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:40,623 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-03 02:55:40,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-03 02:55:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 02:55:40,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:40,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:40,624 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -407391601, now seen corresponding path program 1 times [2018-12-03 02:55:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:40,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:40,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:40,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:40,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:40,667 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-03 02:55:40,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:40,898 INFO L93 Difference]: Finished difference Result 537 states and 811 transitions. [2018-12-03 02:55:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:40,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 02:55:40,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:40,899 INFO L225 Difference]: With dead ends: 537 [2018-12-03 02:55:40,899 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 02:55:40,900 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-03 02:55:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 02:55:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-12-03 02:55:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-03 02:55:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-03 02:55:40,905 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-03 02:55:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:40,905 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-03 02:55:40,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-03 02:55:40,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 02:55:40,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:40,906 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:40,906 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 454550748, now seen corresponding path program 1 times [2018-12-03 02:55:40,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:40,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:40,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:40,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:40,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:40,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:40,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:40,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:40,951 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-03 02:55:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:41,165 INFO L93 Difference]: Finished difference Result 538 states and 811 transitions. [2018-12-03 02:55:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:41,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-03 02:55:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:41,166 INFO L225 Difference]: With dead ends: 538 [2018-12-03 02:55:41,166 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 02:55:41,167 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-03 02:55:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 02:55:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 259. [2018-12-03 02:55:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 02:55:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-03 02:55:41,175 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2018-12-03 02:55:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:41,175 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-03 02:55:41,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-03 02:55:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 02:55:41,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:41,176 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:41,176 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:41,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1199163944, now seen corresponding path program 1 times [2018-12-03 02:55:41,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:41,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:41,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:41,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:41,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:41,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:41,227 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-03 02:55:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:41,440 INFO L93 Difference]: Finished difference Result 542 states and 822 transitions. [2018-12-03 02:55:41,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:41,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-03 02:55:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:41,442 INFO L225 Difference]: With dead ends: 542 [2018-12-03 02:55:41,442 INFO L226 Difference]: Without dead ends: 308 [2018-12-03 02:55:41,442 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-03 02:55:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-03 02:55:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-03 02:55:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-03 02:55:41,448 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2018-12-03 02:55:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:41,448 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-03 02:55:41,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-03 02:55:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:55:41,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:41,449 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:41,449 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:41,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1774849204, now seen corresponding path program 1 times [2018-12-03 02:55:41,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:41,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:41,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:41,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:41,483 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-03 02:55:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:41,682 INFO L93 Difference]: Finished difference Result 543 states and 822 transitions. [2018-12-03 02:55:41,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:41,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-03 02:55:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:41,683 INFO L225 Difference]: With dead ends: 543 [2018-12-03 02:55:41,683 INFO L226 Difference]: Without dead ends: 308 [2018-12-03 02:55:41,684 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-03 02:55:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-03 02:55:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-03 02:55:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-03 02:55:41,689 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-03 02:55:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:41,689 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-03 02:55:41,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-03 02:55:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 02:55:41,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:41,690 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:41,690 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:41,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash -591845390, now seen corresponding path program 1 times [2018-12-03 02:55:41,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:41,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:41,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:41,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:41,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:41,727 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-03 02:55:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:41,908 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-03 02:55:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:41,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-03 02:55:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:41,909 INFO L225 Difference]: With dead ends: 520 [2018-12-03 02:55:41,910 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 02:55:41,910 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-03 02:55:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 02:55:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-03 02:55:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-03 02:55:41,915 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-03 02:55:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:41,916 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-03 02:55:41,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-03 02:55:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:55:41,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:41,916 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:41,916 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:41,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1148102909, now seen corresponding path program 1 times [2018-12-03 02:55:41,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:41,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:41,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:41,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:41,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:41,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:41,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:41,951 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-03 02:55:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:42,139 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2018-12-03 02:55:42,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:42,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 02:55:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:42,141 INFO L225 Difference]: With dead ends: 541 [2018-12-03 02:55:42,141 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 02:55:42,141 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-03 02:55:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 02:55:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 260. [2018-12-03 02:55:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-03 02:55:42,154 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-03 02:55:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:42,154 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-03 02:55:42,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:42,154 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-03 02:55:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:55:42,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:42,155 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:42,155 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1503332932, now seen corresponding path program 1 times [2018-12-03 02:55:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:42,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:42,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:42,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:42,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:42,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:42,204 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-03 02:55:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:42,400 INFO L93 Difference]: Finished difference Result 540 states and 813 transitions. [2018-12-03 02:55:42,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:42,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 02:55:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:42,401 INFO L225 Difference]: With dead ends: 540 [2018-12-03 02:55:42,401 INFO L226 Difference]: Without dead ends: 305 [2018-12-03 02:55:42,401 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-03 02:55:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-03 02:55:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-03 02:55:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-03 02:55:42,407 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-03 02:55:42,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:42,407 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-03 02:55:42,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:42,407 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-03 02:55:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:55:42,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:42,407 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:42,407 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:42,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:42,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1501191291, now seen corresponding path program 1 times [2018-12-03 02:55:42,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:42,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:42,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:42,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:42,439 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-03 02:55:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:42,599 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-03 02:55:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:42,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 02:55:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:42,600 INFO L225 Difference]: With dead ends: 518 [2018-12-03 02:55:42,600 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 02:55:42,600 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-03 02:55:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 02:55:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-03 02:55:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-03 02:55:42,606 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-03 02:55:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:42,606 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-03 02:55:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-03 02:55:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 02:55:42,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:42,606 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:42,607 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:42,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1150244550, now seen corresponding path program 1 times [2018-12-03 02:55:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:42,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:42,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:42,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:42,640 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-03 02:55:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:42,795 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-03 02:55:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:42,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 02:55:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:42,796 INFO L225 Difference]: With dead ends: 517 [2018-12-03 02:55:42,796 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 02:55:42,797 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-03 02:55:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 02:55:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 02:55:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-03 02:55:42,802 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-03 02:55:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:42,802 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-03 02:55:42,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-03 02:55:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 02:55:42,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:42,803 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:42,803 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:42,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:42,803 INFO L82 PathProgramCache]: Analyzing trace with hash 961886001, now seen corresponding path program 1 times [2018-12-03 02:55:42,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:42,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:42,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:42,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:42,838 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:42,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:42,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:42,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:42,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:42,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:42,839 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-03 02:55:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:43,026 INFO L93 Difference]: Finished difference Result 540 states and 807 transitions. [2018-12-03 02:55:43,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:43,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-03 02:55:43,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:43,027 INFO L225 Difference]: With dead ends: 540 [2018-12-03 02:55:43,027 INFO L226 Difference]: Without dead ends: 305 [2018-12-03 02:55:43,027 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-03 02:55:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-03 02:55:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-03 02:55:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-03 02:55:43,033 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-03 02:55:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:43,033 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-03 02:55:43,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-03 02:55:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 02:55:43,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:43,033 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:43,034 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:43,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:43,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1393919249, now seen corresponding path program 1 times [2018-12-03 02:55:43,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:43,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:43,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:43,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:43,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:43,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:43,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:43,058 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-03 02:55:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:43,213 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-03 02:55:43,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:43,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-03 02:55:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:43,214 INFO L225 Difference]: With dead ends: 517 [2018-12-03 02:55:43,214 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 02:55:43,215 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-03 02:55:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 02:55:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 02:55:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-03 02:55:43,220 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-03 02:55:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:43,220 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-03 02:55:43,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-03 02:55:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:55:43,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:43,221 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:43,221 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:43,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:43,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1152513280, now seen corresponding path program 1 times [2018-12-03 02:55:43,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:43,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:43,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:43,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:43,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:43,255 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-03 02:55:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:43,437 INFO L93 Difference]: Finished difference Result 540 states and 803 transitions. [2018-12-03 02:55:43,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:43,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-03 02:55:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:43,438 INFO L225 Difference]: With dead ends: 540 [2018-12-03 02:55:43,438 INFO L226 Difference]: Without dead ends: 305 [2018-12-03 02:55:43,438 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-03 02:55:43,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-03 02:55:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-03 02:55:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-03 02:55:43,444 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-03 02:55:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:43,445 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-03 02:55:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-03 02:55:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 02:55:43,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:43,445 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:43,445 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:43,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1168031998, now seen corresponding path program 1 times [2018-12-03 02:55:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:43,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:43,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:43,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:43,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:43,486 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-03 02:55:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:43,649 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-03 02:55:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:43,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-03 02:55:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:43,650 INFO L225 Difference]: With dead ends: 517 [2018-12-03 02:55:43,650 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 02:55:43,650 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-03 02:55:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 02:55:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 02:55:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-03 02:55:43,656 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-03 02:55:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:43,656 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-03 02:55:43,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-03 02:55:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 02:55:43,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:43,657 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:43,657 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:43,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:43,657 INFO L82 PathProgramCache]: Analyzing trace with hash 738551148, now seen corresponding path program 1 times [2018-12-03 02:55:43,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:43,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:43,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:43,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:43,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:43,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:43,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:43,686 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-03 02:55:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:43,866 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2018-12-03 02:55:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:43,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-03 02:55:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:43,867 INFO L225 Difference]: With dead ends: 540 [2018-12-03 02:55:43,867 INFO L226 Difference]: Without dead ends: 305 [2018-12-03 02:55:43,867 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-03 02:55:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-03 02:55:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-03 02:55:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-03 02:55:43,874 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-03 02:55:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:43,874 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-03 02:55:43,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-03 02:55:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 02:55:43,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:43,875 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:43,875 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:43,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash 257470890, now seen corresponding path program 1 times [2018-12-03 02:55:43,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:43,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:43,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:43,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:43,911 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-03 02:55:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,080 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-03 02:55:44,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:44,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-03 02:55:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,081 INFO L225 Difference]: With dead ends: 517 [2018-12-03 02:55:44,081 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 02:55:44,081 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-03 02:55:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 02:55:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 02:55:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-03 02:55:44,087 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-03 02:55:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,088 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-03 02:55:44,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-03 02:55:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 02:55:44,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,088 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,088 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2050028325, now seen corresponding path program 1 times [2018-12-03 02:55:44,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:44,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:44,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:44,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:44,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:44,117 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-03 02:55:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,287 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2018-12-03 02:55:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:44,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 02:55:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,288 INFO L225 Difference]: With dead ends: 530 [2018-12-03 02:55:44,288 INFO L226 Difference]: Without dead ends: 295 [2018-12-03 02:55:44,288 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-03 02:55:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-03 02:55:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-03 02:55:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-03 02:55:44,295 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-03 02:55:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,295 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-03 02:55:44,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-03 02:55:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 02:55:44,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,296 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,296 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 216352861, now seen corresponding path program 1 times [2018-12-03 02:55:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:44,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:44,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:44,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:44,327 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-03 02:55:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,475 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-03 02:55:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:44,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 02:55:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,475 INFO L225 Difference]: With dead ends: 507 [2018-12-03 02:55:44,475 INFO L226 Difference]: Without dead ends: 272 [2018-12-03 02:55:44,476 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-03 02:55:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-03 02:55:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-03 02:55:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:44,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-03 02:55:44,482 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-03 02:55:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,482 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-03 02:55:44,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-03 02:55:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 02:55:44,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,483 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,483 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1019220863, now seen corresponding path program 1 times [2018-12-03 02:55:44,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 02:55:44,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:44,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:44,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:44,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:44,523 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-03 02:55:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,700 INFO L93 Difference]: Finished difference Result 530 states and 779 transitions. [2018-12-03 02:55:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:44,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 02:55:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,701 INFO L225 Difference]: With dead ends: 530 [2018-12-03 02:55:44,701 INFO L226 Difference]: Without dead ends: 295 [2018-12-03 02:55:44,701 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-03 02:55:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-03 02:55:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-03 02:55:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 02:55:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-03 02:55:44,708 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-03 02:55:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,708 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-03 02:55:44,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-03 02:55:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 02:55:44,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,708 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,708 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 367564547, now seen corresponding path program 1 times [2018-12-03 02:55:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 02:55:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:55:44,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:55:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:55:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:55:44,734 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-03 02:55:44,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,766 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-03 02:55:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:55:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-03 02:55:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,767 INFO L225 Difference]: With dead ends: 728 [2018-12-03 02:55:44,767 INFO L226 Difference]: Without dead ends: 493 [2018-12-03 02:55:44,768 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-03 02:55:44,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-03 02:55:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-03 02:55:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-03 02:55:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-03 02:55:44,781 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-03 02:55:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,781 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-03 02:55:44,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:55:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-03 02:55:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 02:55:44,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,782 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,782 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1725725933, now seen corresponding path program 1 times [2018-12-03 02:55:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:55:44,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:55:44,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:55:44,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:55:44,805 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-03 02:55:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,851 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-03 02:55:44,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:55:44,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 02:55:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,852 INFO L225 Difference]: With dead ends: 1196 [2018-12-03 02:55:44,852 INFO L226 Difference]: Without dead ends: 728 [2018-12-03 02:55:44,853 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-03 02:55:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-03 02:55:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-03 02:55:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-03 02:55:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-03 02:55:44,871 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-03 02:55:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,871 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-03 02:55:44,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:55:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-03 02:55:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 02:55:44,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,872 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,872 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 244952331, now seen corresponding path program 1 times [2018-12-03 02:55:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:44,895 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:55:44,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:44,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:55:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:55:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:55:44,896 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-03 02:55:44,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:44,942 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-03 02:55:44,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:55:44,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-03 02:55:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:44,944 INFO L225 Difference]: With dead ends: 1662 [2018-12-03 02:55:44,944 INFO L226 Difference]: Without dead ends: 961 [2018-12-03 02:55:44,945 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-03 02:55:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-03 02:55:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-03 02:55:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-03 02:55:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-03 02:55:44,968 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2018-12-03 02:55:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:44,969 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-03 02:55:44,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:55:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-03 02:55:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 02:55:44,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:44,970 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:44,970 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:44,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1740119302, now seen corresponding path program 1 times [2018-12-03 02:55:44,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:44,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:45,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:45,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:45,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:45,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:45,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:45,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:45,008 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-03 02:55:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:45,357 INFO L93 Difference]: Finished difference Result 2295 states and 3391 transitions. [2018-12-03 02:55:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:45,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-03 02:55:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:45,360 INFO L225 Difference]: With dead ends: 2295 [2018-12-03 02:55:45,361 INFO L226 Difference]: Without dead ends: 1361 [2018-12-03 02:55:45,361 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-03 02:55:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-12-03 02:55:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1115. [2018-12-03 02:55:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-03 02:55:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-03 02:55:45,389 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2018-12-03 02:55:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:45,389 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-03 02:55:45,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-03 02:55:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 02:55:45,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:45,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:45,390 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:45,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1883869130, now seen corresponding path program 1 times [2018-12-03 02:55:45,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:45,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:45,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:45,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:45,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:45,435 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-03 02:55:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:45,704 INFO L93 Difference]: Finished difference Result 2433 states and 3649 transitions. [2018-12-03 02:55:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:45,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-03 02:55:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:45,707 INFO L225 Difference]: With dead ends: 2433 [2018-12-03 02:55:45,707 INFO L226 Difference]: Without dead ends: 1343 [2018-12-03 02:55:45,708 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-03 02:55:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-12-03 02:55:45,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2018-12-03 02:55:45,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-03 02:55:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-03 02:55:45,735 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2018-12-03 02:55:45,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:45,736 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-03 02:55:45,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-03 02:55:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 02:55:45,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:45,737 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:45,737 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:45,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:45,737 INFO L82 PathProgramCache]: Analyzing trace with hash -401210212, now seen corresponding path program 1 times [2018-12-03 02:55:45,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:45,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 02:55:45,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:45,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:55:45,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:45,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:55:45,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:55:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:55:45,768 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2018-12-03 02:55:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:45,835 INFO L93 Difference]: Finished difference Result 1341 states and 2010 transitions. [2018-12-03 02:55:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:55:45,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-03 02:55:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:45,838 INFO L225 Difference]: With dead ends: 1341 [2018-12-03 02:55:45,838 INFO L226 Difference]: Without dead ends: 1339 [2018-12-03 02:55:45,839 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-03 02:55:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-12-03 02:55:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2018-12-03 02:55:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2018-12-03 02:55:45,873 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2018-12-03 02:55:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:45,874 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2018-12-03 02:55:45,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:55:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2018-12-03 02:55:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 02:55:45,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:45,875 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:45,875 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:45,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1393716788, now seen corresponding path program 1 times [2018-12-03 02:55:45,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:45,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:45,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:45,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:45,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:45,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:45,921 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2018-12-03 02:55:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:46,244 INFO L93 Difference]: Finished difference Result 2984 states and 4448 transitions. [2018-12-03 02:55:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:46,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-03 02:55:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:46,247 INFO L225 Difference]: With dead ends: 2984 [2018-12-03 02:55:46,247 INFO L226 Difference]: Without dead ends: 1672 [2018-12-03 02:55:46,248 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-03 02:55:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-12-03 02:55:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2018-12-03 02:55:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2018-12-03 02:55:46,286 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2018-12-03 02:55:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:46,286 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2018-12-03 02:55:46,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2018-12-03 02:55:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 02:55:46,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:46,287 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:46,287 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:46,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:46,287 INFO L82 PathProgramCache]: Analyzing trace with hash 547229759, now seen corresponding path program 1 times [2018-12-03 02:55:46,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:46,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:46,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:46,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:46,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:46,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:46,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:46,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:46,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:46,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:46,324 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2018-12-03 02:55:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:46,607 INFO L93 Difference]: Finished difference Result 2974 states and 4428 transitions. [2018-12-03 02:55:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:46,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-03 02:55:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:46,611 INFO L225 Difference]: With dead ends: 2974 [2018-12-03 02:55:46,611 INFO L226 Difference]: Without dead ends: 1662 [2018-12-03 02:55:46,612 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-03 02:55:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2018-12-03 02:55:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1337. [2018-12-03 02:55:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2018-12-03 02:55:46,649 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2018-12-03 02:55:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:46,649 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2018-12-03 02:55:46,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2018-12-03 02:55:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 02:55:46,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:46,650 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:46,650 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1110798656, now seen corresponding path program 1 times [2018-12-03 02:55:46,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:46,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:46,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:46,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:46,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:46,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:46,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:46,683 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2018-12-03 02:55:47,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:47,015 INFO L93 Difference]: Finished difference Result 2969 states and 4413 transitions. [2018-12-03 02:55:47,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:47,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-03 02:55:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:47,018 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 02:55:47,018 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 02:55:47,019 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-03 02:55:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 02:55:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-03 02:55:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2018-12-03 02:55:47,066 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2018-12-03 02:55:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:47,066 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2018-12-03 02:55:47,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2018-12-03 02:55:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 02:55:47,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:47,067 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:47,067 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:47,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1131603569, now seen corresponding path program 1 times [2018-12-03 02:55:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:47,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:47,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:47,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:47,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:47,102 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2018-12-03 02:55:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:47,369 INFO L93 Difference]: Finished difference Result 2969 states and 4403 transitions. [2018-12-03 02:55:47,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:47,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-03 02:55:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:47,372 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 02:55:47,372 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 02:55:47,373 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-03 02:55:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 02:55:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-03 02:55:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2018-12-03 02:55:47,412 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2018-12-03 02:55:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:47,412 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2018-12-03 02:55:47,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2018-12-03 02:55:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 02:55:47,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:47,413 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:47,413 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:47,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1771774716, now seen corresponding path program 1 times [2018-12-03 02:55:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:47,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:47,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:47,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:47,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:47,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:47,454 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2018-12-03 02:55:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:47,758 INFO L93 Difference]: Finished difference Result 2969 states and 4393 transitions. [2018-12-03 02:55:47,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:47,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-03 02:55:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:47,761 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 02:55:47,761 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 02:55:47,762 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-03 02:55:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 02:55:47,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-03 02:55:47,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2018-12-03 02:55:47,801 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2018-12-03 02:55:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:47,802 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2018-12-03 02:55:47,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2018-12-03 02:55:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 02:55:47,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:47,803 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:47,803 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:47,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1479525396, now seen corresponding path program 1 times [2018-12-03 02:55:47,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:47,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:47,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:47,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:47,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:47,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:47,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:47,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:47,846 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2018-12-03 02:55:48,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:48,123 INFO L93 Difference]: Finished difference Result 2969 states and 4383 transitions. [2018-12-03 02:55:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:48,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-03 02:55:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:48,127 INFO L225 Difference]: With dead ends: 2969 [2018-12-03 02:55:48,127 INFO L226 Difference]: Without dead ends: 1657 [2018-12-03 02:55:48,129 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-03 02:55:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-03 02:55:48,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-03 02:55:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2018-12-03 02:55:48,171 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2018-12-03 02:55:48,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:48,171 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2018-12-03 02:55:48,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:48,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2018-12-03 02:55:48,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 02:55:48,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:48,172 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:48,172 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:48,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash -812382953, now seen corresponding path program 1 times [2018-12-03 02:55:48,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:48,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:48,205 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:48,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:48,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:48,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:48,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:48,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:48,206 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2018-12-03 02:55:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:48,469 INFO L93 Difference]: Finished difference Result 2919 states and 4313 transitions. [2018-12-03 02:55:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:48,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-03 02:55:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:48,472 INFO L225 Difference]: With dead ends: 2919 [2018-12-03 02:55:48,472 INFO L226 Difference]: Without dead ends: 1607 [2018-12-03 02:55:48,473 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-03 02:55:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-03 02:55:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2018-12-03 02:55:48,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2018-12-03 02:55:48,515 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2018-12-03 02:55:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:48,515 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2018-12-03 02:55:48,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2018-12-03 02:55:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 02:55:48,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:48,516 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:48,517 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:48,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2057989827, now seen corresponding path program 1 times [2018-12-03 02:55:48,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:48,557 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:48,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:48,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:48,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:48,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:48,558 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2018-12-03 02:55:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:48,840 INFO L93 Difference]: Finished difference Result 2919 states and 4303 transitions. [2018-12-03 02:55:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:48,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-03 02:55:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:48,843 INFO L225 Difference]: With dead ends: 2919 [2018-12-03 02:55:48,843 INFO L226 Difference]: Without dead ends: 1607 [2018-12-03 02:55:48,844 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-03 02:55:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-03 02:55:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2018-12-03 02:55:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2018-12-03 02:55:48,887 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2018-12-03 02:55:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:48,887 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2018-12-03 02:55:48,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2018-12-03 02:55:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 02:55:48,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:48,888 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:48,888 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:48,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -88498670, now seen corresponding path program 1 times [2018-12-03 02:55:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:48,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:48,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:48,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:48,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:48,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:48,923 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2018-12-03 02:55:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:49,189 INFO L93 Difference]: Finished difference Result 2894 states and 4261 transitions. [2018-12-03 02:55:49,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:49,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-03 02:55:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:49,192 INFO L225 Difference]: With dead ends: 2894 [2018-12-03 02:55:49,192 INFO L226 Difference]: Without dead ends: 1582 [2018-12-03 02:55:49,193 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-03 02:55:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-03 02:55:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2018-12-03 02:55:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2018-12-03 02:55:49,238 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2018-12-03 02:55:49,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:49,238 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2018-12-03 02:55:49,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2018-12-03 02:55:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 02:55:49,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:49,239 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:49,239 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:49,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:49,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1557757070, now seen corresponding path program 1 times [2018-12-03 02:55:49,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:49,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:49,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:49,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:49,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:49,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:49,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:49,277 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2018-12-03 02:55:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:49,553 INFO L93 Difference]: Finished difference Result 2894 states and 4251 transitions. [2018-12-03 02:55:49,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:49,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-03 02:55:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:49,556 INFO L225 Difference]: With dead ends: 2894 [2018-12-03 02:55:49,556 INFO L226 Difference]: Without dead ends: 1582 [2018-12-03 02:55:49,557 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-03 02:55:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-03 02:55:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2018-12-03 02:55:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 02:55:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2018-12-03 02:55:49,602 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2018-12-03 02:55:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2018-12-03 02:55:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2018-12-03 02:55:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 02:55:49,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:49,603 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:49,604 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:49,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:49,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1693480643, now seen corresponding path program 1 times [2018-12-03 02:55:49,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:49,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:49,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:49,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:49,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:49,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:49,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:49,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:49,641 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2018-12-03 02:55:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:49,873 INFO L93 Difference]: Finished difference Result 2854 states and 4176 transitions. [2018-12-03 02:55:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:49,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-03 02:55:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:49,876 INFO L225 Difference]: With dead ends: 2854 [2018-12-03 02:55:49,876 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 02:55:49,877 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-03 02:55:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 02:55:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1317. [2018-12-03 02:55:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-03 02:55:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2018-12-03 02:55:49,924 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2018-12-03 02:55:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:49,924 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2018-12-03 02:55:49,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2018-12-03 02:55:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 02:55:49,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:49,925 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:49,925 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:49,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash -358853295, now seen corresponding path program 1 times [2018-12-03 02:55:49,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:49,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:49,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:49,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:49,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:49,966 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2018-12-03 02:55:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:50,223 INFO L93 Difference]: Finished difference Result 2834 states and 4136 transitions. [2018-12-03 02:55:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:50,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-03 02:55:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:50,226 INFO L225 Difference]: With dead ends: 2834 [2018-12-03 02:55:50,226 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 02:55:50,227 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-03 02:55:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 02:55:50,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2018-12-03 02:55:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-03 02:55:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2018-12-03 02:55:50,274 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2018-12-03 02:55:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:50,274 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2018-12-03 02:55:50,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2018-12-03 02:55:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 02:55:50,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:50,275 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:50,275 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:50,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:50,276 INFO L82 PathProgramCache]: Analyzing trace with hash -519508972, now seen corresponding path program 1 times [2018-12-03 02:55:50,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:50,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:50,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:50,318 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2018-12-03 02:55:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:50,575 INFO L93 Difference]: Finished difference Result 2859 states and 4166 transitions. [2018-12-03 02:55:50,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:50,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-03 02:55:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:50,577 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 02:55:50,577 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 02:55:50,578 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-03 02:55:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 02:55:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2018-12-03 02:55:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-03 02:55:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2018-12-03 02:55:50,625 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2018-12-03 02:55:50,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:50,626 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2018-12-03 02:55:50,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2018-12-03 02:55:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 02:55:50,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:50,627 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:50,627 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:50,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash -15622212, now seen corresponding path program 1 times [2018-12-03 02:55:50,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:50,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:50,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:50,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:50,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:50,671 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2018-12-03 02:55:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:50,901 INFO L93 Difference]: Finished difference Result 2849 states and 4146 transitions. [2018-12-03 02:55:50,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:50,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-03 02:55:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:50,902 INFO L225 Difference]: With dead ends: 2849 [2018-12-03 02:55:50,902 INFO L226 Difference]: Without dead ends: 1532 [2018-12-03 02:55:50,903 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-03 02:55:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-12-03 02:55:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2018-12-03 02:55:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-03 02:55:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2018-12-03 02:55:50,950 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2018-12-03 02:55:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:50,950 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2018-12-03 02:55:50,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2018-12-03 02:55:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 02:55:50,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:50,951 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:50,952 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1373847761, now seen corresponding path program 1 times [2018-12-03 02:55:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:50,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:50,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:50,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:50,987 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2018-12-03 02:55:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:51,217 INFO L93 Difference]: Finished difference Result 2839 states and 4126 transitions. [2018-12-03 02:55:51,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:51,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 02:55:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:51,218 INFO L225 Difference]: With dead ends: 2839 [2018-12-03 02:55:51,218 INFO L226 Difference]: Without dead ends: 1517 [2018-12-03 02:55:51,219 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-03 02:55:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-03 02:55:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2018-12-03 02:55:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-03 02:55:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1962 transitions. [2018-12-03 02:55:51,285 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1962 transitions. Word has length 156 [2018-12-03 02:55:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:51,285 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1962 transitions. [2018-12-03 02:55:51,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1962 transitions. [2018-12-03 02:55:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 02:55:51,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:51,286 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:51,286 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:51,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 775738825, now seen corresponding path program 1 times [2018-12-03 02:55:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:51,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:51,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:51,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:51,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:51,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:51,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:51,327 INFO L87 Difference]: Start difference. First operand 1352 states and 1962 transitions. Second operand 4 states. [2018-12-03 02:55:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:51,597 INFO L93 Difference]: Finished difference Result 2834 states and 4111 transitions. [2018-12-03 02:55:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:51,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 02:55:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:51,598 INFO L225 Difference]: With dead ends: 2834 [2018-12-03 02:55:51,598 INFO L226 Difference]: Without dead ends: 1507 [2018-12-03 02:55:51,599 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-03 02:55:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-12-03 02:55:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1352. [2018-12-03 02:55:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-03 02:55:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2018-12-03 02:55:51,654 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2018-12-03 02:55:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:51,655 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2018-12-03 02:55:51,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2018-12-03 02:55:51,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 02:55:51,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:51,655 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:51,656 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:51,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:51,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1787977568, now seen corresponding path program 1 times [2018-12-03 02:55:51,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:51,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:51,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:51,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:51,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:51,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:51,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:51,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:51,694 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2018-12-03 02:55:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:51,922 INFO L93 Difference]: Finished difference Result 2834 states and 4101 transitions. [2018-12-03 02:55:51,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:51,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-03 02:55:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:51,924 INFO L225 Difference]: With dead ends: 2834 [2018-12-03 02:55:51,924 INFO L226 Difference]: Without dead ends: 1507 [2018-12-03 02:55:51,925 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-03 02:55:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-12-03 02:55:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1357. [2018-12-03 02:55:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-12-03 02:55:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2018-12-03 02:55:51,974 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2018-12-03 02:55:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:51,974 INFO L480 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2018-12-03 02:55:51,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2018-12-03 02:55:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 02:55:51,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:51,975 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:51,975 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1281849680, now seen corresponding path program 1 times [2018-12-03 02:55:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:51,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:51,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:52,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:52,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:52,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:52,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:52,014 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2018-12-03 02:55:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:52,231 INFO L93 Difference]: Finished difference Result 2819 states and 4076 transitions. [2018-12-03 02:55:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:52,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 02:55:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:52,232 INFO L225 Difference]: With dead ends: 2819 [2018-12-03 02:55:52,232 INFO L226 Difference]: Without dead ends: 1487 [2018-12-03 02:55:52,233 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-03 02:55:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-03 02:55:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1362. [2018-12-03 02:55:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-03 02:55:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2018-12-03 02:55:52,285 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2018-12-03 02:55:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:52,285 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2018-12-03 02:55:52,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:52,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2018-12-03 02:55:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 02:55:52,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:52,287 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:52,287 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:52,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 97631154, now seen corresponding path program 1 times [2018-12-03 02:55:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:52,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:52,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:52,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:52,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:52,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:52,327 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2018-12-03 02:55:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:52,538 INFO L93 Difference]: Finished difference Result 2824 states and 4076 transitions. [2018-12-03 02:55:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:52,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 02:55:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:52,540 INFO L225 Difference]: With dead ends: 2824 [2018-12-03 02:55:52,540 INFO L226 Difference]: Without dead ends: 1487 [2018-12-03 02:55:52,541 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-03 02:55:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-03 02:55:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1367. [2018-12-03 02:55:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-12-03 02:55:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2018-12-03 02:55:52,591 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2018-12-03 02:55:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:52,591 INFO L480 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2018-12-03 02:55:52,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2018-12-03 02:55:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 02:55:52,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:52,592 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:52,593 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:52,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1346832834, now seen corresponding path program 1 times [2018-12-03 02:55:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:52,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:52,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:52,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:52,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:52,648 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2018-12-03 02:55:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:52,859 INFO L93 Difference]: Finished difference Result 2819 states and 4066 transitions. [2018-12-03 02:55:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:52,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-03 02:55:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:52,860 INFO L225 Difference]: With dead ends: 2819 [2018-12-03 02:55:52,861 INFO L226 Difference]: Without dead ends: 1477 [2018-12-03 02:55:52,862 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-03 02:55:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-03 02:55:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1372. [2018-12-03 02:55:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-03 02:55:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2018-12-03 02:55:52,913 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2018-12-03 02:55:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:52,913 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2018-12-03 02:55:52,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2018-12-03 02:55:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 02:55:52,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:52,914 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:52,914 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:52,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash 811220269, now seen corresponding path program 1 times [2018-12-03 02:55:52,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:52,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:52,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:52,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:52,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:52,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:52,953 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:52,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:52,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:52,954 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2018-12-03 02:55:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:53,189 INFO L93 Difference]: Finished difference Result 2824 states and 4066 transitions. [2018-12-03 02:55:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:53,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-03 02:55:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:53,190 INFO L225 Difference]: With dead ends: 2824 [2018-12-03 02:55:53,190 INFO L226 Difference]: Without dead ends: 1477 [2018-12-03 02:55:53,191 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-03 02:55:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-03 02:55:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1377. [2018-12-03 02:55:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-12-03 02:55:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2018-12-03 02:55:53,243 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2018-12-03 02:55:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:53,243 INFO L480 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2018-12-03 02:55:53,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2018-12-03 02:55:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 02:55:53,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:53,244 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:53,244 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:53,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash 627757725, now seen corresponding path program 1 times [2018-12-03 02:55:53,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:53,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:53,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:53,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:55:53,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:55:53,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:55:53,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:55:53,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:55:53,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:55:53,283 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2018-12-03 02:55:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:55:53,486 INFO L93 Difference]: Finished difference Result 2819 states and 4056 transitions. [2018-12-03 02:55:53,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:55:53,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-03 02:55:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:55:53,488 INFO L225 Difference]: With dead ends: 2819 [2018-12-03 02:55:53,488 INFO L226 Difference]: Without dead ends: 1467 [2018-12-03 02:55:53,489 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-03 02:55:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-12-03 02:55:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2018-12-03 02:55:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-03 02:55:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2018-12-03 02:55:53,541 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2018-12-03 02:55:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:55:53,542 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2018-12-03 02:55:53,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:55:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2018-12-03 02:55:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 02:55:53,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:55:53,543 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:55:53,543 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:55:53,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1878575972, now seen corresponding path program 1 times [2018-12-03 02:55:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:55:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:55:53,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:55:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:53,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:55:53,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 02:55:53,917 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-03 02:55:53,918 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [489], [492], [508], [513], [516], [534], [539], [541], [544], [552], [555], [559], [580], [614], [616], [628], [631], [632], [633], [635] [2018-12-03 02:55:53,943 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 02:55:53,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 02:55:54,339 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 02:55:54,340 INFO L272 AbstractInterpreter]: Visited 76 different actions 236 times. Merged at 54 different actions 148 times. Never widened. Performed 1899 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1899 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 7 different actions. Largest state had 118 variables. [2018-12-03 02:55:54,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:55:54,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 02:55:54,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 02:55:54,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 02:55:54,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:55:54,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 02:55:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:55:54,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 02:55:54,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-03 02:55:54,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-03 02:55:54,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-03 02:55:54,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-03 02:55:54,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-03 02:55:54,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 02:55:54,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-03 02:55:54,604 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,627 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-03 02:55:54,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:54,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:54,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:54,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:54,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-03 02:55:54,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-03 02:55:54,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-03 02:55:54,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-03 02:55:54,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,817 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-03 02:55:54,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:54,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,838 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:54,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 02:55:54,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:54,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:54,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 02:55:54,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:54,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:54,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:54,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:54,941 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,954 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 02:55:54,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:54,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:54,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:54,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:54,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 02:55:55,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 02:55:55,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 02:55:55,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 02:55:55,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-03 02:55:55,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-03 02:55:55,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-12-03 02:55:55,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-03 02:55:55,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-03 02:55:55,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 02:55:55,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 02:55:55,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 02:55:55,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 02:55:55,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-03 02:55:55,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 02:55:55,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 02:55:55,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 02:55:55,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 02:55:55,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-03 02:55:55,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-03 02:55:55,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-03 02:55:55,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2018-12-03 02:55:55,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 02:55:55,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2018-12-03 02:55:55,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-03 02:55:55,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 02:55:55,349 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,352 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,355 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-03 02:55:55,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 02:55:55,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 02:55:55,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-03 02:55:55,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-03 02:55:55,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 02:55:55,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 02:55:55,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 02:55:55,427 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:55,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-03 02:55:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:55,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 02:55:55,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-03 02:55:55,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-03 02:55:55,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:55,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-03 02:55:56,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-03 02:55:56,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 02:55:56,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:56,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-03 02:55:56,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 02:55:56,401 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 02:55:56,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:56,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 02:55:56,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,412 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-03 02:55:56,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,453 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-03 02:55:56,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-03 02:55:56,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 02:55:56,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-12-03 02:55:56,479 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2018-12-03 02:55:56,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-03 02:55:56,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-03 02:55:56,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2018-12-03 02:55:56,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-03 02:55:56,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-03 02:55:56,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-03 02:55:56,817 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:110, output treesize:154 [2018-12-03 02:55:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 02:55:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 02:55:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2018-12-03 02:55:57,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 02:55:57,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 02:55:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 02:55:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-12-03 02:55:57,015 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 17 states. [2018-12-03 02:56:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:01,092 INFO L93 Difference]: Finished difference Result 4598 states and 6733 transitions. [2018-12-03 02:56:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 02:56:01,093 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 170 [2018-12-03 02:56:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:01,097 INFO L225 Difference]: With dead ends: 4598 [2018-12-03 02:56:01,097 INFO L226 Difference]: Without dead ends: 3241 [2018-12-03 02:56:01,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 319 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 02:56:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2018-12-03 02:56:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 1542. [2018-12-03 02:56:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-03 02:56:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2272 transitions. [2018-12-03 02:56:01,191 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2272 transitions. Word has length 170 [2018-12-03 02:56:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:01,192 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2272 transitions. [2018-12-03 02:56:01,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 02:56:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2272 transitions. [2018-12-03 02:56:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 02:56:01,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:01,193 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:01,194 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:01,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 548636406, now seen corresponding path program 1 times [2018-12-03 02:56:01,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:01,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:01,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:01,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 02:56:01,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:01,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:01,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:01,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:01,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:01,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:01,260 INFO L87 Difference]: Start difference. First operand 1542 states and 2272 transitions. Second operand 4 states. [2018-12-03 02:56:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:01,551 INFO L93 Difference]: Finished difference Result 3144 states and 4626 transitions. [2018-12-03 02:56:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:01,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-03 02:56:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:01,554 INFO L225 Difference]: With dead ends: 3144 [2018-12-03 02:56:01,555 INFO L226 Difference]: Without dead ends: 1627 [2018-12-03 02:56:01,556 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-03 02:56:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-12-03 02:56:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1542. [2018-12-03 02:56:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-03 02:56:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2267 transitions. [2018-12-03 02:56:01,637 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2267 transitions. Word has length 171 [2018-12-03 02:56:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:01,637 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2267 transitions. [2018-12-03 02:56:01,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2267 transitions. [2018-12-03 02:56:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 02:56:01,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:01,640 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:01,640 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:01,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2015859349, now seen corresponding path program 1 times [2018-12-03 02:56:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:01,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:01,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 02:56:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:01,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:01,688 INFO L87 Difference]: Start difference. First operand 1542 states and 2267 transitions. Second operand 4 states. [2018-12-03 02:56:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:01,940 INFO L93 Difference]: Finished difference Result 3124 states and 4589 transitions. [2018-12-03 02:56:01,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:01,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-03 02:56:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:01,943 INFO L225 Difference]: With dead ends: 3124 [2018-12-03 02:56:01,943 INFO L226 Difference]: Without dead ends: 1607 [2018-12-03 02:56:01,955 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-03 02:56:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-03 02:56:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1542. [2018-12-03 02:56:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-03 02:56:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2262 transitions. [2018-12-03 02:56:02,036 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2262 transitions. Word has length 172 [2018-12-03 02:56:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:02,036 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2262 transitions. [2018-12-03 02:56:02,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2262 transitions. [2018-12-03 02:56:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 02:56:02,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:02,038 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:02,038 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:02,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 79781090, now seen corresponding path program 1 times [2018-12-03 02:56:02,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:02,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-03 02:56:02,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:02,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:02,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:02,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:02,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:02,095 INFO L87 Difference]: Start difference. First operand 1542 states and 2262 transitions. Second operand 4 states. [2018-12-03 02:56:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:02,463 INFO L93 Difference]: Finished difference Result 3561 states and 5255 transitions. [2018-12-03 02:56:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:02,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-03 02:56:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:02,465 INFO L225 Difference]: With dead ends: 3561 [2018-12-03 02:56:02,466 INFO L226 Difference]: Without dead ends: 2044 [2018-12-03 02:56:02,467 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-03 02:56:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-12-03 02:56:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1737. [2018-12-03 02:56:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-03 02:56:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2617 transitions. [2018-12-03 02:56:02,544 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2617 transitions. Word has length 184 [2018-12-03 02:56:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:02,544 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 2617 transitions. [2018-12-03 02:56:02,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2617 transitions. [2018-12-03 02:56:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 02:56:02,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:02,547 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:02,547 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:02,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash -615129969, now seen corresponding path program 1 times [2018-12-03 02:56:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:02,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-03 02:56:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:02,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:02,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:02,621 INFO L87 Difference]: Start difference. First operand 1737 states and 2617 transitions. Second operand 5 states. [2018-12-03 02:56:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:03,019 INFO L93 Difference]: Finished difference Result 4186 states and 6365 transitions. [2018-12-03 02:56:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:03,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-03 02:56:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:03,022 INFO L225 Difference]: With dead ends: 4186 [2018-12-03 02:56:03,022 INFO L226 Difference]: Without dead ends: 2474 [2018-12-03 02:56:03,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:56:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-03 02:56:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1737. [2018-12-03 02:56:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-03 02:56:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2617 transitions. [2018-12-03 02:56:03,101 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2617 transitions. Word has length 185 [2018-12-03 02:56:03,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:03,101 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 2617 transitions. [2018-12-03 02:56:03,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2617 transitions. [2018-12-03 02:56:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 02:56:03,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:03,103 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:03,103 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:03,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1828760862, now seen corresponding path program 1 times [2018-12-03 02:56:03,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:03,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:03,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:03,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:03,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-03 02:56:03,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:03,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:03,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:03,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:03,156 INFO L87 Difference]: Start difference. First operand 1737 states and 2617 transitions. Second operand 4 states. [2018-12-03 02:56:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:03,540 INFO L93 Difference]: Finished difference Result 3929 states and 5933 transitions. [2018-12-03 02:56:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:03,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-03 02:56:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:03,542 INFO L225 Difference]: With dead ends: 3929 [2018-12-03 02:56:03,542 INFO L226 Difference]: Without dead ends: 2217 [2018-12-03 02:56:03,544 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-03 02:56:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-12-03 02:56:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1882. [2018-12-03 02:56:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2018-12-03 02:56:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2877 transitions. [2018-12-03 02:56:03,625 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2877 transitions. Word has length 185 [2018-12-03 02:56:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:03,625 INFO L480 AbstractCegarLoop]: Abstraction has 1882 states and 2877 transitions. [2018-12-03 02:56:03,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2877 transitions. [2018-12-03 02:56:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 02:56:03,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:03,626 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:03,626 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:03,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1896167211, now seen corresponding path program 1 times [2018-12-03 02:56:03,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:03,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:03,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-03 02:56:03,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:03,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:56:03,693 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:03,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:56:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:56:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:56:03,694 INFO L87 Difference]: Start difference. First operand 1882 states and 2877 transitions. Second operand 5 states. [2018-12-03 02:56:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:04,094 INFO L93 Difference]: Finished difference Result 4256 states and 6515 transitions. [2018-12-03 02:56:04,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:04,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-03 02:56:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:04,096 INFO L225 Difference]: With dead ends: 4256 [2018-12-03 02:56:04,096 INFO L226 Difference]: Without dead ends: 2399 [2018-12-03 02:56:04,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:56:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2018-12-03 02:56:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1827. [2018-12-03 02:56:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-03 02:56:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2802 transitions. [2018-12-03 02:56:04,178 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2802 transitions. Word has length 186 [2018-12-03 02:56:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:04,178 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2802 transitions. [2018-12-03 02:56:04,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:56:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2802 transitions. [2018-12-03 02:56:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 02:56:04,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:04,179 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:04,179 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:04,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:04,180 INFO L82 PathProgramCache]: Analyzing trace with hash -682214875, now seen corresponding path program 1 times [2018-12-03 02:56:04,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:04,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:04,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 02:56:04,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:04,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:04,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:04,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:04,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:04,221 INFO L87 Difference]: Start difference. First operand 1827 states and 2802 transitions. Second operand 4 states. [2018-12-03 02:56:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:04,456 INFO L93 Difference]: Finished difference Result 3694 states and 5659 transitions. [2018-12-03 02:56:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:04,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-03 02:56:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:04,458 INFO L225 Difference]: With dead ends: 3694 [2018-12-03 02:56:04,458 INFO L226 Difference]: Without dead ends: 1892 [2018-12-03 02:56:04,459 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-03 02:56:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-03 02:56:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1827. [2018-12-03 02:56:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-03 02:56:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2797 transitions. [2018-12-03 02:56:04,539 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2797 transitions. Word has length 195 [2018-12-03 02:56:04,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:04,539 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2797 transitions. [2018-12-03 02:56:04,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2797 transitions. [2018-12-03 02:56:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 02:56:04,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:04,541 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:04,541 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:04,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1577878837, now seen corresponding path program 1 times [2018-12-03 02:56:04,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 02:56:04,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:04,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:04,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:04,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:04,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:04,597 INFO L87 Difference]: Start difference. First operand 1827 states and 2797 transitions. Second operand 4 states. [2018-12-03 02:56:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:04,858 INFO L93 Difference]: Finished difference Result 3694 states and 5649 transitions. [2018-12-03 02:56:04,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:04,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-03 02:56:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:04,861 INFO L225 Difference]: With dead ends: 3694 [2018-12-03 02:56:04,861 INFO L226 Difference]: Without dead ends: 1892 [2018-12-03 02:56:04,863 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-03 02:56:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-03 02:56:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1827. [2018-12-03 02:56:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-03 02:56:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2792 transitions. [2018-12-03 02:56:04,945 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2792 transitions. Word has length 196 [2018-12-03 02:56:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:04,945 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2792 transitions. [2018-12-03 02:56:04,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2792 transitions. [2018-12-03 02:56:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 02:56:04,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:04,947 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:04,947 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:04,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1444910848, now seen corresponding path program 1 times [2018-12-03 02:56:04,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:04,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:04,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:04,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:56:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 02:56:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:56:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:56:04,990 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:56:04,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:56:04,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:56:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:56:04,991 INFO L87 Difference]: Start difference. First operand 1827 states and 2792 transitions. Second operand 4 states. [2018-12-03 02:56:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:56:05,218 INFO L93 Difference]: Finished difference Result 3679 states and 5622 transitions. [2018-12-03 02:56:05,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:56:05,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-03 02:56:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:56:05,219 INFO L225 Difference]: With dead ends: 3679 [2018-12-03 02:56:05,219 INFO L226 Difference]: Without dead ends: 1877 [2018-12-03 02:56:05,221 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-03 02:56:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2018-12-03 02:56:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1827. [2018-12-03 02:56:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-03 02:56:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2787 transitions. [2018-12-03 02:56:05,301 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2787 transitions. Word has length 197 [2018-12-03 02:56:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:56:05,301 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2787 transitions. [2018-12-03 02:56:05,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:56:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2787 transitions. [2018-12-03 02:56:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 02:56:05,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:56:05,302 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 02:56:05,303 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:56:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:56:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash 844081357, now seen corresponding path program 1 times [2018-12-03 02:56:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:56:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:56:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:56:05,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:56:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:56:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:56:05,461 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:56:05,503 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24589 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 02:56:05,504 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24592 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 02:56:05,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:56:05 BoogieIcfgContainer [2018-12-03 02:56:05,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:56:05,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:56:05,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:56:05,556 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:56:05,556 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:55:36" (3/4) ... [2018-12-03 02:56:05,559 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 02:56:05,559 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:56:05,559 INFO L168 Benchmark]: Toolchain (without parser) took 30593.02 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 820.0 MB). Free memory was 951.3 MB in the beginning and 1.8 GB in the end (delta: -802.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: Boogie Preprocessor took 65.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: RCFGBuilder took 606.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,560 INFO L168 Benchmark]: TraceAbstraction took 29500.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -742.0 MB). Peak memory consumption was 867.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:05,561 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.8 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:56:05,561 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.4 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 606.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.0 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29500.73 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -742.0 MB). Peak memory consumption was 867.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.8 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24589 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24592 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24610, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24591:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={24598:0}, malloc(sizeof(SSL_CTX))={24613:0}, malloc(sizeof(SSL_SESSION))={24579:0}, malloc(sizeof(struct ssl3_state_st))={24604:0}, s={24598:0}, SSLv3_server_data={24591:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24598:0}, SSLv3_server_data={24591:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->hit=1, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->hit=1, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1726] __VERIFIER_error() VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 29.4s OverallTime, 76 OverallIterations, 7 TraceHistogramMax, 20.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17158 SDtfs, 5656 SDslu, 26609 SDs, 0 SdLazy, 17616 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 467 SyntacticMatches, 113 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1882occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 75 MinimizatonAttempts, 10281 StatesRemovedByMinimization, 74 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 9160 NumberOfCodeBlocks, 9160 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 9054 ConstructedInterpolants, 206 QuantifiedInterpolants, 6311643 SizeOfPredicates, 17 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 77 InterpolantComputations, 74 PerfectInterpolantSequences, 8517/8919 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:56:06,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:56:06,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:56:06,902 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:56:06,902 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:56:06,903 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:56:06,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:56:06,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:56:06,906 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:56:06,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:56:06,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:56:06,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:56:06,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:56:06,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:56:06,909 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:56:06,909 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:56:06,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:56:06,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:56:06,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:56:06,914 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:56:06,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:56:06,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:56:06,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:56:06,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:56:06,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:56:06,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:56:06,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:56:06,919 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:56:06,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:56:06,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:56:06,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:56:06,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:56:06,921 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:56:06,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:56:06,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:56:06,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:56:06,922 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 02:56:06,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:56:06,933 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:56:06,933 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:56:06,933 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:56:06,933 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:56:06,933 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:56:06,933 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:56:06,933 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:56:06,934 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:56:06,934 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:56:06,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:56:06,934 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:56:06,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:56:06,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 02:56:06,935 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:56:06,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:56:06,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:56:06,936 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 02:56:06,937 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 02:56:06,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_ecc1e72b-d160-4c8f-841b-e2573b987ba7/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-12-03 02:56:06,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:56:06,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:56:06,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:56:06,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:56:06,974 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:56:06,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-03 02:56:07,019 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/d8e577078/1f253f3dbbad480396d661c062e866d3/FLAG646ddb72e [2018-12-03 02:56:07,468 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:56:07,469 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-03 02:56:07,481 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/d8e577078/1f253f3dbbad480396d661c062e866d3/FLAG646ddb72e [2018-12-03 02:56:07,489 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ecc1e72b-d160-4c8f-841b-e2573b987ba7/bin-2019/utaipan/data/d8e577078/1f253f3dbbad480396d661c062e866d3 [2018-12-03 02:56:07,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:56:07,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:56:07,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:56:07,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:56:07,494 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:56:07,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:56:07" (1/1) ... [2018-12-03 02:56:07,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:56:07, skipping insertion in model container [2018-12-03 02:56:07,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:56:07" (1/1) ... [2018-12-03 02:56:07,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:56:07,533 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:56:07,755 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:56:07,767 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:56:07,869 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:56:07,870 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 02:56:07,872 INFO L168 Benchmark]: Toolchain (without parser) took 381.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:07,873 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:56:07,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-12-03 02:56:07,874 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...