./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_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_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/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 c3873739663157ae1e04c3d1b08afe34dba22bef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/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 c3873739663157ae1e04c3d1b08afe34dba22bef ............................................................................................................................................................... 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-02 05:53:03,950 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:53:03,951 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:53:03,957 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:53:03,957 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:53:03,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:53:03,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:53:03,959 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:53:03,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:53:03,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:53:03,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:53:03,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:53:03,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:53:03,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:53:03,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:53:03,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:53:03,962 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:53:03,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:53:03,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:53:03,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:53:03,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:53:03,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:53:03,967 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:53:03,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:53:03,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:53:03,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:53:03,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:53:03,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:53:03,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:53:03,969 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:53:03,969 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:53:03,969 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:53:03,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:53:03,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:53:03,970 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:53:03,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:53:03,971 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:53:03,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:53:03,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:53:03,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:53:03,978 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:53:03,978 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:53:03,978 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:53:03,978 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:53:03,978 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:53:03,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:53:03,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:53:03,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:53:03,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:53:03,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:53:03,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:53:03,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:53:03,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:53:03,982 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_a4410854-d992-41ee-804c-19dbd3efb0ae/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 -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-12-02 05:53:03,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:53:04,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:53:04,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:53:04,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:53:04,008 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:53:04,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-12-02 05:53:04,043 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/5ec2e051f/762b6a2323fe4a199c23eae2ccfda845/FLAG2e516f317 [2018-12-02 05:53:04,453 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:53:04,454 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-12-02 05:53:04,462 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/5ec2e051f/762b6a2323fe4a199c23eae2ccfda845/FLAG2e516f317 [2018-12-02 05:53:04,786 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/5ec2e051f/762b6a2323fe4a199c23eae2ccfda845 [2018-12-02 05:53:04,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:53:04,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:53:04,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:53:04,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:53:04,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:53:04,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:53:04" (1/1) ... [2018-12-02 05:53:04,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507bca52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:04, skipping insertion in model container [2018-12-02 05:53:04,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:53:04" (1/1) ... [2018-12-02 05:53:04,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:53:04,822 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:53:05,073 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:53:05,082 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:53:05,152 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:53:05,163 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:53:05,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05 WrapperNode [2018-12-02 05:53:05,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:53:05,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:53:05,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:53:05,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:53:05,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:53:05,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:53:05,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:53:05,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:53:05,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... [2018-12-02 05:53:05,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:53:05,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:53:05,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:53:05,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:53:05,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:53:05,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:53:05,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 05:53:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 05:53:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 05:53:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 05:53:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:53:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:53:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:53:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:53:05,454 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 05:53:05,454 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 05:53:05,815 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:53:05,815 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 05:53:05,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:53:05 BoogieIcfgContainer [2018-12-02 05:53:05,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:53:05,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:53:05,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:53:05,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:53:05,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:53:04" (1/3) ... [2018-12-02 05:53:05,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c9fc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:53:05, skipping insertion in model container [2018-12-02 05:53:05,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:05" (2/3) ... [2018-12-02 05:53:05,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c9fc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:53:05, skipping insertion in model container [2018-12-02 05:53:05,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:53:05" (3/3) ... [2018-12-02 05:53:05,820 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-12-02 05:53:05,826 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:53:05,831 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:53:05,841 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:53:05,860 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:53:05,860 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:53:05,860 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:53:05,860 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:53:05,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:53:05,860 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:53:05,860 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:53:05,860 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:53:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-02 05:53:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 05:53:05,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:05,878 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-02 05:53:05,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:05,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:05,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1546919168, now seen corresponding path program 1 times [2018-12-02 05:53:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:05,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:05,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:53:06,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:06,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:06,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:06,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:06,096 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-02 05:53:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:06,351 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-02 05:53:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:06,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-02 05:53:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:06,362 INFO L225 Difference]: With dead ends: 333 [2018-12-02 05:53:06,363 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 05:53:06,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 05:53:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 05:53:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 05:53:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-02 05:53:06,397 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-02 05:53:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:06,397 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-02 05:53:06,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:06,397 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-02 05:53:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 05:53:06,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:06,399 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-02 05:53:06,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:06,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1039083406, now seen corresponding path program 1 times [2018-12-02 05:53:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:06,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:06,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:06,484 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-02 05:53:06,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:06,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:06,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:06,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:06,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:06,486 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-02 05:53:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:06,661 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-02 05:53:06,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:06,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 05:53:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:06,662 INFO L225 Difference]: With dead ends: 296 [2018-12-02 05:53:06,662 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 05:53:06,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 05:53:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 05:53:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 05:53:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-02 05:53:06,669 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-02 05:53:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:06,670 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-02 05:53:06,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-02 05:53:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:53:06,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:06,671 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-02 05:53:06,671 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:06,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -7342962, now seen corresponding path program 1 times [2018-12-02 05:53:06,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:06,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:06,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:06,724 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-02 05:53:06,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:06,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:53:06,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:06,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:53:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:53:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:06,726 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-02 05:53:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:06,996 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-02 05:53:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:53:06,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 05:53:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:06,997 INFO L225 Difference]: With dead ends: 300 [2018-12-02 05:53:06,997 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 05:53:06,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:53:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 05:53:07,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-02 05:53:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:07,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-02 05:53:07,007 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-02 05:53:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,007 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-02 05:53:07,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:53:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-02 05:53:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:53:07,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,008 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-02 05:53:07,009 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1814299397, now seen corresponding path program 1 times [2018-12-02 05:53:07,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,061 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-02 05:53:07,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,062 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-02 05:53:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:07,198 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-02 05:53:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:07,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 05:53:07,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:07,199 INFO L225 Difference]: With dead ends: 333 [2018-12-02 05:53:07,199 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 05:53:07,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 05:53:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-02 05:53:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-02 05:53:07,208 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-02 05:53:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,209 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-02 05:53:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-02 05:53:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 05:53:07,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,210 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-02 05:53:07,210 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash 170767942, now seen corresponding path program 1 times [2018-12-02 05:53:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,259 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-02 05:53:07,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,260 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-02 05:53:07,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:07,389 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-02 05:53:07,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:07,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 05:53:07,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:07,390 INFO L225 Difference]: With dead ends: 332 [2018-12-02 05:53:07,390 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 05:53:07,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 05:53:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 05:53:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-02 05:53:07,395 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-02 05:53:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,396 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-02 05:53:07,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-02 05:53:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 05:53:07,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,396 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-02 05:53:07,397 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1692923025, now seen corresponding path program 1 times [2018-12-02 05:53:07,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,433 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-02 05:53:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,434 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-02 05:53:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:07,568 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-02 05:53:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:07,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 05:53:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:07,570 INFO L225 Difference]: With dead ends: 332 [2018-12-02 05:53:07,570 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 05:53:07,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 05:53:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 05:53:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-02 05:53:07,574 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-02 05:53:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,574 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-02 05:53:07,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-02 05:53:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 05:53:07,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,575 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-02 05:53:07,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1847214462, now seen corresponding path program 1 times [2018-12-02 05:53:07,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,604 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-02 05:53:07,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,605 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-02 05:53:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:07,745 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-02 05:53:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:07,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-02 05:53:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:07,746 INFO L225 Difference]: With dead ends: 332 [2018-12-02 05:53:07,746 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 05:53:07,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 05:53:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 05:53:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 05:53:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-02 05:53:07,750 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-02 05:53:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,750 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-02 05:53:07,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-02 05:53:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:53:07,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,751 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-02 05:53:07,751 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1649145975, now seen corresponding path program 1 times [2018-12-02 05:53:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,789 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-02 05:53:07,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,790 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-02 05:53:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:07,956 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-02 05:53:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:07,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 05:53:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:07,957 INFO L225 Difference]: With dead ends: 361 [2018-12-02 05:53:07,957 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 05:53:07,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 05:53:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 05:53:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-02 05:53:07,961 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-02 05:53:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:07,961 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-02 05:53:07,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-02 05:53:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 05:53:07,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:07,962 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-02 05:53:07,962 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:07,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:07,962 INFO L82 PathProgramCache]: Analyzing trace with hash 677650986, now seen corresponding path program 1 times [2018-12-02 05:53:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:07,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:07,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:07,991 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-02 05:53:07,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:07,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:07,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:07,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:07,992 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-02 05:53:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:08,138 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-02 05:53:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:08,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 05:53:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:08,139 INFO L225 Difference]: With dead ends: 376 [2018-12-02 05:53:08,139 INFO L226 Difference]: Without dead ends: 207 [2018-12-02 05:53:08,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-02 05:53:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-02 05:53:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:08,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-02 05:53:08,144 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-02 05:53:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:08,144 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-02 05:53:08,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-02 05:53:08,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 05:53:08,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:08,145 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-02 05:53:08,145 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:08,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:08,145 INFO L82 PathProgramCache]: Analyzing trace with hash 357033949, now seen corresponding path program 1 times [2018-12-02 05:53:08,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:08,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:08,178 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-02 05:53:08,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:08,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:08,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:08,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:08,179 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-02 05:53:08,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:08,315 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-02 05:53:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:08,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 05:53:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:08,316 INFO L225 Difference]: With dead ends: 366 [2018-12-02 05:53:08,316 INFO L226 Difference]: Without dead ends: 197 [2018-12-02 05:53:08,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-02 05:53:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-02 05:53:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-02 05:53:08,320 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-02 05:53:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:08,320 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-02 05:53:08,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-02 05:53:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 05:53:08,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:08,321 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-02 05:53:08,321 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:08,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1058138999, now seen corresponding path program 1 times [2018-12-02 05:53:08,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:08,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:08,352 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-02 05:53:08,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:08,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:08,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:08,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:08,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:08,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:08,353 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-02 05:53:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:08,511 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-02 05:53:08,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:08,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-02 05:53:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:08,512 INFO L225 Difference]: With dead ends: 383 [2018-12-02 05:53:08,512 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 05:53:08,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 05:53:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 05:53:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-02 05:53:08,517 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-02 05:53:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:08,517 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-02 05:53:08,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-02 05:53:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:53:08,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:08,517 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-02 05:53:08,518 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:08,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1223576014, now seen corresponding path program 1 times [2018-12-02 05:53:08,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:08,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:08,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:08,547 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-02 05:53:08,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:08,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:08,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:08,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:08,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:08,548 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-02 05:53:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:08,720 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-02 05:53:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:08,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 05:53:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:08,721 INFO L225 Difference]: With dead ends: 381 [2018-12-02 05:53:08,721 INFO L226 Difference]: Without dead ends: 212 [2018-12-02 05:53:08,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:08,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-02 05:53:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-02 05:53:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-02 05:53:08,725 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-02 05:53:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:08,725 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-02 05:53:08,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:08,725 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-02 05:53:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 05:53:08,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:08,725 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-02 05:53:08,725 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:08,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:08,726 INFO L82 PathProgramCache]: Analyzing trace with hash -419955441, now seen corresponding path program 1 times [2018-12-02 05:53:08,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:08,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:08,752 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-02 05:53:08,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:08,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:08,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:08,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:08,753 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-02 05:53:08,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:08,926 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-02 05:53:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:08,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 05:53:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:08,927 INFO L225 Difference]: With dead ends: 380 [2018-12-02 05:53:08,927 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 05:53:08,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 05:53:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 05:53:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-02 05:53:08,932 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-02 05:53:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-02 05:53:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-02 05:53:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 05:53:08,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:08,933 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-02 05:53:08,933 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:08,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:08,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1469488582, now seen corresponding path program 1 times [2018-12-02 05:53:08,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:08,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:08,982 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-02 05:53:08,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:08,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:08,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:08,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:08,983 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-02 05:53:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:09,150 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-02 05:53:09,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:09,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-02 05:53:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:09,151 INFO L225 Difference]: With dead ends: 380 [2018-12-02 05:53:09,151 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 05:53:09,151 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-02 05:53:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 05:53:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 05:53:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-02 05:53:09,156 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-02 05:53:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:09,156 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-02 05:53:09,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-02 05:53:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 05:53:09,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:09,157 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-02 05:53:09,157 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:09,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1698264843, now seen corresponding path program 1 times [2018-12-02 05:53:09,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:09,205 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-02 05:53:09,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:09,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:09,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:09,206 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-02 05:53:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:09,371 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-02 05:53:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:09,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 05:53:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:09,372 INFO L225 Difference]: With dead ends: 380 [2018-12-02 05:53:09,372 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 05:53:09,373 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-02 05:53:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 05:53:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 05:53:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-02 05:53:09,377 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-02 05:53:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:09,377 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-02 05:53:09,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-02 05:53:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 05:53:09,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:09,377 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-02 05:53:09,377 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:09,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1081640255, now seen corresponding path program 1 times [2018-12-02 05:53:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:09,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:09,404 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-02 05:53:09,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:09,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:09,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:09,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:09,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:09,405 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-02 05:53:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:09,568 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-02 05:53:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:09,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-02 05:53:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:09,569 INFO L225 Difference]: With dead ends: 380 [2018-12-02 05:53:09,569 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 05:53:09,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 05:53:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 05:53:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:09,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-02 05:53:09,576 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-02 05:53:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:09,576 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-02 05:53:09,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-02 05:53:09,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 05:53:09,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:09,577 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-02 05:53:09,577 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:09,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:09,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1653580326, now seen corresponding path program 1 times [2018-12-02 05:53:09,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:09,625 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-02 05:53:09,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:09,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:09,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:09,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:09,626 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-02 05:53:09,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:09,781 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-02 05:53:09,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:09,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 05:53:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:09,782 INFO L225 Difference]: With dead ends: 370 [2018-12-02 05:53:09,782 INFO L226 Difference]: Without dead ends: 201 [2018-12-02 05:53:09,782 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-02 05:53:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-02 05:53:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-02 05:53:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 05:53:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-02 05:53:09,787 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-02 05:53:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:09,788 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-02 05:53:09,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-02 05:53:09,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 05:53:09,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:09,789 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-02 05:53:09,789 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:09,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:09,789 INFO L82 PathProgramCache]: Analyzing trace with hash -586078850, now seen corresponding path program 1 times [2018-12-02 05:53:09,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:09,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:09,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:09,841 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-02 05:53:09,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:09,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:09,841 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:09,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:09,842 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-02 05:53:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:10,100 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-02 05:53:10,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:10,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 05:53:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:10,102 INFO L225 Difference]: With dead ends: 469 [2018-12-02 05:53:10,102 INFO L226 Difference]: Without dead ends: 300 [2018-12-02 05:53:10,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-02 05:53:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-12-02 05:53:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-02 05:53:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-02 05:53:10,107 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-02 05:53:10,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:10,108 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-02 05:53:10,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-02 05:53:10,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 05:53:10,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:10,109 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-02 05:53:10,109 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:10,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:10,109 INFO L82 PathProgramCache]: Analyzing trace with hash -658465408, now seen corresponding path program 1 times [2018-12-02 05:53:10,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:10,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:10,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:10,145 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-02 05:53:10,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:10,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:10,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:10,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:10,146 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-02 05:53:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:10,338 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-02 05:53:10,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:10,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 05:53:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:10,339 INFO L225 Difference]: With dead ends: 472 [2018-12-02 05:53:10,339 INFO L226 Difference]: Without dead ends: 273 [2018-12-02 05:53:10,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-02 05:53:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-02 05:53:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-02 05:53:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-02 05:53:10,345 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-02 05:53:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:10,345 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-02 05:53:10,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-02 05:53:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 05:53:10,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:10,346 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-02 05:53:10,346 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:10,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:10,346 INFO L82 PathProgramCache]: Analyzing trace with hash -407391601, now seen corresponding path program 1 times [2018-12-02 05:53:10,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:10,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:10,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:10,386 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-02 05:53:10,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:10,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:10,386 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:10,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:10,387 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-02 05:53:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:10,593 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-02 05:53:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:10,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 05:53:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:10,594 INFO L225 Difference]: With dead ends: 539 [2018-12-02 05:53:10,594 INFO L226 Difference]: Without dead ends: 316 [2018-12-02 05:53:10,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-02 05:53:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-12-02 05:53:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 05:53:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-02 05:53:10,603 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-02 05:53:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:10,603 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-02 05:53:10,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-02 05:53:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 05:53:10,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:10,604 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-02 05:53:10,604 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:10,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:10,604 INFO L82 PathProgramCache]: Analyzing trace with hash 454550748, now seen corresponding path program 1 times [2018-12-02 05:53:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:10,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:10,640 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-02 05:53:10,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:10,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:10,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:10,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:10,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:10,641 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-02 05:53:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:10,873 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-12-02 05:53:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:10,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-02 05:53:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:10,875 INFO L225 Difference]: With dead ends: 540 [2018-12-02 05:53:10,875 INFO L226 Difference]: Without dead ends: 316 [2018-12-02 05:53:10,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-02 05:53:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-12-02 05:53:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-02 05:53:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-02 05:53:10,884 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2018-12-02 05:53:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:10,884 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-02 05:53:10,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-02 05:53:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 05:53:10,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:10,885 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-02 05:53:10,885 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:10,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1199163944, now seen corresponding path program 1 times [2018-12-02 05:53:10,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:10,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:10,921 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-02 05:53:10,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:10,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:10,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:10,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:10,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:10,921 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-02 05:53:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:11,121 INFO L93 Difference]: Finished difference Result 544 states and 826 transitions. [2018-12-02 05:53:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:11,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 05:53:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:11,122 INFO L225 Difference]: With dead ends: 544 [2018-12-02 05:53:11,122 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 05:53:11,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 05:53:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-02 05:53:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-02 05:53:11,129 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2018-12-02 05:53:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:11,129 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-02 05:53:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-02 05:53:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:53:11,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:11,130 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-02 05:53:11,130 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:11,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1774849204, now seen corresponding path program 1 times [2018-12-02 05:53:11,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:11,161 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-02 05:53:11,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:11,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:11,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:11,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:11,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:11,162 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-02 05:53:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:11,383 INFO L93 Difference]: Finished difference Result 545 states and 826 transitions. [2018-12-02 05:53:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:11,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-02 05:53:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:11,384 INFO L225 Difference]: With dead ends: 545 [2018-12-02 05:53:11,384 INFO L226 Difference]: Without dead ends: 310 [2018-12-02 05:53:11,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-02 05:53:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-02 05:53:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-02 05:53:11,391 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-02 05:53:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:11,391 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-02 05:53:11,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-02 05:53:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 05:53:11,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:11,392 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-02 05:53:11,392 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:11,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash -591845390, now seen corresponding path program 1 times [2018-12-02 05:53:11,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:11,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:11,437 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-02 05:53:11,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:11,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:11,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:11,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:11,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:11,439 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-02 05:53:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:11,604 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-02 05:53:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:11,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-02 05:53:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:11,605 INFO L225 Difference]: With dead ends: 520 [2018-12-02 05:53:11,605 INFO L226 Difference]: Without dead ends: 285 [2018-12-02 05:53:11,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-02 05:53:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-02 05:53:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-02 05:53:11,611 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-02 05:53:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:11,611 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-02 05:53:11,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-02 05:53:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:53:11,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:11,612 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-02 05:53:11,612 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:11,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1148102909, now seen corresponding path program 1 times [2018-12-02 05:53:11,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:11,643 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-02 05:53:11,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:11,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:11,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:11,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:11,644 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-02 05:53:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:11,856 INFO L93 Difference]: Finished difference Result 543 states and 820 transitions. [2018-12-02 05:53:11,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:11,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 05:53:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:11,858 INFO L225 Difference]: With dead ends: 543 [2018-12-02 05:53:11,858 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 05:53:11,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 05:53:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-02 05:53:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-02 05:53:11,865 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-02 05:53:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:11,865 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-02 05:53:11,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-02 05:53:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:53:11,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:11,866 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-02 05:53:11,866 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:11,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1503332932, now seen corresponding path program 1 times [2018-12-02 05:53:11,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:11,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:11,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:11,900 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-02 05:53:11,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:11,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:11,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:11,900 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-02 05:53:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:12,093 INFO L93 Difference]: Finished difference Result 542 states and 817 transitions. [2018-12-02 05:53:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:12,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 05:53:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:12,094 INFO L225 Difference]: With dead ends: 542 [2018-12-02 05:53:12,094 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 05:53:12,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-02 05:53:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 05:53:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-02 05:53:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-02 05:53:12,105 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-02 05:53:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:12,105 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-02 05:53:12,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-02 05:53:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:53:12,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:12,106 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-02 05:53:12,106 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:12,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1501191291, now seen corresponding path program 1 times [2018-12-02 05:53:12,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:12,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:12,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:12,148 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-02 05:53:12,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:12,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:12,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:12,149 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-02 05:53:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:12,327 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-02 05:53:12,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:12,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 05:53:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:12,328 INFO L225 Difference]: With dead ends: 518 [2018-12-02 05:53:12,328 INFO L226 Difference]: Without dead ends: 283 [2018-12-02 05:53:12,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-02 05:53:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-02 05:53:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-02 05:53:12,338 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-02 05:53:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:12,338 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-02 05:53:12,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-02 05:53:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 05:53:12,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:12,339 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-02 05:53:12,340 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:12,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1150244550, now seen corresponding path program 1 times [2018-12-02 05:53:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:12,381 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-02 05:53:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:12,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:12,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:12,382 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-02 05:53:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:12,534 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-02 05:53:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:12,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 05:53:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:12,535 INFO L225 Difference]: With dead ends: 517 [2018-12-02 05:53:12,535 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 05:53:12,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 05:53:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 05:53:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-02 05:53:12,541 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-02 05:53:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:12,541 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-02 05:53:12,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-02 05:53:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:53:12,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:12,542 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-02 05:53:12,542 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:12,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 961886001, now seen corresponding path program 1 times [2018-12-02 05:53:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:12,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:12,576 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-02 05:53:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:12,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:12,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:12,577 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-02 05:53:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:12,821 INFO L93 Difference]: Finished difference Result 542 states and 811 transitions. [2018-12-02 05:53:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:12,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-02 05:53:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:12,823 INFO L225 Difference]: With dead ends: 542 [2018-12-02 05:53:12,823 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 05:53:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 05:53:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-02 05:53:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-02 05:53:12,833 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-02 05:53:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:12,833 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-02 05:53:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-02 05:53:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 05:53:12,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:12,834 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-02 05:53:12,834 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:12,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:12,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1393919249, now seen corresponding path program 1 times [2018-12-02 05:53:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:12,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:12,871 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-02 05:53:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:12,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:12,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:12,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:12,872 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-02 05:53:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:13,025 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-02 05:53:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-02 05:53:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:13,026 INFO L225 Difference]: With dead ends: 517 [2018-12-02 05:53:13,026 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 05:53:13,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 05:53:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 05:53:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-02 05:53:13,032 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-02 05:53:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:13,032 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-02 05:53:13,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-02 05:53:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:53:13,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:13,033 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-02 05:53:13,033 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:13,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1152513280, now seen corresponding path program 1 times [2018-12-02 05:53:13,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:13,061 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-02 05:53:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:13,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:13,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:13,061 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-02 05:53:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:13,245 INFO L93 Difference]: Finished difference Result 542 states and 807 transitions. [2018-12-02 05:53:13,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:13,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 05:53:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:13,246 INFO L225 Difference]: With dead ends: 542 [2018-12-02 05:53:13,246 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 05:53:13,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 05:53:13,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-02 05:53:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-02 05:53:13,253 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-02 05:53:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:13,253 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-02 05:53:13,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-02 05:53:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 05:53:13,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:13,253 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-02 05:53:13,254 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:13,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1168031998, now seen corresponding path program 1 times [2018-12-02 05:53:13,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:13,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:13,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:13,285 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-02 05:53:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:13,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:13,285 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-02 05:53:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:13,460 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-02 05:53:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:13,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 05:53:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:13,461 INFO L225 Difference]: With dead ends: 517 [2018-12-02 05:53:13,461 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 05:53:13,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 05:53:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 05:53:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-02 05:53:13,468 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-02 05:53:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:13,468 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-02 05:53:13,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-02 05:53:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 05:53:13,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:13,469 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-02 05:53:13,469 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:13,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash 738551148, now seen corresponding path program 1 times [2018-12-02 05:53:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:13,512 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-02 05:53:13,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:13,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:13,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:13,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:13,513 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-02 05:53:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:13,702 INFO L93 Difference]: Finished difference Result 542 states and 803 transitions. [2018-12-02 05:53:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:13,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-02 05:53:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:13,703 INFO L225 Difference]: With dead ends: 542 [2018-12-02 05:53:13,703 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 05:53:13,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 05:53:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-02 05:53:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-02 05:53:13,710 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-02 05:53:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:13,710 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-02 05:53:13,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-02 05:53:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 05:53:13,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:13,711 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-02 05:53:13,711 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:13,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash 257470890, now seen corresponding path program 1 times [2018-12-02 05:53:13,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:13,738 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-02 05:53:13,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:13,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:13,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:13,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:13,739 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-02 05:53:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:13,898 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-02 05:53:13,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:13,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-02 05:53:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:13,899 INFO L225 Difference]: With dead ends: 517 [2018-12-02 05:53:13,899 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 05:53:13,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-02 05:53:13,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 05:53:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 05:53:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-02 05:53:13,907 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-02 05:53:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:13,908 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-02 05:53:13,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-02 05:53:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 05:53:13,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:13,908 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-02 05:53:13,908 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:13,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:13,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2050028325, now seen corresponding path program 1 times [2018-12-02 05:53:13,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:13,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:13,945 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-02 05:53:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:13,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:13,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:13,946 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-02 05:53:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,203 INFO L93 Difference]: Finished difference Result 532 states and 787 transitions. [2018-12-02 05:53:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:14,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 05:53:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,205 INFO L225 Difference]: With dead ends: 532 [2018-12-02 05:53:14,205 INFO L226 Difference]: Without dead ends: 297 [2018-12-02 05:53:14,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-02 05:53:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-02 05:53:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-02 05:53:14,231 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-02 05:53:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,231 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-02 05:53:14,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-02 05:53:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 05:53:14,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,233 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-02 05:53:14,233 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 216352861, now seen corresponding path program 1 times [2018-12-02 05:53:14,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,282 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-02 05:53:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:14,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:14,283 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-02 05:53:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,420 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-02 05:53:14,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:14,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 05:53:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,421 INFO L225 Difference]: With dead ends: 507 [2018-12-02 05:53:14,421 INFO L226 Difference]: Without dead ends: 272 [2018-12-02 05:53:14,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-02 05:53:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-02 05:53:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-02 05:53:14,428 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-02 05:53:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,428 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-02 05:53:14,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-02 05:53:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:53:14,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,429 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-02 05:53:14,429 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1019220863, now seen corresponding path program 1 times [2018-12-02 05:53:14,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,461 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-02 05:53:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:14,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:14,462 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-02 05:53:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,637 INFO L93 Difference]: Finished difference Result 532 states and 783 transitions. [2018-12-02 05:53:14,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:14,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 05:53:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,638 INFO L225 Difference]: With dead ends: 532 [2018-12-02 05:53:14,638 INFO L226 Difference]: Without dead ends: 297 [2018-12-02 05:53:14,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-02 05:53:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-02 05:53:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 05:53:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-02 05:53:14,647 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-02 05:53:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,647 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-02 05:53:14,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-02 05:53:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 05:53:14,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,647 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-02 05:53:14,648 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash 367564547, now seen corresponding path program 1 times [2018-12-02 05:53:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,674 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-02 05:53:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:53:14,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:53:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:53:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,674 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-02 05:53:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,707 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-02 05:53:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:53:14,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-02 05:53:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,708 INFO L225 Difference]: With dead ends: 728 [2018-12-02 05:53:14,708 INFO L226 Difference]: Without dead ends: 493 [2018-12-02 05:53:14,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-02 05:53:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-02 05:53:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-02 05:53:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-02 05:53:14,722 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-02 05:53:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,722 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-02 05:53:14,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:53:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-02 05:53:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 05:53:14,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,723 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-02 05:53:14,723 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1725725933, now seen corresponding path program 1 times [2018-12-02 05:53:14,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,746 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-02 05:53:14,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:53:14,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:53:14,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:53:14,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,747 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-02 05:53:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,804 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-02 05:53:14,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:53:14,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-02 05:53:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,806 INFO L225 Difference]: With dead ends: 1196 [2018-12-02 05:53:14,806 INFO L226 Difference]: Without dead ends: 728 [2018-12-02 05:53:14,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-02 05:53:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-02 05:53:14,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 05:53:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-02 05:53:14,829 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-02 05:53:14,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,829 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-02 05:53:14,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:53:14,829 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-02 05:53:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 05:53:14,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,830 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-02 05:53:14,830 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,831 INFO L82 PathProgramCache]: Analyzing trace with hash 244952331, now seen corresponding path program 1 times [2018-12-02 05:53:14,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,863 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-02 05:53:14,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:53:14,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:53:14,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:53:14,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,864 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-02 05:53:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:14,913 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-02 05:53:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:53:14,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-02 05:53:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:14,914 INFO L225 Difference]: With dead ends: 1662 [2018-12-02 05:53:14,914 INFO L226 Difference]: Without dead ends: 961 [2018-12-02 05:53:14,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-02 05:53:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-02 05:53:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-02 05:53:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-02 05:53:14,940 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2018-12-02 05:53:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:14,940 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-02 05:53:14,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:53:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-02 05:53:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 05:53:14,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:14,941 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-02 05:53:14,942 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:14,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash -251388870, now seen corresponding path program 1 times [2018-12-02 05:53:14,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:14,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:14,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:14,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:14,974 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-02 05:53:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:14,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:14,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:14,975 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-02 05:53:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:15,389 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-12-02 05:53:15,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:15,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 05:53:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:15,392 INFO L225 Difference]: With dead ends: 2303 [2018-12-02 05:53:15,392 INFO L226 Difference]: Without dead ends: 1369 [2018-12-02 05:53:15,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-12-02 05:53:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-12-02 05:53:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-02 05:53:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-02 05:53:15,422 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2018-12-02 05:53:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:15,422 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-02 05:53:15,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-02 05:53:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 05:53:15,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:15,423 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-02 05:53:15,423 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:15,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash 789872266, now seen corresponding path program 1 times [2018-12-02 05:53:15,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:15,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:15,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:15,461 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-02 05:53:15,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:15,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:15,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:15,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:15,462 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-02 05:53:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:15,748 INFO L93 Difference]: Finished difference Result 2441 states and 3659 transitions. [2018-12-02 05:53:15,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:15,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-02 05:53:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:15,750 INFO L225 Difference]: With dead ends: 2441 [2018-12-02 05:53:15,750 INFO L226 Difference]: Without dead ends: 1351 [2018-12-02 05:53:15,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:15,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-12-02 05:53:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2018-12-02 05:53:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-02 05:53:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-02 05:53:15,780 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2018-12-02 05:53:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:15,780 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-02 05:53:15,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:15,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-02 05:53:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 05:53:15,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:15,781 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-02 05:53:15,781 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:15,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:15,781 INFO L82 PathProgramCache]: Analyzing trace with hash -401210212, now seen corresponding path program 1 times [2018-12-02 05:53:15,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:15,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:15,809 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-02 05:53:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:15,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:53:15,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:15,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:53:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:53:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:15,810 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2018-12-02 05:53:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:15,856 INFO L93 Difference]: Finished difference Result 1341 states and 2010 transitions. [2018-12-02 05:53:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:53:15,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-02 05:53:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:15,859 INFO L225 Difference]: With dead ends: 1341 [2018-12-02 05:53:15,859 INFO L226 Difference]: Without dead ends: 1339 [2018-12-02 05:53:15,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:53:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-12-02 05:53:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2018-12-02 05:53:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2018-12-02 05:53:15,894 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2018-12-02 05:53:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2018-12-02 05:53:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:53:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2018-12-02 05:53:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 05:53:15,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:15,895 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-02 05:53:15,895 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:15,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash -450020108, now seen corresponding path program 1 times [2018-12-02 05:53:15,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:15,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:15,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:15,935 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-02 05:53:15,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:15,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:15,936 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2018-12-02 05:53:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:16,221 INFO L93 Difference]: Finished difference Result 2994 states and 4461 transitions. [2018-12-02 05:53:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:16,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-02 05:53:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:16,224 INFO L225 Difference]: With dead ends: 2994 [2018-12-02 05:53:16,224 INFO L226 Difference]: Without dead ends: 1682 [2018-12-02 05:53:16,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-12-02 05:53:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2018-12-02 05:53:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2018-12-02 05:53:16,267 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2018-12-02 05:53:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:16,268 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2018-12-02 05:53:16,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2018-12-02 05:53:16,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 05:53:16,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:16,269 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-02 05:53:16,269 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:16,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash -774039169, now seen corresponding path program 1 times [2018-12-02 05:53:16,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:16,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:16,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:16,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:16,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:16,316 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-02 05:53:16,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:16,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:16,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:16,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:16,317 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2018-12-02 05:53:16,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:16,628 INFO L93 Difference]: Finished difference Result 2984 states and 4441 transitions. [2018-12-02 05:53:16,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:16,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-02 05:53:16,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:16,633 INFO L225 Difference]: With dead ends: 2984 [2018-12-02 05:53:16,633 INFO L226 Difference]: Without dead ends: 1672 [2018-12-02 05:53:16,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-12-02 05:53:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2018-12-02 05:53:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2018-12-02 05:53:16,673 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2018-12-02 05:53:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:16,674 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2018-12-02 05:53:16,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2018-12-02 05:53:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 05:53:16,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:16,674 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-02 05:53:16,675 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:16,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1862899712, now seen corresponding path program 1 times [2018-12-02 05:53:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:16,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:16,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:16,710 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-02 05:53:16,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:16,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:16,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:16,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:16,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:16,711 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2018-12-02 05:53:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:16,981 INFO L93 Difference]: Finished difference Result 2979 states and 4426 transitions. [2018-12-02 05:53:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:16,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-02 05:53:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:16,984 INFO L225 Difference]: With dead ends: 2979 [2018-12-02 05:53:16,984 INFO L226 Difference]: Without dead ends: 1667 [2018-12-02 05:53:16,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-02 05:53:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-02 05:53:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2018-12-02 05:53:17,024 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2018-12-02 05:53:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:17,024 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2018-12-02 05:53:17,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2018-12-02 05:53:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-02 05:53:17,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:17,026 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-02 05:53:17,026 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:17,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1173027535, now seen corresponding path program 1 times [2018-12-02 05:53:17,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:17,066 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-02 05:53:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:17,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:17,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:17,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:17,067 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2018-12-02 05:53:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:17,361 INFO L93 Difference]: Finished difference Result 2979 states and 4416 transitions. [2018-12-02 05:53:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:17,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-02 05:53:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:17,364 INFO L225 Difference]: With dead ends: 2979 [2018-12-02 05:53:17,364 INFO L226 Difference]: Without dead ends: 1667 [2018-12-02 05:53:17,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-02 05:53:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-02 05:53:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2018-12-02 05:53:17,405 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2018-12-02 05:53:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:17,405 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2018-12-02 05:53:17,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2018-12-02 05:53:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 05:53:17,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:17,406 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-02 05:53:17,406 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:17,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash -952312772, now seen corresponding path program 1 times [2018-12-02 05:53:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:17,446 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-02 05:53:17,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:17,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:17,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:17,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:17,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:17,446 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2018-12-02 05:53:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:17,718 INFO L93 Difference]: Finished difference Result 2979 states and 4406 transitions. [2018-12-02 05:53:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:17,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-02 05:53:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:17,721 INFO L225 Difference]: With dead ends: 2979 [2018-12-02 05:53:17,721 INFO L226 Difference]: Without dead ends: 1667 [2018-12-02 05:53:17,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-02 05:53:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-02 05:53:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2018-12-02 05:53:17,764 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2018-12-02 05:53:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:17,764 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2018-12-02 05:53:17,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2018-12-02 05:53:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 05:53:17,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:17,765 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-02 05:53:17,765 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:17,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -26891604, now seen corresponding path program 1 times [2018-12-02 05:53:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:17,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:17,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:17,804 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-02 05:53:17,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:17,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:17,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:17,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:17,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:17,804 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2018-12-02 05:53:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:18,107 INFO L93 Difference]: Finished difference Result 2979 states and 4396 transitions. [2018-12-02 05:53:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:18,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-02 05:53:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:18,110 INFO L225 Difference]: With dead ends: 2979 [2018-12-02 05:53:18,110 INFO L226 Difference]: Without dead ends: 1667 [2018-12-02 05:53:18,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-02 05:53:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-02 05:53:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2018-12-02 05:53:18,153 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2018-12-02 05:53:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:18,153 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2018-12-02 05:53:18,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2018-12-02 05:53:18,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 05:53:18,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:18,154 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-02 05:53:18,155 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:18,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:18,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1269591639, now seen corresponding path program 1 times [2018-12-02 05:53:18,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:18,192 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-02 05:53:18,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:18,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:18,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:18,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:18,192 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2018-12-02 05:53:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:18,454 INFO L93 Difference]: Finished difference Result 2929 states and 4326 transitions. [2018-12-02 05:53:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:18,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 05:53:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:18,457 INFO L225 Difference]: With dead ends: 2929 [2018-12-02 05:53:18,457 INFO L226 Difference]: Without dead ends: 1617 [2018-12-02 05:53:18,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-02 05:53:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-02 05:53:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2018-12-02 05:53:18,502 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2018-12-02 05:53:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:18,503 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2018-12-02 05:53:18,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2018-12-02 05:53:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 05:53:18,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:18,504 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-02 05:53:18,504 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:18,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash 9919101, now seen corresponding path program 1 times [2018-12-02 05:53:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:18,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:18,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:18,539 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-02 05:53:18,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:18,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:18,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:18,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:18,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:18,540 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2018-12-02 05:53:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:18,847 INFO L93 Difference]: Finished difference Result 2929 states and 4316 transitions. [2018-12-02 05:53:18,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:18,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-02 05:53:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:18,850 INFO L225 Difference]: With dead ends: 2929 [2018-12-02 05:53:18,850 INFO L226 Difference]: Without dead ends: 1617 [2018-12-02 05:53:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-02 05:53:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-02 05:53:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2018-12-02 05:53:18,895 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2018-12-02 05:53:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:18,895 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2018-12-02 05:53:18,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2018-12-02 05:53:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-02 05:53:18,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:18,896 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-02 05:53:18,896 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash -407831342, now seen corresponding path program 1 times [2018-12-02 05:53:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:18,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:18,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:18,931 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-02 05:53:18,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:18,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:18,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:18,931 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2018-12-02 05:53:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:19,349 INFO L93 Difference]: Finished difference Result 2904 states and 4274 transitions. [2018-12-02 05:53:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:19,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-02 05:53:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:19,352 INFO L225 Difference]: With dead ends: 2904 [2018-12-02 05:53:19,352 INFO L226 Difference]: Without dead ends: 1592 [2018-12-02 05:53:19,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-02 05:53:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-02 05:53:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2018-12-02 05:53:19,400 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2018-12-02 05:53:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:19,400 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2018-12-02 05:53:19,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2018-12-02 05:53:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 05:53:19,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:19,401 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-02 05:53:19,401 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:19,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:19,402 INFO L82 PathProgramCache]: Analyzing trace with hash 801190450, now seen corresponding path program 1 times [2018-12-02 05:53:19,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:19,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:19,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:19,446 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-02 05:53:19,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:19,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:19,446 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:19,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:19,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:19,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:19,447 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2018-12-02 05:53:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:19,712 INFO L93 Difference]: Finished difference Result 2904 states and 4264 transitions. [2018-12-02 05:53:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:19,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 05:53:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:19,714 INFO L225 Difference]: With dead ends: 2904 [2018-12-02 05:53:19,714 INFO L226 Difference]: Without dead ends: 1592 [2018-12-02 05:53:19,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:19,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-02 05:53:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-02 05:53:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-02 05:53:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2018-12-02 05:53:19,760 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2018-12-02 05:53:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:19,760 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2018-12-02 05:53:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2018-12-02 05:53:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 05:53:19,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:19,761 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-02 05:53:19,761 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1580551555, now seen corresponding path program 1 times [2018-12-02 05:53:19,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:19,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:19,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:19,821 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-02 05:53:19,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:19,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:19,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:19,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:19,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:19,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:19,821 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2018-12-02 05:53:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:20,086 INFO L93 Difference]: Finished difference Result 2864 states and 4189 transitions. [2018-12-02 05:53:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:20,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 05:53:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:20,089 INFO L225 Difference]: With dead ends: 2864 [2018-12-02 05:53:20,089 INFO L226 Difference]: Without dead ends: 1552 [2018-12-02 05:53:20,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-02 05:53:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2018-12-02 05:53:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-02 05:53:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2018-12-02 05:53:20,139 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2018-12-02 05:53:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:20,139 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2018-12-02 05:53:20,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2018-12-02 05:53:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 05:53:20,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:20,141 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-02 05:53:20,141 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:20,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1153018863, now seen corresponding path program 1 times [2018-12-02 05:53:20,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:20,176 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-02 05:53:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:20,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:20,177 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2018-12-02 05:53:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:20,429 INFO L93 Difference]: Finished difference Result 2844 states and 4149 transitions. [2018-12-02 05:53:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:20,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 05:53:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:20,431 INFO L225 Difference]: With dead ends: 2844 [2018-12-02 05:53:20,431 INFO L226 Difference]: Without dead ends: 1552 [2018-12-02 05:53:20,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-02 05:53:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-02 05:53:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-02 05:53:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2018-12-02 05:53:20,491 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2018-12-02 05:53:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:20,492 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2018-12-02 05:53:20,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2018-12-02 05:53:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 05:53:20,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:20,493 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-02 05:53:20,493 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:20,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash 631162196, now seen corresponding path program 1 times [2018-12-02 05:53:20,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:20,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:20,531 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-02 05:53:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:20,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:20,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:20,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:20,532 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2018-12-02 05:53:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:20,791 INFO L93 Difference]: Finished difference Result 2869 states and 4179 transitions. [2018-12-02 05:53:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:20,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 05:53:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:20,794 INFO L225 Difference]: With dead ends: 2869 [2018-12-02 05:53:20,794 INFO L226 Difference]: Without dead ends: 1552 [2018-12-02 05:53:20,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-02 05:53:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-02 05:53:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-02 05:53:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2018-12-02 05:53:20,845 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2018-12-02 05:53:20,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:20,845 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2018-12-02 05:53:20,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2018-12-02 05:53:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 05:53:20,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:20,846 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-02 05:53:20,846 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:20,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1135048956, now seen corresponding path program 1 times [2018-12-02 05:53:20,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:20,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:20,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:20,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:20,901 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-02 05:53:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:20,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:20,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:20,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:20,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:20,902 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2018-12-02 05:53:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:21,139 INFO L93 Difference]: Finished difference Result 2859 states and 4159 transitions. [2018-12-02 05:53:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:21,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 05:53:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:21,141 INFO L225 Difference]: With dead ends: 2859 [2018-12-02 05:53:21,141 INFO L226 Difference]: Without dead ends: 1542 [2018-12-02 05:53:21,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-02 05:53:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2018-12-02 05:53:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-02 05:53:21,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2018-12-02 05:53:21,193 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2018-12-02 05:53:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:21,194 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2018-12-02 05:53:21,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2018-12-02 05:53:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 05:53:21,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:21,195 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-02 05:53:21,195 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:21,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash -62779921, now seen corresponding path program 1 times [2018-12-02 05:53:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:21,247 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-02 05:53:21,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:21,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:21,247 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2018-12-02 05:53:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:21,475 INFO L93 Difference]: Finished difference Result 2849 states and 4139 transitions. [2018-12-02 05:53:21,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:21,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 05:53:21,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:21,476 INFO L225 Difference]: With dead ends: 2849 [2018-12-02 05:53:21,476 INFO L226 Difference]: Without dead ends: 1527 [2018-12-02 05:53:21,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2018-12-02 05:53:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1352. [2018-12-02 05:53:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-02 05:53:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1962 transitions. [2018-12-02 05:53:21,526 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1962 transitions. Word has length 156 [2018-12-02 05:53:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:21,526 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1962 transitions. [2018-12-02 05:53:21,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1962 transitions. [2018-12-02 05:53:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 05:53:21,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:21,527 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-02 05:53:21,528 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:21,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2086806665, now seen corresponding path program 1 times [2018-12-02 05:53:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:21,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:21,565 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-02 05:53:21,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:21,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:21,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:21,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:21,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:21,566 INFO L87 Difference]: Start difference. First operand 1352 states and 1962 transitions. Second operand 4 states. [2018-12-02 05:53:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:21,797 INFO L93 Difference]: Finished difference Result 2844 states and 4124 transitions. [2018-12-02 05:53:21,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:21,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 05:53:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:21,799 INFO L225 Difference]: With dead ends: 2844 [2018-12-02 05:53:21,799 INFO L226 Difference]: Without dead ends: 1517 [2018-12-02 05:53:21,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:21,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-02 05:53:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2018-12-02 05:53:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-02 05:53:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2018-12-02 05:53:21,850 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2018-12-02 05:53:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:21,850 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2018-12-02 05:53:21,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2018-12-02 05:53:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 05:53:21,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:21,851 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-02 05:53:21,851 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:21,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash -996213216, now seen corresponding path program 1 times [2018-12-02 05:53:21,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:21,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:21,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:21,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:21,884 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-02 05:53:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:21,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:21,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:21,885 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2018-12-02 05:53:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:22,163 INFO L93 Difference]: Finished difference Result 2844 states and 4114 transitions. [2018-12-02 05:53:22,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:22,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 05:53:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:22,164 INFO L225 Difference]: With dead ends: 2844 [2018-12-02 05:53:22,165 INFO L226 Difference]: Without dead ends: 1517 [2018-12-02 05:53:22,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-02 05:53:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2018-12-02 05:53:22,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-12-02 05:53:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2018-12-02 05:53:22,218 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2018-12-02 05:53:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:22,218 INFO L480 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2018-12-02 05:53:22,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2018-12-02 05:53:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 05:53:22,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:22,220 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-02 05:53:22,220 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:22,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1692418064, now seen corresponding path program 1 times [2018-12-02 05:53:22,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:22,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:22,256 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-02 05:53:22,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:22,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:22,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:22,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:22,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:22,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:22,257 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2018-12-02 05:53:22,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:22,495 INFO L93 Difference]: Finished difference Result 2829 states and 4089 transitions. [2018-12-02 05:53:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:22,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 05:53:22,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:22,497 INFO L225 Difference]: With dead ends: 2829 [2018-12-02 05:53:22,497 INFO L226 Difference]: Without dead ends: 1497 [2018-12-02 05:53:22,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-02 05:53:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2018-12-02 05:53:22,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-02 05:53:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2018-12-02 05:53:22,549 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2018-12-02 05:53:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:22,549 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2018-12-02 05:53:22,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:22,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2018-12-02 05:53:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 05:53:22,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:22,550 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-02 05:53:22,550 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:22,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -312937230, now seen corresponding path program 1 times [2018-12-02 05:53:22,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:22,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:22,591 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-02 05:53:22,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:22,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:22,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:22,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:22,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:22,592 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2018-12-02 05:53:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:22,819 INFO L93 Difference]: Finished difference Result 2834 states and 4089 transitions. [2018-12-02 05:53:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:22,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 05:53:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:22,820 INFO L225 Difference]: With dead ends: 2834 [2018-12-02 05:53:22,820 INFO L226 Difference]: Without dead ends: 1497 [2018-12-02 05:53:22,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-02 05:53:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2018-12-02 05:53:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-12-02 05:53:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2018-12-02 05:53:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2018-12-02 05:53:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:22,881 INFO L480 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2018-12-02 05:53:22,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2018-12-02 05:53:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 05:53:22,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:22,882 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-02 05:53:22,883 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:22,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1504114818, now seen corresponding path program 1 times [2018-12-02 05:53:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:22,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:22,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:22,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:22,930 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-02 05:53:22,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:22,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:22,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:22,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:22,931 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2018-12-02 05:53:23,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:23,152 INFO L93 Difference]: Finished difference Result 2829 states and 4079 transitions. [2018-12-02 05:53:23,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:23,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-02 05:53:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:23,154 INFO L225 Difference]: With dead ends: 2829 [2018-12-02 05:53:23,154 INFO L226 Difference]: Without dead ends: 1487 [2018-12-02 05:53:23,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-02 05:53:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2018-12-02 05:53:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-02 05:53:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2018-12-02 05:53:23,217 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2018-12-02 05:53:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:23,217 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2018-12-02 05:53:23,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2018-12-02 05:53:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 05:53:23,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:23,218 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-02 05:53:23,219 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:23,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1391994477, now seen corresponding path program 1 times [2018-12-02 05:53:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:23,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:23,261 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-02 05:53:23,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:23,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:23,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:23,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:23,262 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2018-12-02 05:53:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:23,479 INFO L93 Difference]: Finished difference Result 2834 states and 4079 transitions. [2018-12-02 05:53:23,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:23,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 05:53:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:23,480 INFO L225 Difference]: With dead ends: 2834 [2018-12-02 05:53:23,480 INFO L226 Difference]: Without dead ends: 1487 [2018-12-02 05:53:23,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:23,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-02 05:53:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2018-12-02 05:53:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-12-02 05:53:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2018-12-02 05:53:23,535 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2018-12-02 05:53:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:23,535 INFO L480 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2018-12-02 05:53:23,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2018-12-02 05:53:23,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 05:53:23,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:23,537 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-02 05:53:23,537 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:23,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1451888989, now seen corresponding path program 1 times [2018-12-02 05:53:23,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:23,593 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-02 05:53:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:23,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:23,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:23,594 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2018-12-02 05:53:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:23,817 INFO L93 Difference]: Finished difference Result 2829 states and 4069 transitions. [2018-12-02 05:53:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:23,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 05:53:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:23,818 INFO L225 Difference]: With dead ends: 2829 [2018-12-02 05:53:23,818 INFO L226 Difference]: Without dead ends: 1477 [2018-12-02 05:53:23,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-02 05:53:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1382. [2018-12-02 05:53:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-02 05:53:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2018-12-02 05:53:23,872 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2018-12-02 05:53:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:23,872 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2018-12-02 05:53:23,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2018-12-02 05:53:23,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 05:53:23,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:23,874 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-02 05:53:23,874 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:23,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash 807793180, now seen corresponding path program 1 times [2018-12-02 05:53:23,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:23,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 05:53:24,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:53:24,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 05:53:24,255 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-02 05:53:24,256 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], [524], [529], [531], [534], [552], [555], [559], [580], [614], [616], [628], [631], [632], [633], [635] [2018-12-02 05:53:24,284 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 05:53:24,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 05:53:24,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 05:53:24,779 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-02 05:53:24,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:24,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 05:53:24,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:53:24,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/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-02 05:53:24,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:24,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 05:53:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:24,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:53:24,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,924 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-02 05:53:24,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,954 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-02 05:53:24,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:24,976 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-02 05:53:24,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:24,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:24,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,023 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-02 05:53:25,025 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-02 05:53:25,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,029 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-02 05:53:25,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,034 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-02 05:53:25,035 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,041 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,045 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,057 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-02 05:53:25,057 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 05:53:25,094 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-02 05:53:25,097 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-02 05:53:25,112 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-02 05:53:25,115 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-02 05:53:25,131 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-02 05:53:25,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,140 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-02 05:53:25,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,155 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-02 05:53:25,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,171 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-02 05:53:25,172 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,190 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,202 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,216 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 05:53:25,237 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-02 05:53:25,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,246 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-02 05:53:25,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 05:53:25,271 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-02 05:53:25,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,282 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-02 05:53:25,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 05:53:25,309 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-02 05:53:25,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,318 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-02 05:53:25,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,347 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-02 05:53:25,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,355 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-02 05:53:25,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 05:53:25,381 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-02 05:53:25,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,389 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-02 05:53:25,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 05:53:25,414 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-02 05:53:25,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,423 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-02 05:53:25,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 05:53:25,453 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-02 05:53:25,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,457 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-02 05:53:25,458 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-02 05:53:25,463 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-02 05:53:25,482 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-02 05:53:25,484 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-02 05:53:25,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,510 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-02 05:53:25,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-02 05:53:25,550 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-02 05:53:25,553 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-02 05:53:25,581 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 130 treesize of output 111 [2018-12-02 05:53:25,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,592 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 105 treesize of output 155 [2018-12-02 05:53:25,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,612 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 195 [2018-12-02 05:53:25,612 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,660 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-02 05:53:25,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-02 05:53:25,685 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-02 05:53:25,687 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-02 05:53:25,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,712 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-02 05:53:25,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,720 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-02 05:53:25,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,749 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-02 05:53:25,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-02 05:53:25,780 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-02 05:53:25,782 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-02 05:53:25,782 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-02 05:53:25,784 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-02 05:53:25,802 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-02 05:53:25,804 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-02 05:53:25,805 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-02 05:53:25,816 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-02 05:53:25,816 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,821 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-02 05:53:25,828 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-02 05:53:25,830 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-02 05:53:25,830 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,833 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,836 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-02 05:53:25,836 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-02 05:53:25,858 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-02 05:53:25,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,861 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-02 05:53:25,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,873 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-02 05:53:25,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-02 05:53:25,915 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-02 05:53:25,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:53:25,918 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-02 05:53:25,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,927 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-02 05:53:25,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:25,930 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-02 05:53:25,930 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-02 05:53:26,068 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-02 05:53:26,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:53:26,123 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-02 05:53:26,125 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-02 05:53:26,126 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-02 05:53:26,128 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-02 05:53:26,129 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-02 05:53:26,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-02 05:53:26,341 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-02 05:53:26,343 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-02 05:53:26,347 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-02 05:53:26,362 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-02 05:53:26,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:26,369 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-02 05:53:26,371 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-02 05:53:26,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 05:53:26,372 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:53:26,377 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-02 05:53:26,382 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-02 05:53:26,382 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-02 05:53:26,411 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-02 05:53:26,413 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-02 05:53:26,419 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-02 05:53:26,420 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-02 05:53:26,421 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-02 05:53:26,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-02 05:53:26,435 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-02 05:53:26,437 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 05:53:26,438 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-02 05:53:26,438 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-02 05:53:26,442 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-02 05:53:26,446 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-02 05:53:26,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2018-12-02 05:53:26,491 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-02 05:53:26,494 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-02 05:53:26,497 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-02 05:53:26,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-02 05:53:26,945 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-02 05:53:26,948 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-02 05:53:26,950 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-02 05:53:26,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-02 05:53:27,000 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-02 05:53:27,003 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-02 05:53:27,009 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-02 05:53:27,011 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-02 05:53:27,014 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-02 05:53:27,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2018-12-02 05:53:27,468 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-02 05:53:27,470 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-02 05:53:27,473 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-02 05:53:27,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-02 05:53:27,519 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-02 05:53:27,522 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-02 05:53:27,525 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-02 05:53:27,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-02 05:53:27,576 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-02 05:53:27,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-02 05:53:27,588 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-02 05:53:27,591 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-02 05:53:27,597 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-02 05:53:27,599 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-02 05:53:27,602 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-02 05:53:27,602 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:110, output treesize:154 [2018-12-02 05:53:27,786 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-02 05:53:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 05:53:27,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2018-12-02 05:53:27,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 05:53:27,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 05:53:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:53:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-02 05:53:27,803 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 19 states. [2018-12-02 05:53:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:32,087 INFO L93 Difference]: Finished difference Result 4608 states and 6746 transitions. [2018-12-02 05:53:32,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 05:53:32,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-12-02 05:53:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:32,092 INFO L225 Difference]: With dead ends: 4608 [2018-12-02 05:53:32,092 INFO L226 Difference]: Without dead ends: 3251 [2018-12-02 05:53:32,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 320 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 05:53:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3251 states. [2018-12-02 05:53:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3251 to 1542. [2018-12-02 05:53:32,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-02 05:53:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2272 transitions. [2018-12-02 05:53:32,189 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2272 transitions. Word has length 170 [2018-12-02 05:53:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:32,189 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2272 transitions. [2018-12-02 05:53:32,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 05:53:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2272 transitions. [2018-12-02 05:53:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 05:53:32,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:32,191 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-02 05:53:32,191 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1024532426, now seen corresponding path program 1 times [2018-12-02 05:53:32,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:32,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:32,232 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-02 05:53:32,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:32,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:32,232 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:32,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:32,232 INFO L87 Difference]: Start difference. First operand 1542 states and 2272 transitions. Second operand 4 states. [2018-12-02 05:53:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:32,532 INFO L93 Difference]: Finished difference Result 3154 states and 4639 transitions. [2018-12-02 05:53:32,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:32,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-02 05:53:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:32,536 INFO L225 Difference]: With dead ends: 3154 [2018-12-02 05:53:32,536 INFO L226 Difference]: Without dead ends: 1637 [2018-12-02 05:53:32,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-12-02 05:53:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1542. [2018-12-02 05:53:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-02 05:53:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2267 transitions. [2018-12-02 05:53:32,634 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2267 transitions. Word has length 171 [2018-12-02 05:53:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:32,635 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2267 transitions. [2018-12-02 05:53:32,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2267 transitions. [2018-12-02 05:53:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 05:53:32,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:32,637 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-02 05:53:32,637 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:32,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 755514411, now seen corresponding path program 1 times [2018-12-02 05:53:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:32,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:32,685 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-02 05:53:32,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:32,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:32,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:32,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:32,686 INFO L87 Difference]: Start difference. First operand 1542 states and 2267 transitions. Second operand 4 states. [2018-12-02 05:53:32,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:32,966 INFO L93 Difference]: Finished difference Result 3134 states and 4602 transitions. [2018-12-02 05:53:32,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:32,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-02 05:53:32,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:32,969 INFO L225 Difference]: With dead ends: 3134 [2018-12-02 05:53:32,969 INFO L226 Difference]: Without dead ends: 1617 [2018-12-02 05:53:32,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-02 05:53:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1542. [2018-12-02 05:53:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-02 05:53:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2262 transitions. [2018-12-02 05:53:33,069 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2262 transitions. Word has length 172 [2018-12-02 05:53:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:33,070 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2262 transitions. [2018-12-02 05:53:33,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2262 transitions. [2018-12-02 05:53:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 05:53:33,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:33,072 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:33,072 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:33,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1388208739, now seen corresponding path program 1 times [2018-12-02 05:53:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:33,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:33,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 05:53:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:33,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:33,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:33,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:33,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:33,120 INFO L87 Difference]: Start difference. First operand 1542 states and 2262 transitions. Second operand 4 states. [2018-12-02 05:53:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:33,433 INFO L93 Difference]: Finished difference Result 3374 states and 4977 transitions. [2018-12-02 05:53:33,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:33,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-02 05:53:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:33,435 INFO L225 Difference]: With dead ends: 3374 [2018-12-02 05:53:33,435 INFO L226 Difference]: Without dead ends: 1857 [2018-12-02 05:53:33,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2018-12-02 05:53:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1682. [2018-12-02 05:53:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-02 05:53:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2507 transitions. [2018-12-02 05:53:33,514 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2507 transitions. Word has length 178 [2018-12-02 05:53:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:33,515 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2507 transitions. [2018-12-02 05:53:33,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2507 transitions. [2018-12-02 05:53:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-02 05:53:33,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:33,517 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-02 05:53:33,517 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:33,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash 59144802, now seen corresponding path program 1 times [2018-12-02 05:53:33,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:33,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:33,587 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-02 05:53:33,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:33,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:33,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:33,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:33,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:33,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:33,588 INFO L87 Difference]: Start difference. First operand 1682 states and 2507 transitions. Second operand 4 states. [2018-12-02 05:53:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:33,970 INFO L93 Difference]: Finished difference Result 3851 states and 5758 transitions. [2018-12-02 05:53:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:33,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-02 05:53:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:33,972 INFO L225 Difference]: With dead ends: 3851 [2018-12-02 05:53:33,972 INFO L226 Difference]: Without dead ends: 2194 [2018-12-02 05:53:33,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-12-02 05:53:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1877. [2018-12-02 05:53:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-02 05:53:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2862 transitions. [2018-12-02 05:53:34,052 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2862 transitions. Word has length 184 [2018-12-02 05:53:34,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:34,052 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2862 transitions. [2018-12-02 05:53:34,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2862 transitions. [2018-12-02 05:53:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-02 05:53:34,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:34,054 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-02 05:53:34,054 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:34,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1254854897, now seen corresponding path program 1 times [2018-12-02 05:53:34,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:34,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:34,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:34,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:34,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:34,127 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-02 05:53:34,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:34,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:53:34,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:34,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:53:34,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:53:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:34,128 INFO L87 Difference]: Start difference. First operand 1877 states and 2862 transitions. Second operand 5 states. [2018-12-02 05:53:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:34,549 INFO L93 Difference]: Finished difference Result 4476 states and 6868 transitions. [2018-12-02 05:53:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:34,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-02 05:53:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:34,551 INFO L225 Difference]: With dead ends: 4476 [2018-12-02 05:53:34,551 INFO L226 Difference]: Without dead ends: 2624 [2018-12-02 05:53:34,553 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-02 05:53:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-12-02 05:53:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1877. [2018-12-02 05:53:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-02 05:53:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2862 transitions. [2018-12-02 05:53:34,635 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2862 transitions. Word has length 185 [2018-12-02 05:53:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:34,635 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2862 transitions. [2018-12-02 05:53:34,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:53:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2862 transitions. [2018-12-02 05:53:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-02 05:53:34,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:34,636 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-02 05:53:34,636 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:34,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1826481506, now seen corresponding path program 1 times [2018-12-02 05:53:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:34,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:34,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:34,692 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-02 05:53:34,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:34,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:34,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:34,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:34,693 INFO L87 Difference]: Start difference. First operand 1877 states and 2862 transitions. Second operand 4 states. [2018-12-02 05:53:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:35,085 INFO L93 Difference]: Finished difference Result 4219 states and 6436 transitions. [2018-12-02 05:53:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:35,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-02 05:53:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:35,087 INFO L225 Difference]: With dead ends: 4219 [2018-12-02 05:53:35,087 INFO L226 Difference]: Without dead ends: 2367 [2018-12-02 05:53:35,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2018-12-02 05:53:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2022. [2018-12-02 05:53:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-12-02 05:53:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3122 transitions. [2018-12-02 05:53:35,171 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3122 transitions. Word has length 185 [2018-12-02 05:53:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:35,171 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 3122 transitions. [2018-12-02 05:53:35,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3122 transitions. [2018-12-02 05:53:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-02 05:53:35,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:35,172 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-02 05:53:35,172 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:35,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:35,173 INFO L82 PathProgramCache]: Analyzing trace with hash -252803499, now seen corresponding path program 1 times [2018-12-02 05:53:35,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:35,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:35,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:35,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:35,250 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-02 05:53:35,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:35,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:53:35,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:35,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:53:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:53:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:35,251 INFO L87 Difference]: Start difference. First operand 2022 states and 3122 transitions. Second operand 5 states. [2018-12-02 05:53:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:35,693 INFO L93 Difference]: Finished difference Result 4546 states and 7018 transitions. [2018-12-02 05:53:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:35,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-02 05:53:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:35,695 INFO L225 Difference]: With dead ends: 4546 [2018-12-02 05:53:35,695 INFO L226 Difference]: Without dead ends: 2549 [2018-12-02 05:53:35,697 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-02 05:53:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2018-12-02 05:53:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1967. [2018-12-02 05:53:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3047 transitions. [2018-12-02 05:53:35,782 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3047 transitions. Word has length 186 [2018-12-02 05:53:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:35,782 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3047 transitions. [2018-12-02 05:53:35,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:53:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3047 transitions. [2018-12-02 05:53:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 05:53:35,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:35,783 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:35,783 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:35,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1722287069, now seen corresponding path program 1 times [2018-12-02 05:53:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:35,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:35,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:35,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 05:53:35,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:35,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:35,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:35,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:35,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:35,834 INFO L87 Difference]: Start difference. First operand 1967 states and 3047 transitions. Second operand 4 states. [2018-12-02 05:53:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:36,134 INFO L93 Difference]: Finished difference Result 4079 states and 6292 transitions. [2018-12-02 05:53:36,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:36,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-12-02 05:53:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:36,137 INFO L225 Difference]: With dead ends: 4079 [2018-12-02 05:53:36,137 INFO L226 Difference]: Without dead ends: 2137 [2018-12-02 05:53:36,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:36,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-02 05:53:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-02 05:53:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3042 transitions. [2018-12-02 05:53:36,222 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3042 transitions. Word has length 192 [2018-12-02 05:53:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:36,222 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3042 transitions. [2018-12-02 05:53:36,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3042 transitions. [2018-12-02 05:53:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-02 05:53:36,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:36,224 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:36,224 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:36,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 633015308, now seen corresponding path program 1 times [2018-12-02 05:53:36,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:36,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:36,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:36,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:36,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 05:53:36,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:36,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:36,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:36,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:36,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:36,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:36,281 INFO L87 Difference]: Start difference. First operand 1967 states and 3042 transitions. Second operand 4 states. [2018-12-02 05:53:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:36,771 INFO L93 Difference]: Finished difference Result 4079 states and 6282 transitions. [2018-12-02 05:53:36,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:36,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2018-12-02 05:53:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:36,774 INFO L225 Difference]: With dead ends: 4079 [2018-12-02 05:53:36,774 INFO L226 Difference]: Without dead ends: 2137 [2018-12-02 05:53:36,776 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-02 05:53:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-02 05:53:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-02 05:53:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3037 transitions. [2018-12-02 05:53:36,863 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3037 transitions. Word has length 193 [2018-12-02 05:53:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:36,863 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3037 transitions. [2018-12-02 05:53:36,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3037 transitions. [2018-12-02 05:53:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-02 05:53:36,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:36,866 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:36,866 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:36,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -258735071, now seen corresponding path program 1 times [2018-12-02 05:53:36,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:36,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:36,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:36,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:36,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 05:53:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:36,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:36,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:36,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:36,931 INFO L87 Difference]: Start difference. First operand 1967 states and 3037 transitions. Second operand 4 states. [2018-12-02 05:53:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:37,354 INFO L93 Difference]: Finished difference Result 4079 states and 6272 transitions. [2018-12-02 05:53:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:37,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-12-02 05:53:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:37,357 INFO L225 Difference]: With dead ends: 4079 [2018-12-02 05:53:37,357 INFO L226 Difference]: Without dead ends: 2137 [2018-12-02 05:53:37,359 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-02 05:53:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-02 05:53:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-02 05:53:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3032 transitions. [2018-12-02 05:53:37,446 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3032 transitions. Word has length 194 [2018-12-02 05:53:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:37,446 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3032 transitions. [2018-12-02 05:53:37,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3032 transitions. [2018-12-02 05:53:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 05:53:37,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:37,448 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-02 05:53:37,448 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:37,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash 258593637, now seen corresponding path program 1 times [2018-12-02 05:53:37,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:37,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:37,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:37,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:37,492 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-02 05:53:37,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:37,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:37,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:37,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:37,493 INFO L87 Difference]: Start difference. First operand 1967 states and 3032 transitions. Second operand 4 states. [2018-12-02 05:53:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:37,771 INFO L93 Difference]: Finished difference Result 3984 states and 6132 transitions. [2018-12-02 05:53:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:37,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-02 05:53:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:37,773 INFO L225 Difference]: With dead ends: 3984 [2018-12-02 05:53:37,773 INFO L226 Difference]: Without dead ends: 2042 [2018-12-02 05:53:37,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2018-12-02 05:53:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1967. [2018-12-02 05:53:37,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3027 transitions. [2018-12-02 05:53:37,861 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3027 transitions. Word has length 195 [2018-12-02 05:53:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:37,861 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3027 transitions. [2018-12-02 05:53:37,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3027 transitions. [2018-12-02 05:53:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-02 05:53:37,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:37,863 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:37,863 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:37,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 410530353, now seen corresponding path program 1 times [2018-12-02 05:53:37,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:37,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 05:53:37,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:37,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:37,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:37,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:37,914 INFO L87 Difference]: Start difference. First operand 1967 states and 3027 transitions. Second operand 4 states. [2018-12-02 05:53:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:38,302 INFO L93 Difference]: Finished difference Result 4079 states and 6252 transitions. [2018-12-02 05:53:38,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:38,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-02 05:53:38,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:38,304 INFO L225 Difference]: With dead ends: 4079 [2018-12-02 05:53:38,304 INFO L226 Difference]: Without dead ends: 2137 [2018-12-02 05:53:38,306 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-02 05:53:38,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-02 05:53:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-02 05:53:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3022 transitions. [2018-12-02 05:53:38,392 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3022 transitions. Word has length 195 [2018-12-02 05:53:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:38,393 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3022 transitions. [2018-12-02 05:53:38,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3022 transitions. [2018-12-02 05:53:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 05:53:38,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:38,394 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-02 05:53:38,394 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:38,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash 678171637, now seen corresponding path program 1 times [2018-12-02 05:53:38,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:38,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:38,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:38,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:38,442 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-02 05:53:38,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:38,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:38,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:38,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:38,443 INFO L87 Difference]: Start difference. First operand 1967 states and 3022 transitions. Second operand 4 states. [2018-12-02 05:53:38,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:38,901 INFO L93 Difference]: Finished difference Result 3984 states and 6112 transitions. [2018-12-02 05:53:38,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:38,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-02 05:53:38,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:38,903 INFO L225 Difference]: With dead ends: 3984 [2018-12-02 05:53:38,903 INFO L226 Difference]: Without dead ends: 2042 [2018-12-02 05:53:38,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:38,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2018-12-02 05:53:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1967. [2018-12-02 05:53:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3017 transitions. [2018-12-02 05:53:38,991 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3017 transitions. Word has length 196 [2018-12-02 05:53:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:38,991 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3017 transitions. [2018-12-02 05:53:38,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3017 transitions. [2018-12-02 05:53:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 05:53:38,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:38,993 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:53:38,993 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:38,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2068321882, now seen corresponding path program 1 times [2018-12-02 05:53:38,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:38,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:38,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:38,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:38,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 05:53:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:39,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:39,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:39,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:39,055 INFO L87 Difference]: Start difference. First operand 1967 states and 3017 transitions. Second operand 4 states. [2018-12-02 05:53:39,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:39,402 INFO L93 Difference]: Finished difference Result 4029 states and 6172 transitions. [2018-12-02 05:53:39,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:39,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-02 05:53:39,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:39,405 INFO L225 Difference]: With dead ends: 4029 [2018-12-02 05:53:39,405 INFO L226 Difference]: Without dead ends: 2087 [2018-12-02 05:53:39,406 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-02 05:53:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-02 05:53:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-02 05:53:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3012 transitions. [2018-12-02 05:53:39,494 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3012 transitions. Word has length 196 [2018-12-02 05:53:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:39,494 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3012 transitions. [2018-12-02 05:53:39,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3012 transitions. [2018-12-02 05:53:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-02 05:53:39,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:39,496 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-02 05:53:39,496 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:39,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:39,496 INFO L82 PathProgramCache]: Analyzing trace with hash 728937024, now seen corresponding path program 1 times [2018-12-02 05:53:39,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:39,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:39,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:39,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:53:39,545 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-02 05:53:39,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:53:39,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:53:39,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:53:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:53:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:53:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:53:39,546 INFO L87 Difference]: Start difference. First operand 1967 states and 3012 transitions. Second operand 4 states. [2018-12-02 05:53:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:53:39,800 INFO L93 Difference]: Finished difference Result 3969 states and 6075 transitions. [2018-12-02 05:53:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:53:39,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-02 05:53:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:53:39,802 INFO L225 Difference]: With dead ends: 3969 [2018-12-02 05:53:39,802 INFO L226 Difference]: Without dead ends: 2027 [2018-12-02 05:53:39,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:53:39,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2018-12-02 05:53:39,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1967. [2018-12-02 05:53:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-02 05:53:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3007 transitions. [2018-12-02 05:53:39,892 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3007 transitions. Word has length 197 [2018-12-02 05:53:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:53:39,892 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3007 transitions. [2018-12-02 05:53:39,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:53:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3007 transitions. [2018-12-02 05:53:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 05:53:39,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:53:39,893 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-02 05:53:39,893 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:53:39,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:53:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2147212109, now seen corresponding path program 1 times [2018-12-02 05:53:39,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:53:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:53:39,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:53:39,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:53:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:53:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:53:40,015 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:53:40,052 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 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-02 05:53:40,053 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24591 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-02 05:53:40,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:53:40 BoogieIcfgContainer [2018-12-02 05:53:40,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:53:40,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:53:40,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:53:40,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:53:40,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:53:05" (3/4) ... [2018-12-02 05:53:40,100 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:53:40,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:53:40,101 INFO L168 Benchmark]: Toolchain (without parser) took 35313.03 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 635.4 MB). Free memory was 947.0 MB in the beginning and 1.4 GB in the end (delta: -477.4 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,101 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:53:40,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,102 INFO L168 Benchmark]: Boogie Preprocessor took 49.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,102 INFO L168 Benchmark]: RCFGBuilder took 573.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,102 INFO L168 Benchmark]: TraceAbstraction took 34280.95 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 515.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -423.2 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:40,102 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.7 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:53:40,103 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 573.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34280.95 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 515.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -423.2 MB). Peak memory consumption was 92.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.7 GB. Free memory is still 1.4 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 24588 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 24591 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)=24609, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24590: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))={24597:0}, malloc(sizeof(SSL_CTX))={24612:0}, malloc(sizeof(SSL_SESSION))={24579:0}, malloc(sizeof(struct ssl3_state_st))={24603:0}, s={24597:0}, SSLv3_server_data={24590:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8464, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=24581, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8496, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=24581, blastFlag=2, got_new_session=1, init=1, ret=5, s={24597:0}, s={24597:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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=5, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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] [L1583] COND FALSE !(ret <= 0) [L1588] s->state = 8672 [L1589] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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] [L1590] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=24581, blastFlag=3, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24590: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 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=24581, blastFlag=4, got_new_session=1, init=1, ret=6, s={24597:0}, s={24597:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=24581, blastFlag=4, got_new_session=1, init=1, num1=0, ret=6, s={24597:0}, s={24597:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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=6, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24590: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, 34.2s OverallTime, 82 OverallIterations, 7 TraceHistogramMax, 23.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18791 SDtfs, 6316 SDslu, 28703 SDs, 0 SdLazy, 19456 SolverSat, 912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 873 GetRequests, 480 SyntacticMatches, 129 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2022occurred in iteration=72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 81 MinimizatonAttempts, 11616 StatesRemovedByMinimization, 80 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 10308 NumberOfCodeBlocks, 10308 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 10196 ConstructedInterpolants, 206 QuantifiedInterpolants, 6472856 SizeOfPredicates, 17 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 83 InterpolantComputations, 80 PerfectInterpolantSequences, 10226/10656 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-02 05:53:41,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:53:41,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:53:41,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:53:41,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:53:41,386 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:53:41,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:53:41,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:53:41,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:53:41,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:53:41,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:53:41,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:53:41,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:53:41,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:53:41,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:53:41,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:53:41,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:53:41,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:53:41,393 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:53:41,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:53:41,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:53:41,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:53:41,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:53:41,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:53:41,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:53:41,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:53:41,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:53:41,397 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:53:41,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:53:41,398 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:53:41,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:53:41,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:53:41,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:53:41,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:53:41,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:53:41,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:53:41,400 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 05:53:41,407 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:53:41,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:53:41,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:53:41,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:53:41,408 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:53:41,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:53:41,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:53:41,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:53:41,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:53:41,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:53:41,411 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 05:53:41,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:53:41,411 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 05:53:41,411 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 05:53:41,411 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_a4410854-d992-41ee-804c-19dbd3efb0ae/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 -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-12-02 05:53:41,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:53:41,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:53:41,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:53:41,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:53:41,438 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:53:41,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-12-02 05:53:41,474 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/51f64ba64/11879c49e0174024b345c3d03acc8541/FLAGad0f175d2 [2018-12-02 05:53:41,936 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:53:41,937 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-12-02 05:53:41,947 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/51f64ba64/11879c49e0174024b345c3d03acc8541/FLAGad0f175d2 [2018-12-02 05:53:42,455 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a4410854-d992-41ee-804c-19dbd3efb0ae/bin-2019/utaipan/data/51f64ba64/11879c49e0174024b345c3d03acc8541 [2018-12-02 05:53:42,457 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:53:42,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:53:42,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:53:42,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:53:42,460 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:53:42,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:53:42" (1/1) ... [2018-12-02 05:53:42,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408d2e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:53:42, skipping insertion in model container [2018-12-02 05:53:42,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:53:42" (1/1) ... [2018-12-02 05:53:42,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:53:42,494 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:53:42,725 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:53:42,738 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:53:42,850 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:53:42,851 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-02 05:53:42,854 INFO L168 Benchmark]: Toolchain (without parser) took 397.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:42,856 INFO L168 Benchmark]: CDTParser took 0.13 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-02 05:53:42,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:53:42,858 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.13 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 395.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 46.1 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...