./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_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_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/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 d06f77684af1a50a152dd1d7247c10847b7d2ace .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/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 d06f77684af1a50a152dd1d7247c10847b7d2ace ........................................................................................................................................................................... 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 13:05:48,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:05:48,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:05:48,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:05:48,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:05:48,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:05:48,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:05:48,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:05:48,011 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:05:48,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:05:48,012 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:05:48,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:05:48,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:05:48,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:05:48,013 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:05:48,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:05:48,014 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:05:48,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:05:48,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:05:48,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:05:48,017 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:05:48,018 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:05:48,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:05:48,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:05:48,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:05:48,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:05:48,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:05:48,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:05:48,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:05:48,021 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:05:48,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:05:48,022 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:05:48,022 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:05:48,022 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:05:48,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:05:48,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:05:48,023 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 13:05:48,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:05:48,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:05:48,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:05:48,031 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:05:48,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 13:05:48,031 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 13:05:48,031 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 13:05:48,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:05:48,032 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:05:48,033 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:05:48,033 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:05:48,034 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 13:05:48,034 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 13:05:48,035 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_3812264e-c798-4694-9d7d-8395d101cbc3/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-12-02 13:05:48,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:05:48,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:05:48,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:05:48,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:05:48,062 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:05:48,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-02 13:05:48,101 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/8c8e11107/d8b5c381580445dc88caddb83d7da2e7/FLAGbec28f563 [2018-12-02 13:05:48,484 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:05:48,484 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-02 13:05:48,493 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/8c8e11107/d8b5c381580445dc88caddb83d7da2e7/FLAGbec28f563 [2018-12-02 13:05:48,502 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/8c8e11107/d8b5c381580445dc88caddb83d7da2e7 [2018-12-02 13:05:48,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:05:48,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:05:48,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:05:48,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:05:48,508 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:05:48,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fde7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48, skipping insertion in model container [2018-12-02 13:05:48,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:05:48,543 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:05:48,777 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:05:48,790 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:05:48,861 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:05:48,877 INFO L195 MainTranslator]: Completed translation [2018-12-02 13:05:48,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48 WrapperNode [2018-12-02 13:05:48,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 13:05:48,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 13:05:48,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 13:05:48,879 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 13:05:48,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 13:05:48,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 13:05:48,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 13:05:48,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 13:05:48,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... [2018-12-02 13:05:48,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 13:05:48,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 13:05:48,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 13:05:48,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 13:05:48,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/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 13:05:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 13:05:49,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 13:05:49,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 13:05:49,015 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 13:05:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 13:05:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 13:05:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 13:05:49,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 13:05:49,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 13:05:49,196 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 13:05:49,196 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 13:05:49,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 13:05:49,543 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 13:05:49,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:49 BoogieIcfgContainer [2018-12-02 13:05:49,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 13:05:49,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 13:05:49,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 13:05:49,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 13:05:49,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:05:48" (1/3) ... [2018-12-02 13:05:49,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fcc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:05:49, skipping insertion in model container [2018-12-02 13:05:49,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:05:48" (2/3) ... [2018-12-02 13:05:49,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9fcc3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:05:49, skipping insertion in model container [2018-12-02 13:05:49,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:49" (3/3) ... [2018-12-02 13:05:49,548 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-02 13:05:49,554 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 13:05:49,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 13:05:49,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 13:05:49,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 13:05:49,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 13:05:49,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 13:05:49,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 13:05:49,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 13:05:49,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 13:05:49,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 13:05:49,586 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 13:05:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2018-12-02 13:05:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 13:05:49,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:49,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:49,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:49,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash 437631585, now seen corresponding path program 1 times [2018-12-02 13:05:49,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:49,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:49,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:49,788 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 13:05:49,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:49,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:49,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:49,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:49,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:49,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:49,803 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2018-12-02 13:05:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:50,048 INFO L93 Difference]: Finished difference Result 343 states and 578 transitions. [2018-12-02 13:05:50,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:50,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-02 13:05:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:50,058 INFO L225 Difference]: With dead ends: 343 [2018-12-02 13:05:50,058 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 13:05:50,060 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 13:05:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 13:05:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2018-12-02 13:05:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-02 13:05:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2018-12-02 13:05:50,089 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 48 [2018-12-02 13:05:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:50,089 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2018-12-02 13:05:50,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2018-12-02 13:05:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 13:05:50,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:50,091 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:50,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:50,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1695133812, now seen corresponding path program 1 times [2018-12-02 13:05:50,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:50,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:50,173 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 13:05:50,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:50,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:50,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:50,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:50,174 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2018-12-02 13:05:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:50,351 INFO L93 Difference]: Finished difference Result 306 states and 469 transitions. [2018-12-02 13:05:50,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:50,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 13:05:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:50,352 INFO L225 Difference]: With dead ends: 306 [2018-12-02 13:05:50,353 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 13:05:50,353 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 13:05:50,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 13:05:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2018-12-02 13:05:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-02 13:05:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2018-12-02 13:05:50,362 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 61 [2018-12-02 13:05:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:50,362 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2018-12-02 13:05:50,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2018-12-02 13:05:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 13:05:50,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:50,363 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:50,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:50,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash -85583116, now seen corresponding path program 1 times [2018-12-02 13:05:50,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:50,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:50,443 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 13:05:50,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:50,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:05:50,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:50,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:05:50,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:05:50,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:05:50,444 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 5 states. [2018-12-02 13:05:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:50,711 INFO L93 Difference]: Finished difference Result 310 states and 477 transitions. [2018-12-02 13:05:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 13:05:50,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 13:05:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:50,712 INFO L225 Difference]: With dead ends: 310 [2018-12-02 13:05:50,712 INFO L226 Difference]: Without dead ends: 178 [2018-12-02 13:05:50,713 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 13:05:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-02 13:05:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-02 13:05:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 13:05:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2018-12-02 13:05:50,719 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 62 [2018-12-02 13:05:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:50,720 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2018-12-02 13:05:50,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:05:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2018-12-02 13:05:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 13:05:50,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:50,721 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:50,721 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:50,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1712183139, now seen corresponding path program 1 times [2018-12-02 13:05:50,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:50,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:50,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:50,785 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 13:05:50,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:50,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:50,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:50,786 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2018-12-02 13:05:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:50,949 INFO L93 Difference]: Finished difference Result 343 states and 517 transitions. [2018-12-02 13:05:50,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:50,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 13:05:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:50,950 INFO L225 Difference]: With dead ends: 343 [2018-12-02 13:05:50,950 INFO L226 Difference]: Without dead ends: 191 [2018-12-02 13:05:50,951 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 13:05:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-02 13:05:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2018-12-02 13:05:50,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 13:05:50,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2018-12-02 13:05:50,956 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 62 [2018-12-02 13:05:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:50,956 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2018-12-02 13:05:50,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2018-12-02 13:05:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 13:05:50,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:50,957 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:50,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:50,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1571456452, now seen corresponding path program 1 times [2018-12-02 13:05:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:50,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:50,991 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 13:05:50,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:50,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:50,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:50,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:50,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:50,992 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2018-12-02 13:05:51,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:51,131 INFO L93 Difference]: Finished difference Result 342 states and 515 transitions. [2018-12-02 13:05:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:51,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 13:05:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:51,132 INFO L225 Difference]: With dead ends: 342 [2018-12-02 13:05:51,132 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 13:05:51,133 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 13:05:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 13:05:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-02 13:05:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 13:05:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2018-12-02 13:05:51,137 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 62 [2018-12-02 13:05:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:51,137 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2018-12-02 13:05:51,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2018-12-02 13:05:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 13:05:51,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:51,138 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:51,138 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:51,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 420222575, now seen corresponding path program 1 times [2018-12-02 13:05:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:51,170 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 13:05:51,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:51,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:51,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:51,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:51,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:51,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:51,171 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand 4 states. [2018-12-02 13:05:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:51,306 INFO L93 Difference]: Finished difference Result 342 states and 514 transitions. [2018-12-02 13:05:51,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:51,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 13:05:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:51,307 INFO L225 Difference]: With dead ends: 342 [2018-12-02 13:05:51,307 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 13:05:51,307 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 13:05:51,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 13:05:51,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-02 13:05:51,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 13:05:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2018-12-02 13:05:51,311 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 63 [2018-12-02 13:05:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:51,311 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2018-12-02 13:05:51,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2018-12-02 13:05:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 13:05:51,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:51,312 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:51,312 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:51,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1528243712, now seen corresponding path program 1 times [2018-12-02 13:05:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:51,348 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 13:05:51,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:51,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:51,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:51,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:51,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:51,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:51,349 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand 4 states. [2018-12-02 13:05:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:51,486 INFO L93 Difference]: Finished difference Result 342 states and 513 transitions. [2018-12-02 13:05:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:51,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 13:05:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:51,487 INFO L225 Difference]: With dead ends: 342 [2018-12-02 13:05:51,487 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 13:05:51,488 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 13:05:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 13:05:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2018-12-02 13:05:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-02 13:05:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2018-12-02 13:05:51,492 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 64 [2018-12-02 13:05:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:51,492 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2018-12-02 13:05:51,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2018-12-02 13:05:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 13:05:51,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:51,492 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:51,493 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:51,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1666509205, now seen corresponding path program 1 times [2018-12-02 13:05:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:51,523 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 13:05:51,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:51,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:51,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:51,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:51,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:51,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:51,524 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 4 states. [2018-12-02 13:05:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:51,673 INFO L93 Difference]: Finished difference Result 371 states and 559 transitions. [2018-12-02 13:05:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:51,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 13:05:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:51,674 INFO L225 Difference]: With dead ends: 371 [2018-12-02 13:05:51,674 INFO L226 Difference]: Without dead ends: 219 [2018-12-02 13:05:51,674 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 13:05:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-02 13:05:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2018-12-02 13:05:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 300 transitions. [2018-12-02 13:05:51,679 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 300 transitions. Word has length 65 [2018-12-02 13:05:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:51,680 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 300 transitions. [2018-12-02 13:05:51,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 300 transitions. [2018-12-02 13:05:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 13:05:51,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:51,681 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:51,681 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:51,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1513044012, now seen corresponding path program 1 times [2018-12-02 13:05:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:51,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:51,729 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 13:05:51,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:51,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:51,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:51,729 INFO L87 Difference]: Start difference. First operand 199 states and 300 transitions. Second operand 4 states. [2018-12-02 13:05:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:51,866 INFO L93 Difference]: Finished difference Result 386 states and 586 transitions. [2018-12-02 13:05:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:51,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 13:05:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:51,867 INFO L225 Difference]: With dead ends: 386 [2018-12-02 13:05:51,867 INFO L226 Difference]: Without dead ends: 212 [2018-12-02 13:05:51,868 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 13:05:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-02 13:05:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-12-02 13:05:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2018-12-02 13:05:51,873 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 65 [2018-12-02 13:05:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:51,874 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2018-12-02 13:05:51,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2018-12-02 13:05:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 13:05:51,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:51,875 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:51,875 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:51,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash -38920251, now seen corresponding path program 1 times [2018-12-02 13:05:51,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:51,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:51,917 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 13:05:51,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:51,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:51,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:51,918 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand 4 states. [2018-12-02 13:05:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:52,074 INFO L93 Difference]: Finished difference Result 376 states and 573 transitions. [2018-12-02 13:05:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:52,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 13:05:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:52,075 INFO L225 Difference]: With dead ends: 376 [2018-12-02 13:05:52,075 INFO L226 Difference]: Without dead ends: 202 [2018-12-02 13:05:52,076 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 13:05:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-02 13:05:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-12-02 13:05:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2018-12-02 13:05:52,082 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 66 [2018-12-02 13:05:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:52,083 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2018-12-02 13:05:52,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2018-12-02 13:05:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 13:05:52,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:52,084 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:52,084 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:52,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash 690517208, now seen corresponding path program 1 times [2018-12-02 13:05:52,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:52,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:52,132 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 13:05:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:52,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:52,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:52,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:52,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:52,133 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 4 states. [2018-12-02 13:05:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:52,300 INFO L93 Difference]: Finished difference Result 393 states and 593 transitions. [2018-12-02 13:05:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:52,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 13:05:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:52,301 INFO L225 Difference]: With dead ends: 393 [2018-12-02 13:05:52,301 INFO L226 Difference]: Without dead ends: 219 [2018-12-02 13:05:52,302 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 13:05:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-02 13:05:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2018-12-02 13:05:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 297 transitions. [2018-12-02 13:05:52,309 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 297 transitions. Word has length 78 [2018-12-02 13:05:52,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:52,309 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 297 transitions. [2018-12-02 13:05:52,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 297 transitions. [2018-12-02 13:05:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 13:05:52,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:52,310 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:52,310 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:52,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:52,311 INFO L82 PathProgramCache]: Analyzing trace with hash -771445551, now seen corresponding path program 1 times [2018-12-02 13:05:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:52,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:52,359 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 13:05:52,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:52,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:52,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:52,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:52,360 INFO L87 Difference]: Start difference. First operand 199 states and 297 transitions. Second operand 4 states. [2018-12-02 13:05:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:52,539 INFO L93 Difference]: Finished difference Result 391 states and 589 transitions. [2018-12-02 13:05:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:52,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 13:05:52,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:52,540 INFO L225 Difference]: With dead ends: 391 [2018-12-02 13:05:52,540 INFO L226 Difference]: Without dead ends: 217 [2018-12-02 13:05:52,541 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 13:05:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-02 13:05:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 199. [2018-12-02 13:05:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2018-12-02 13:05:52,545 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 79 [2018-12-02 13:05:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:52,545 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2018-12-02 13:05:52,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2018-12-02 13:05:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 13:05:52,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:52,545 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:52,545 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:52,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -630718864, now seen corresponding path program 1 times [2018-12-02 13:05:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:52,574 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 13:05:52,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:52,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:52,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:52,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:52,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:52,575 INFO L87 Difference]: Start difference. First operand 199 states and 296 transitions. Second operand 4 states. [2018-12-02 13:05:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:52,760 INFO L93 Difference]: Finished difference Result 390 states and 586 transitions. [2018-12-02 13:05:52,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:52,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 13:05:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:52,761 INFO L225 Difference]: With dead ends: 390 [2018-12-02 13:05:52,762 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 13:05:52,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:05:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 13:05:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-02 13:05:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 295 transitions. [2018-12-02 13:05:52,766 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 295 transitions. Word has length 79 [2018-12-02 13:05:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:52,767 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 295 transitions. [2018-12-02 13:05:52,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:52,767 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 295 transitions. [2018-12-02 13:05:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 13:05:52,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:52,768 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:52,768 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:52,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -481683269, now seen corresponding path program 1 times [2018-12-02 13:05:52,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:52,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:52,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:52,813 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 13:05:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:52,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:52,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:52,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:52,814 INFO L87 Difference]: Start difference. First operand 199 states and 295 transitions. Second operand 4 states. [2018-12-02 13:05:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:53,004 INFO L93 Difference]: Finished difference Result 390 states and 584 transitions. [2018-12-02 13:05:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:53,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 13:05:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:53,005 INFO L225 Difference]: With dead ends: 390 [2018-12-02 13:05:53,006 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 13:05:53,006 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 13:05:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 13:05:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-02 13:05:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 294 transitions. [2018-12-02 13:05:53,010 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 294 transitions. Word has length 80 [2018-12-02 13:05:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:53,010 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 294 transitions. [2018-12-02 13:05:53,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 294 transitions. [2018-12-02 13:05:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 13:05:53,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:53,011 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:53,011 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:53,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -661033676, now seen corresponding path program 1 times [2018-12-02 13:05:53,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:53,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:53,048 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 13:05:53,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:53,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:53,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:53,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:53,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:53,049 INFO L87 Difference]: Start difference. First operand 199 states and 294 transitions. Second operand 4 states. [2018-12-02 13:05:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:53,194 INFO L93 Difference]: Finished difference Result 390 states and 582 transitions. [2018-12-02 13:05:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:53,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 13:05:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:53,195 INFO L225 Difference]: With dead ends: 390 [2018-12-02 13:05:53,195 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 13:05:53,195 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 13:05:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 13:05:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-02 13:05:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 293 transitions. [2018-12-02 13:05:53,202 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 293 transitions. Word has length 81 [2018-12-02 13:05:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:53,202 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 293 transitions. [2018-12-02 13:05:53,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 293 transitions. [2018-12-02 13:05:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 13:05:53,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:53,203 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:53,203 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:53,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash -661166304, now seen corresponding path program 1 times [2018-12-02 13:05:53,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:53,261 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 13:05:53,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:53,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:53,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:53,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:53,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:53,262 INFO L87 Difference]: Start difference. First operand 199 states and 293 transitions. Second operand 4 states. [2018-12-02 13:05:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:53,427 INFO L93 Difference]: Finished difference Result 390 states and 580 transitions. [2018-12-02 13:05:53,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:53,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 13:05:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:53,428 INFO L225 Difference]: With dead ends: 390 [2018-12-02 13:05:53,428 INFO L226 Difference]: Without dead ends: 216 [2018-12-02 13:05:53,429 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 13:05:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-02 13:05:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2018-12-02 13:05:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 292 transitions. [2018-12-02 13:05:53,433 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 292 transitions. Word has length 82 [2018-12-02 13:05:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:53,433 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 292 transitions. [2018-12-02 13:05:53,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 292 transitions. [2018-12-02 13:05:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 13:05:53,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:53,434 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:53,434 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:53,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 599484921, now seen corresponding path program 1 times [2018-12-02 13:05:53,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:53,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:53,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:53,471 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 13:05:53,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:53,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:53,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:53,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:53,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:53,472 INFO L87 Difference]: Start difference. First operand 199 states and 292 transitions. Second operand 4 states. [2018-12-02 13:05:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:53,617 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-02 13:05:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:53,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 13:05:53,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:53,618 INFO L225 Difference]: With dead ends: 380 [2018-12-02 13:05:53,618 INFO L226 Difference]: Without dead ends: 206 [2018-12-02 13:05:53,618 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 13:05:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-02 13:05:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2018-12-02 13:05:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-02 13:05:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2018-12-02 13:05:53,622 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 83 [2018-12-02 13:05:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:53,623 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2018-12-02 13:05:53,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2018-12-02 13:05:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 13:05:53,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:53,623 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 13:05:53,624 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:53,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -401384415, now seen corresponding path program 1 times [2018-12-02 13:05:53,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:53,667 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 13:05:53,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:53,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:53,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:53,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:53,668 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand 4 states. [2018-12-02 13:05:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:53,926 INFO L93 Difference]: Finished difference Result 483 states and 724 transitions. [2018-12-02 13:05:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:53,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 13:05:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:53,927 INFO L225 Difference]: With dead ends: 483 [2018-12-02 13:05:53,927 INFO L226 Difference]: Without dead ends: 309 [2018-12-02 13:05:53,928 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 13:05:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-02 13:05:53,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2018-12-02 13:05:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-02 13:05:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2018-12-02 13:05:53,936 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 87 [2018-12-02 13:05:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:53,936 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2018-12-02 13:05:53,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2018-12-02 13:05:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 13:05:53,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:53,937 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 13:05:53,937 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:53,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1773191713, now seen corresponding path program 1 times [2018-12-02 13:05:53,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:53,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:53,996 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 13:05:53,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:53,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:53,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:53,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:53,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:53,997 INFO L87 Difference]: Start difference. First operand 240 states and 364 transitions. Second operand 4 states. [2018-12-02 13:05:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:54,194 INFO L93 Difference]: Finished difference Result 504 states and 774 transitions. [2018-12-02 13:05:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:54,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 13:05:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:54,195 INFO L225 Difference]: With dead ends: 504 [2018-12-02 13:05:54,195 INFO L226 Difference]: Without dead ends: 289 [2018-12-02 13:05:54,196 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 13:05:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-02 13:05:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2018-12-02 13:05:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-02 13:05:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2018-12-02 13:05:54,202 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 87 [2018-12-02 13:05:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:54,202 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2018-12-02 13:05:54,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2018-12-02 13:05:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 13:05:54,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:54,203 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, 1] [2018-12-02 13:05:54,203 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash 201712277, now seen corresponding path program 1 times [2018-12-02 13:05:54,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:54,276 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 13:05:54,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:54,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:54,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:54,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:54,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:54,277 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand 4 states. [2018-12-02 13:05:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:54,543 INFO L93 Difference]: Finished difference Result 565 states and 869 transitions. [2018-12-02 13:05:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:54,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 13:05:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:54,544 INFO L225 Difference]: With dead ends: 565 [2018-12-02 13:05:54,544 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 13:05:54,544 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 13:05:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 13:05:54,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2018-12-02 13:05:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2018-12-02 13:05:54,552 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 88 [2018-12-02 13:05:54,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:54,552 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2018-12-02 13:05:54,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2018-12-02 13:05:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:05:54,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:54,553 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:54,553 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:54,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash 306021836, now seen corresponding path program 1 times [2018-12-02 13:05:54,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:54,612 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 13:05:54,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:54,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:54,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:54,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:54,613 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2018-12-02 13:05:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:54,862 INFO L93 Difference]: Finished difference Result 566 states and 869 transitions. [2018-12-02 13:05:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:54,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 13:05:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:54,864 INFO L225 Difference]: With dead ends: 566 [2018-12-02 13:05:54,864 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 13:05:54,865 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 13:05:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 13:05:54,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2018-12-02 13:05:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2018-12-02 13:05:54,875 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 100 [2018-12-02 13:05:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:54,875 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2018-12-02 13:05:54,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2018-12-02 13:05:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 13:05:54,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:54,876 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:54,876 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:54,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 749922510, now seen corresponding path program 1 times [2018-12-02 13:05:54,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:54,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:54,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:54,936 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 13:05:54,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:54,936 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:54,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:54,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:54,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:54,937 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2018-12-02 13:05:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:55,112 INFO L93 Difference]: Finished difference Result 530 states and 814 transitions. [2018-12-02 13:05:55,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:55,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 13:05:55,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:55,113 INFO L225 Difference]: With dead ends: 530 [2018-12-02 13:05:55,113 INFO L226 Difference]: Without dead ends: 290 [2018-12-02 13:05:55,114 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 13:05:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-02 13:05:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2018-12-02 13:05:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2018-12-02 13:05:55,119 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 100 [2018-12-02 13:05:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:55,119 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2018-12-02 13:05:55,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2018-12-02 13:05:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 13:05:55,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:55,120 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:55,120 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:55,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:55,120 INFO L82 PathProgramCache]: Analyzing trace with hash 194099805, now seen corresponding path program 1 times [2018-12-02 13:05:55,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:55,174 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 13:05:55,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:55,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:55,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:55,175 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2018-12-02 13:05:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:55,411 INFO L93 Difference]: Finished difference Result 564 states and 863 transitions. [2018-12-02 13:05:55,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:55,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 13:05:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:55,413 INFO L225 Difference]: With dead ends: 564 [2018-12-02 13:05:55,413 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 13:05:55,413 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 13:05:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 13:05:55,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 265. [2018-12-02 13:05:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2018-12-02 13:05:55,419 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 101 [2018-12-02 13:05:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:55,419 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2018-12-02 13:05:55,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2018-12-02 13:05:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 13:05:55,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:55,420 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:55,420 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:55,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash 334826492, now seen corresponding path program 1 times [2018-12-02 13:05:55,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:55,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:55,453 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 13:05:55,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:55,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:55,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:55,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:55,454 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2018-12-02 13:05:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:55,694 INFO L93 Difference]: Finished difference Result 563 states and 860 transitions. [2018-12-02 13:05:55,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:55,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 13:05:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:55,695 INFO L225 Difference]: With dead ends: 563 [2018-12-02 13:05:55,695 INFO L226 Difference]: Without dead ends: 323 [2018-12-02 13:05:55,696 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 13:05:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-02 13:05:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-02 13:05:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2018-12-02 13:05:55,701 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 101 [2018-12-02 13:05:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:55,702 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2018-12-02 13:05:55,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2018-12-02 13:05:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 13:05:55,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:55,702 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:55,702 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:55,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1070118811, now seen corresponding path program 1 times [2018-12-02 13:05:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:55,738 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 13:05:55,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:55,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:55,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:55,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:55,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:55,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:55,738 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2018-12-02 13:05:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:55,892 INFO L93 Difference]: Finished difference Result 528 states and 806 transitions. [2018-12-02 13:05:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:55,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 13:05:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:55,893 INFO L225 Difference]: With dead ends: 528 [2018-12-02 13:05:55,893 INFO L226 Difference]: Without dead ends: 288 [2018-12-02 13:05:55,893 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 13:05:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-12-02 13:05:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 265. [2018-12-02 13:05:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2018-12-02 13:05:55,899 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 101 [2018-12-02 13:05:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:55,899 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2018-12-02 13:05:55,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2018-12-02 13:05:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 13:05:55,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:55,900 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:55,900 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:55,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1210845498, now seen corresponding path program 1 times [2018-12-02 13:05:55,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:55,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:55,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:55,930 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 13:05:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:55,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:55,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:55,931 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2018-12-02 13:05:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:56,087 INFO L93 Difference]: Finished difference Result 527 states and 803 transitions. [2018-12-02 13:05:56,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:56,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 13:05:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:56,088 INFO L225 Difference]: With dead ends: 527 [2018-12-02 13:05:56,088 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 13:05:56,089 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 13:05:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 13:05:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-02 13:05:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2018-12-02 13:05:56,098 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 101 [2018-12-02 13:05:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:56,098 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2018-12-02 13:05:56,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2018-12-02 13:05:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:05:56,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:56,099 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:56,100 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:56,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -614548305, now seen corresponding path program 1 times [2018-12-02 13:05:56,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:56,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:56,140 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 13:05:56,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:56,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:56,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:56,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:56,141 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2018-12-02 13:05:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:56,346 INFO L93 Difference]: Finished difference Result 563 states and 854 transitions. [2018-12-02 13:05:56,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:56,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 13:05:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:56,347 INFO L225 Difference]: With dead ends: 563 [2018-12-02 13:05:56,347 INFO L226 Difference]: Without dead ends: 323 [2018-12-02 13:05:56,347 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 13:05:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-02 13:05:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-02 13:05:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2018-12-02 13:05:56,357 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 102 [2018-12-02 13:05:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:56,357 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2018-12-02 13:05:56,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2018-12-02 13:05:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 13:05:56,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:56,358 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:56,358 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:56,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 772237105, now seen corresponding path program 1 times [2018-12-02 13:05:56,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:56,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:56,395 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 13:05:56,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:56,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:56,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:56,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:56,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:56,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:56,396 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2018-12-02 13:05:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:56,543 INFO L93 Difference]: Finished difference Result 527 states and 799 transitions. [2018-12-02 13:05:56,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:56,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 13:05:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:56,544 INFO L225 Difference]: With dead ends: 527 [2018-12-02 13:05:56,544 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 13:05:56,545 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 13:05:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 13:05:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-02 13:05:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2018-12-02 13:05:56,550 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 102 [2018-12-02 13:05:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2018-12-02 13:05:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2018-12-02 13:05:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 13:05:56,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:56,551 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:56,551 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:56,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -484882496, now seen corresponding path program 1 times [2018-12-02 13:05:56,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:56,593 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 13:05:56,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:56,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:56,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:56,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:56,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:56,594 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2018-12-02 13:05:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:56,817 INFO L93 Difference]: Finished difference Result 563 states and 850 transitions. [2018-12-02 13:05:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:56,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 13:05:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:56,819 INFO L225 Difference]: With dead ends: 563 [2018-12-02 13:05:56,819 INFO L226 Difference]: Without dead ends: 323 [2018-12-02 13:05:56,820 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 13:05:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-02 13:05:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-02 13:05:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2018-12-02 13:05:56,830 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 103 [2018-12-02 13:05:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:56,830 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2018-12-02 13:05:56,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2018-12-02 13:05:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 13:05:56,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:56,831 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:56,831 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:56,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash -444207746, now seen corresponding path program 1 times [2018-12-02 13:05:56,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:56,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:56,873 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 13:05:56,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:56,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:56,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:56,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:56,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:56,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:56,874 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2018-12-02 13:05:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:57,055 INFO L93 Difference]: Finished difference Result 527 states and 795 transitions. [2018-12-02 13:05:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:57,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 13:05:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:57,056 INFO L225 Difference]: With dead ends: 527 [2018-12-02 13:05:57,056 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 13:05:57,057 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 13:05:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 13:05:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-02 13:05:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2018-12-02 13:05:57,070 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 103 [2018-12-02 13:05:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:57,071 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2018-12-02 13:05:57,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2018-12-02 13:05:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:05:57,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:57,072 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:57,072 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:57,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 504552980, now seen corresponding path program 1 times [2018-12-02 13:05:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:57,121 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 13:05:57,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:57,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:57,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:57,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:57,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:57,122 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand 4 states. [2018-12-02 13:05:57,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:57,317 INFO L93 Difference]: Finished difference Result 563 states and 846 transitions. [2018-12-02 13:05:57,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:57,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 13:05:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:57,318 INFO L225 Difference]: With dead ends: 563 [2018-12-02 13:05:57,318 INFO L226 Difference]: Without dead ends: 323 [2018-12-02 13:05:57,318 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 13:05:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-02 13:05:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2018-12-02 13:05:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2018-12-02 13:05:57,327 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 104 [2018-12-02 13:05:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:57,327 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2018-12-02 13:05:57,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2018-12-02 13:05:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 13:05:57,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:57,328 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:57,328 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:57,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1765470230, now seen corresponding path program 1 times [2018-12-02 13:05:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:57,357 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 13:05:57,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:57,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:57,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:57,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:57,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:57,358 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand 4 states. [2018-12-02 13:05:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:57,519 INFO L93 Difference]: Finished difference Result 527 states and 791 transitions. [2018-12-02 13:05:57,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:57,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 13:05:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:57,521 INFO L225 Difference]: With dead ends: 527 [2018-12-02 13:05:57,521 INFO L226 Difference]: Without dead ends: 287 [2018-12-02 13:05:57,521 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 13:05:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-02 13:05:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-12-02 13:05:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2018-12-02 13:05:57,532 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 104 [2018-12-02 13:05:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:57,532 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2018-12-02 13:05:57,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2018-12-02 13:05:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 13:05:57,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:57,533 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:57,533 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:57,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:57,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1917922939, now seen corresponding path program 1 times [2018-12-02 13:05:57,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:57,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:57,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:57,588 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 13:05:57,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:57,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:57,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:57,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:57,589 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand 4 states. [2018-12-02 13:05:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:57,822 INFO L93 Difference]: Finished difference Result 553 states and 830 transitions. [2018-12-02 13:05:57,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:57,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 13:05:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:57,823 INFO L225 Difference]: With dead ends: 553 [2018-12-02 13:05:57,823 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 13:05:57,824 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 13:05:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 13:05:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2018-12-02 13:05:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 393 transitions. [2018-12-02 13:05:57,832 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 393 transitions. Word has length 105 [2018-12-02 13:05:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:57,832 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 393 transitions. [2018-12-02 13:05:57,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 393 transitions. [2018-12-02 13:05:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 13:05:57,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:57,833 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:05:57,833 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:57,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1484193853, now seen corresponding path program 1 times [2018-12-02 13:05:57,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:57,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:57,872 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 13:05:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:57,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:57,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:57,873 INFO L87 Difference]: Start difference. First operand 265 states and 393 transitions. Second operand 4 states. [2018-12-02 13:05:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:58,039 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-02 13:05:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:58,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 13:05:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:58,040 INFO L225 Difference]: With dead ends: 517 [2018-12-02 13:05:58,040 INFO L226 Difference]: Without dead ends: 277 [2018-12-02 13:05:58,040 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 13:05:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-02 13:05:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2018-12-02 13:05:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:58,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 392 transitions. [2018-12-02 13:05:58,050 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 392 transitions. Word has length 105 [2018-12-02 13:05:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:58,050 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 392 transitions. [2018-12-02 13:05:58,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 392 transitions. [2018-12-02 13:05:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 13:05:58,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:58,050 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] [2018-12-02 13:05:58,050 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:58,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash -791495905, now seen corresponding path program 1 times [2018-12-02 13:05:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:58,104 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 13:05:58,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:58,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:58,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:58,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:58,105 INFO L87 Difference]: Start difference. First operand 265 states and 392 transitions. Second operand 4 states. [2018-12-02 13:05:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:58,307 INFO L93 Difference]: Finished difference Result 553 states and 826 transitions. [2018-12-02 13:05:58,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:58,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-02 13:05:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:58,308 INFO L225 Difference]: With dead ends: 553 [2018-12-02 13:05:58,308 INFO L226 Difference]: Without dead ends: 313 [2018-12-02 13:05:58,309 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 13:05:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-02 13:05:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2018-12-02 13:05:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-02 13:05:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2018-12-02 13:05:58,317 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 109 [2018-12-02 13:05:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:58,317 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2018-12-02 13:05:58,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2018-12-02 13:05:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 13:05:58,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:58,317 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] [2018-12-02 13:05:58,318 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:58,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -112223651, now seen corresponding path program 1 times [2018-12-02 13:05:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:58,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:58,360 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 13:05:58,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:58,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:58,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:58,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:58,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:58,361 INFO L87 Difference]: Start difference. First operand 265 states and 391 transitions. Second operand 4 states. [2018-12-02 13:05:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:58,526 INFO L93 Difference]: Finished difference Result 558 states and 835 transitions. [2018-12-02 13:05:58,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:58,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-02 13:05:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:58,527 INFO L225 Difference]: With dead ends: 558 [2018-12-02 13:05:58,527 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 13:05:58,527 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 13:05:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 13:05:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-02 13:05:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2018-12-02 13:05:58,534 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 109 [2018-12-02 13:05:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:58,535 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2018-12-02 13:05:58,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2018-12-02 13:05:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 13:05:58,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:58,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:58,535 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:58,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:58,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1291133809, now seen corresponding path program 1 times [2018-12-02 13:05:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:58,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:58,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:58,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:58,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:58,591 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2018-12-02 13:05:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:58,783 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions. [2018-12-02 13:05:58,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:58,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-02 13:05:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:58,784 INFO L225 Difference]: With dead ends: 605 [2018-12-02 13:05:58,784 INFO L226 Difference]: Without dead ends: 339 [2018-12-02 13:05:58,785 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 13:05:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-02 13:05:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 291. [2018-12-02 13:05:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2018-12-02 13:05:58,792 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2018-12-02 13:05:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:58,792 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2018-12-02 13:05:58,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2018-12-02 13:05:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 13:05:58,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:58,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:58,793 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:58,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash 783035232, now seen corresponding path program 1 times [2018-12-02 13:05:58,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:58,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:58,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:58,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:58,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:58,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:58,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:58,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:58,846 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2018-12-02 13:05:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:59,022 INFO L93 Difference]: Finished difference Result 597 states and 899 transitions. [2018-12-02 13:05:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:59,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 13:05:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:59,023 INFO L225 Difference]: With dead ends: 597 [2018-12-02 13:05:59,023 INFO L226 Difference]: Without dead ends: 331 [2018-12-02 13:05:59,023 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 13:05:59,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-02 13:05:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-02 13:05:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2018-12-02 13:05:59,031 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 113 [2018-12-02 13:05:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:59,031 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2018-12-02 13:05:59,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2018-12-02 13:05:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 13:05:59,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:59,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:59,031 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:59,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2124455663, now seen corresponding path program 1 times [2018-12-02 13:05:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:59,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:59,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:59,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:59,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:59,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:59,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:59,064 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2018-12-02 13:05:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:59,249 INFO L93 Difference]: Finished difference Result 597 states and 897 transitions. [2018-12-02 13:05:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:59,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-02 13:05:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:59,250 INFO L225 Difference]: With dead ends: 597 [2018-12-02 13:05:59,250 INFO L226 Difference]: Without dead ends: 331 [2018-12-02 13:05:59,250 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 13:05:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-02 13:05:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-02 13:05:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2018-12-02 13:05:59,258 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 114 [2018-12-02 13:05:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:59,258 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2018-12-02 13:05:59,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2018-12-02 13:05:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 13:05:59,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:59,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:59,259 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:59,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:59,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1206405976, now seen corresponding path program 1 times [2018-12-02 13:05:59,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:59,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:59,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:59,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:59,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:59,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:59,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:59,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:59,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:59,304 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2018-12-02 13:05:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:59,504 INFO L93 Difference]: Finished difference Result 597 states and 895 transitions. [2018-12-02 13:05:59,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:59,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 13:05:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:59,505 INFO L225 Difference]: With dead ends: 597 [2018-12-02 13:05:59,505 INFO L226 Difference]: Without dead ends: 331 [2018-12-02 13:05:59,505 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 13:05:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-02 13:05:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-12-02 13:05:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2018-12-02 13:05:59,514 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 115 [2018-12-02 13:05:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:59,514 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2018-12-02 13:05:59,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2018-12-02 13:05:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 13:05:59,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:59,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:59,515 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:59,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2068078112, now seen corresponding path program 1 times [2018-12-02 13:05:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:59,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:59,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:59,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:59,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:59,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:59,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:59,560 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2018-12-02 13:05:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:59,745 INFO L93 Difference]: Finished difference Result 595 states and 891 transitions. [2018-12-02 13:05:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:59,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 13:05:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:59,747 INFO L225 Difference]: With dead ends: 595 [2018-12-02 13:05:59,747 INFO L226 Difference]: Without dead ends: 329 [2018-12-02 13:05:59,747 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 13:05:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-02 13:05:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2018-12-02 13:05:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2018-12-02 13:05:59,757 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 115 [2018-12-02 13:05:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:59,757 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2018-12-02 13:05:59,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2018-12-02 13:05:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 13:05:59,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:59,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:59,758 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:59,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2032466001, now seen corresponding path program 1 times [2018-12-02 13:05:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:05:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:05:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:05:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:05:59,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:05:59,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:05:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:05:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:05:59,798 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2018-12-02 13:05:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:05:59,966 INFO L93 Difference]: Finished difference Result 592 states and 885 transitions. [2018-12-02 13:05:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:05:59,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 13:05:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:05:59,967 INFO L225 Difference]: With dead ends: 592 [2018-12-02 13:05:59,967 INFO L226 Difference]: Without dead ends: 326 [2018-12-02 13:05:59,968 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 13:05:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-02 13:05:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2018-12-02 13:05:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:05:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2018-12-02 13:05:59,976 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 116 [2018-12-02 13:05:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:05:59,976 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2018-12-02 13:05:59,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:05:59,977 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2018-12-02 13:05:59,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 13:05:59,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:05:59,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:05:59,977 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:05:59,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:05:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -588722985, now seen corresponding path program 1 times [2018-12-02 13:05:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:05:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:05:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:05:59,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:05:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:00,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:00,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:00,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:00,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:00,012 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2018-12-02 13:06:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:00,184 INFO L93 Difference]: Finished difference Result 590 states and 880 transitions. [2018-12-02 13:06:00,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:00,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 13:06:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:00,186 INFO L225 Difference]: With dead ends: 590 [2018-12-02 13:06:00,186 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 13:06:00,187 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 13:06:00,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 13:06:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2018-12-02 13:06:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 429 transitions. [2018-12-02 13:06:00,196 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 429 transitions. Word has length 116 [2018-12-02 13:06:00,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:00,196 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 429 transitions. [2018-12-02 13:06:00,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 429 transitions. [2018-12-02 13:06:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 13:06:00,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:00,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:00,197 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:00,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1768836666, now seen corresponding path program 1 times [2018-12-02 13:06:00,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:00,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:00,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:00,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:00,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:00,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:00,234 INFO L87 Difference]: Start difference. First operand 291 states and 429 transitions. Second operand 4 states. [2018-12-02 13:06:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:00,419 INFO L93 Difference]: Finished difference Result 590 states and 878 transitions. [2018-12-02 13:06:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:00,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 13:06:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:00,421 INFO L225 Difference]: With dead ends: 590 [2018-12-02 13:06:00,421 INFO L226 Difference]: Without dead ends: 324 [2018-12-02 13:06:00,421 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 13:06:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-02 13:06:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2018-12-02 13:06:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 428 transitions. [2018-12-02 13:06:00,433 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 428 transitions. Word has length 119 [2018-12-02 13:06:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:00,433 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 428 transitions. [2018-12-02 13:06:00,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 428 transitions. [2018-12-02 13:06:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 13:06:00,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:00,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:00,434 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:00,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1760309670, now seen corresponding path program 1 times [2018-12-02 13:06:00,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:00,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:00,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:00,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:00,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:00,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:00,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:00,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:00,471 INFO L87 Difference]: Start difference. First operand 291 states and 428 transitions. Second operand 4 states. [2018-12-02 13:06:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:00,629 INFO L93 Difference]: Finished difference Result 584 states and 867 transitions. [2018-12-02 13:06:00,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:00,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 13:06:00,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:00,630 INFO L225 Difference]: With dead ends: 584 [2018-12-02 13:06:00,630 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 13:06:00,631 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 13:06:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 13:06:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-02 13:06:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2018-12-02 13:06:00,640 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 120 [2018-12-02 13:06:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:00,640 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2018-12-02 13:06:00,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2018-12-02 13:06:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 13:06:00,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:00,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:00,641 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:00,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2115803583, now seen corresponding path program 1 times [2018-12-02 13:06:00,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:00,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:00,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:00,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:00,683 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:00,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:00,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:00,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:00,684 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand 4 states. [2018-12-02 13:06:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:00,854 INFO L93 Difference]: Finished difference Result 584 states and 865 transitions. [2018-12-02 13:06:00,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:00,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 13:06:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:00,855 INFO L225 Difference]: With dead ends: 584 [2018-12-02 13:06:00,855 INFO L226 Difference]: Without dead ends: 318 [2018-12-02 13:06:00,856 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 13:06:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-02 13:06:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2018-12-02 13:06:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 426 transitions. [2018-12-02 13:06:00,864 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 426 transitions. Word has length 120 [2018-12-02 13:06:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:00,864 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 426 transitions. [2018-12-02 13:06:00,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:00,865 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 426 transitions. [2018-12-02 13:06:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 13:06:00,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:00,865 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:00,865 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:00,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash 757023499, now seen corresponding path program 1 times [2018-12-02 13:06:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:00,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:00,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:00,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:00,899 INFO L87 Difference]: Start difference. First operand 291 states and 426 transitions. Second operand 4 states. [2018-12-02 13:06:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:01,081 INFO L93 Difference]: Finished difference Result 581 states and 859 transitions. [2018-12-02 13:06:01,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:01,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 13:06:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:01,082 INFO L225 Difference]: With dead ends: 581 [2018-12-02 13:06:01,082 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 13:06:01,082 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 13:06:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 13:06:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2018-12-02 13:06:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2018-12-02 13:06:01,093 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 121 [2018-12-02 13:06:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:01,093 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2018-12-02 13:06:01,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2018-12-02 13:06:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 13:06:01,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:01,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:01,094 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:01,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1226818951, now seen corresponding path program 1 times [2018-12-02 13:06:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:01,151 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:01,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:01,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:01,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:01,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:01,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:01,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:01,152 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2018-12-02 13:06:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:01,529 INFO L93 Difference]: Finished difference Result 581 states and 857 transitions. [2018-12-02 13:06:01,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:01,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 13:06:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:01,533 INFO L225 Difference]: With dead ends: 581 [2018-12-02 13:06:01,533 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 13:06:01,534 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 13:06:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 13:06:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2018-12-02 13:06:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-02 13:06:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2018-12-02 13:06:01,559 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 122 [2018-12-02 13:06:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:01,560 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2018-12-02 13:06:01,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2018-12-02 13:06:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 13:06:01,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:01,560 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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 13:06:01,561 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:01,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:01,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1991161584, now seen corresponding path program 1 times [2018-12-02 13:06:01,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:01,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 13:06:01,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:01,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:01,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:01,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:01,597 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand 4 states. [2018-12-02 13:06:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:01,933 INFO L93 Difference]: Finished difference Result 629 states and 932 transitions. [2018-12-02 13:06:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:01,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 13:06:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:01,935 INFO L225 Difference]: With dead ends: 629 [2018-12-02 13:06:01,935 INFO L226 Difference]: Without dead ends: 363 [2018-12-02 13:06:01,936 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 13:06:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-02 13:06:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2018-12-02 13:06:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-02 13:06:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 481 transitions. [2018-12-02 13:06:01,955 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 481 transitions. Word has length 122 [2018-12-02 13:06:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:01,955 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 481 transitions. [2018-12-02 13:06:01,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 481 transitions. [2018-12-02 13:06:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 13:06:01,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:01,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:06:01,956 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:01,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash -513900749, now seen corresponding path program 1 times [2018-12-02 13:06:01,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:01,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:01,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:01,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:01,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:01,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:01,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:01,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:01,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:01,999 INFO L87 Difference]: Start difference. First operand 323 states and 481 transitions. Second operand 4 states. [2018-12-02 13:06:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:02,162 INFO L93 Difference]: Finished difference Result 642 states and 965 transitions. [2018-12-02 13:06:02,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:02,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 13:06:02,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:02,163 INFO L225 Difference]: With dead ends: 642 [2018-12-02 13:06:02,163 INFO L226 Difference]: Without dead ends: 344 [2018-12-02 13:06:02,164 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 13:06:02,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-02 13:06:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2018-12-02 13:06:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-02 13:06:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2018-12-02 13:06:02,174 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 123 [2018-12-02 13:06:02,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:02,174 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2018-12-02 13:06:02,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2018-12-02 13:06:02,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 13:06:02,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:02,175 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2018-12-02 13:06:02,175 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:02,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2136584504, now seen corresponding path program 1 times [2018-12-02 13:06:02,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:02,208 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:02,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:02,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:02,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:02,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:02,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:02,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:02,209 INFO L87 Difference]: Start difference. First operand 323 states and 480 transitions. Second operand 4 states. [2018-12-02 13:06:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:02,565 INFO L93 Difference]: Finished difference Result 729 states and 1100 transitions. [2018-12-02 13:06:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:02,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 13:06:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:02,567 INFO L225 Difference]: With dead ends: 729 [2018-12-02 13:06:02,567 INFO L226 Difference]: Without dead ends: 431 [2018-12-02 13:06:02,568 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 13:06:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-02 13:06:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2018-12-02 13:06:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 13:06:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 551 transitions. [2018-12-02 13:06:02,585 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 551 transitions. Word has length 123 [2018-12-02 13:06:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:02,586 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 551 transitions. [2018-12-02 13:06:02,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 551 transitions. [2018-12-02 13:06:02,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 13:06:02,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:02,587 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:02,587 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:02,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:02,587 INFO L82 PathProgramCache]: Analyzing trace with hash -594624781, now seen corresponding path program 1 times [2018-12-02 13:06:02,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:02,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 13:06:02,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:02,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:02,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:02,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:02,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:02,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:02,633 INFO L87 Difference]: Start difference. First operand 362 states and 551 transitions. Second operand 4 states. [2018-12-02 13:06:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:02,801 INFO L93 Difference]: Finished difference Result 726 states and 1109 transitions. [2018-12-02 13:06:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:02,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 13:06:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:02,803 INFO L225 Difference]: With dead ends: 726 [2018-12-02 13:06:02,803 INFO L226 Difference]: Without dead ends: 389 [2018-12-02 13:06:02,803 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 13:06:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-02 13:06:02,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 362. [2018-12-02 13:06:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-12-02 13:06:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 550 transitions. [2018-12-02 13:06:02,813 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 550 transitions. Word has length 124 [2018-12-02 13:06:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:02,813 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 550 transitions. [2018-12-02 13:06:02,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions. [2018-12-02 13:06:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 13:06:02,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:02,814 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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 13:06:02,814 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:02,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1569337438, now seen corresponding path program 1 times [2018-12-02 13:06:02,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:02,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:02,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:02,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:02,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:02,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:02,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:02,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:02,844 INFO L87 Difference]: Start difference. First operand 362 states and 550 transitions. Second operand 4 states. [2018-12-02 13:06:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:03,083 INFO L93 Difference]: Finished difference Result 761 states and 1159 transitions. [2018-12-02 13:06:03,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:03,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 13:06:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:03,085 INFO L225 Difference]: With dead ends: 761 [2018-12-02 13:06:03,085 INFO L226 Difference]: Without dead ends: 424 [2018-12-02 13:06:03,085 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 13:06:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-02 13:06:03,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2018-12-02 13:06:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 13:06:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 549 transitions. [2018-12-02 13:06:03,100 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 549 transitions. Word has length 124 [2018-12-02 13:06:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:03,100 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 549 transitions. [2018-12-02 13:06:03,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 549 transitions. [2018-12-02 13:06:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 13:06:03,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:03,101 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:03,101 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:03,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:03,101 INFO L82 PathProgramCache]: Analyzing trace with hash 132746748, now seen corresponding path program 1 times [2018-12-02 13:06:03,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:03,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 13:06:03,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:03,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:03,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:03,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:03,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:03,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:03,140 INFO L87 Difference]: Start difference. First operand 361 states and 549 transitions. Second operand 4 states. [2018-12-02 13:06:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:03,336 INFO L93 Difference]: Finished difference Result 724 states and 1105 transitions. [2018-12-02 13:06:03,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:03,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 13:06:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:03,337 INFO L225 Difference]: With dead ends: 724 [2018-12-02 13:06:03,337 INFO L226 Difference]: Without dead ends: 388 [2018-12-02 13:06:03,337 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 13:06:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-02 13:06:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2018-12-02 13:06:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 13:06:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2018-12-02 13:06:03,348 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 125 [2018-12-02 13:06:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:03,348 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2018-12-02 13:06:03,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2018-12-02 13:06:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 13:06:03,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:03,349 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:03,349 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:03,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1823776936, now seen corresponding path program 1 times [2018-12-02 13:06:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 13:06:03,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:03,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:03,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:03,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:03,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:03,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:03,391 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2018-12-02 13:06:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:03,575 INFO L93 Difference]: Finished difference Result 724 states and 1103 transitions. [2018-12-02 13:06:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:03,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-02 13:06:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:03,576 INFO L225 Difference]: With dead ends: 724 [2018-12-02 13:06:03,577 INFO L226 Difference]: Without dead ends: 388 [2018-12-02 13:06:03,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:06:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-02 13:06:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2018-12-02 13:06:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 13:06:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2018-12-02 13:06:03,588 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 126 [2018-12-02 13:06:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:03,588 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2018-12-02 13:06:03,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2018-12-02 13:06:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 13:06:03,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:03,588 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:03,589 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:03,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1081706303, now seen corresponding path program 1 times [2018-12-02 13:06:03,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 13:06:03,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:03,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:03,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:03,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:03,622 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 4 states. [2018-12-02 13:06:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:03,777 INFO L93 Difference]: Finished difference Result 714 states and 1089 transitions. [2018-12-02 13:06:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:03,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 13:06:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:03,778 INFO L225 Difference]: With dead ends: 714 [2018-12-02 13:06:03,778 INFO L226 Difference]: Without dead ends: 378 [2018-12-02 13:06:03,778 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 13:06:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-02 13:06:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2018-12-02 13:06:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 13:06:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2018-12-02 13:06:03,789 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 127 [2018-12-02 13:06:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:03,789 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2018-12-02 13:06:03,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2018-12-02 13:06:03,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 13:06:03,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:03,790 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, 1] [2018-12-02 13:06:03,790 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:03,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:03,790 INFO L82 PathProgramCache]: Analyzing trace with hash -719893533, now seen corresponding path program 1 times [2018-12-02 13:06:03,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:03,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:03,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:03,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 13:06:03,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:03,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 13:06:03,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 13:06:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 13:06:03,816 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand 3 states. [2018-12-02 13:06:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:03,876 INFO L93 Difference]: Finished difference Result 1029 states and 1577 transitions. [2018-12-02 13:06:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 13:06:03,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-02 13:06:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:03,878 INFO L225 Difference]: With dead ends: 1029 [2018-12-02 13:06:03,878 INFO L226 Difference]: Without dead ends: 693 [2018-12-02 13:06:03,878 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 13:06:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-12-02 13:06:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2018-12-02 13:06:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-12-02 13:06:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2018-12-02 13:06:03,911 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 128 [2018-12-02 13:06:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:03,911 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2018-12-02 13:06:03,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 13:06:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2018-12-02 13:06:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 13:06:03,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:03,912 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, 1, 1] [2018-12-02 13:06:03,912 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:03,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1281950915, now seen corresponding path program 1 times [2018-12-02 13:06:03,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:03,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:03,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:03,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:03,948 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 13:06:03,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:03,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:03,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:03,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:03,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:03,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:03,949 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2018-12-02 13:06:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:04,212 INFO L93 Difference]: Finished difference Result 1569 states and 2388 transitions. [2018-12-02 13:06:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:04,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-02 13:06:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:04,214 INFO L225 Difference]: With dead ends: 1569 [2018-12-02 13:06:04,214 INFO L226 Difference]: Without dead ends: 903 [2018-12-02 13:06:04,215 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 13:06:04,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-02 13:06:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 769. [2018-12-02 13:06:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-12-02 13:06:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1188 transitions. [2018-12-02 13:06:04,238 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1188 transitions. Word has length 129 [2018-12-02 13:06:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:04,238 INFO L480 AbstractCegarLoop]: Abstraction has 769 states and 1188 transitions. [2018-12-02 13:06:04,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1188 transitions. [2018-12-02 13:06:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 13:06:04,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:04,239 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, 1, 1] [2018-12-02 13:06:04,239 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:04,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash 845499955, now seen corresponding path program 1 times [2018-12-02 13:06:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:04,273 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 13:06:04,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:04,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:04,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:04,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:04,274 INFO L87 Difference]: Start difference. First operand 769 states and 1188 transitions. Second operand 4 states. [2018-12-02 13:06:04,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:04,573 INFO L93 Difference]: Finished difference Result 1637 states and 2516 transitions. [2018-12-02 13:06:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:04,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-02 13:06:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:04,576 INFO L225 Difference]: With dead ends: 1637 [2018-12-02 13:06:04,576 INFO L226 Difference]: Without dead ends: 893 [2018-12-02 13:06:04,577 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 13:06:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-12-02 13:06:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 691. [2018-12-02 13:06:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-12-02 13:06:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2018-12-02 13:06:04,602 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 130 [2018-12-02 13:06:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2018-12-02 13:06:04,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2018-12-02 13:06:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 13:06:04,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:04,603 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, 1, 1, 1, 1] [2018-12-02 13:06:04,603 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:04,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1598194120, now seen corresponding path program 1 times [2018-12-02 13:06:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:04,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:04,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:04,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:04,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:04,656 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2018-12-02 13:06:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:04,848 INFO L93 Difference]: Finished difference Result 1389 states and 2108 transitions. [2018-12-02 13:06:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:04,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-12-02 13:06:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:04,850 INFO L225 Difference]: With dead ends: 1389 [2018-12-02 13:06:04,850 INFO L226 Difference]: Without dead ends: 723 [2018-12-02 13:06:04,851 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 13:06:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-02 13:06:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 697. [2018-12-02 13:06:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-02 13:06:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1052 transitions. [2018-12-02 13:06:04,874 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1052 transitions. Word has length 131 [2018-12-02 13:06:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1052 transitions. [2018-12-02 13:06:04,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1052 transitions. [2018-12-02 13:06:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 13:06:04,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:04,875 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:04,875 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:04,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 137982944, now seen corresponding path program 1 times [2018-12-02 13:06:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:04,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:04,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 13:06:04,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:04,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:04,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:04,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:04,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:04,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:04,906 INFO L87 Difference]: Start difference. First operand 697 states and 1052 transitions. Second operand 4 states. [2018-12-02 13:06:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:05,314 INFO L93 Difference]: Finished difference Result 1403 states and 2122 transitions. [2018-12-02 13:06:05,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:05,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 13:06:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:05,319 INFO L225 Difference]: With dead ends: 1403 [2018-12-02 13:06:05,319 INFO L226 Difference]: Without dead ends: 731 [2018-12-02 13:06:05,320 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 13:06:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-02 13:06:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 697. [2018-12-02 13:06:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-12-02 13:06:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1050 transitions. [2018-12-02 13:06:05,367 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1050 transitions. Word has length 137 [2018-12-02 13:06:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:05,367 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 1050 transitions. [2018-12-02 13:06:05,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1050 transitions. [2018-12-02 13:06:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 13:06:05,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:05,368 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, 1, 1, 1, 1] [2018-12-02 13:06:05,368 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:05,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -547061532, now seen corresponding path program 1 times [2018-12-02 13:06:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:05,434 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 13:06:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:05,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:05,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:05,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:05,434 INFO L87 Difference]: Start difference. First operand 697 states and 1050 transitions. Second operand 4 states. [2018-12-02 13:06:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:05,654 INFO L93 Difference]: Finished difference Result 1495 states and 2268 transitions. [2018-12-02 13:06:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:05,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 13:06:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:05,656 INFO L225 Difference]: With dead ends: 1495 [2018-12-02 13:06:05,656 INFO L226 Difference]: Without dead ends: 823 [2018-12-02 13:06:05,657 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 13:06:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2018-12-02 13:06:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 753. [2018-12-02 13:06:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 13:06:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1148 transitions. [2018-12-02 13:06:05,682 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1148 transitions. Word has length 137 [2018-12-02 13:06:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:05,682 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1148 transitions. [2018-12-02 13:06:05,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1148 transitions. [2018-12-02 13:06:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 13:06:05,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:05,683 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:05,683 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:05,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1139451337, now seen corresponding path program 1 times [2018-12-02 13:06:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:05,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 13:06:05,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:05,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:05,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:05,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:05,726 INFO L87 Difference]: Start difference. First operand 753 states and 1148 transitions. Second operand 4 states. [2018-12-02 13:06:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:05,906 INFO L93 Difference]: Finished difference Result 1511 states and 2310 transitions. [2018-12-02 13:06:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:05,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 13:06:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:05,908 INFO L225 Difference]: With dead ends: 1511 [2018-12-02 13:06:05,908 INFO L226 Difference]: Without dead ends: 783 [2018-12-02 13:06:05,909 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 13:06:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-02 13:06:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 753. [2018-12-02 13:06:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 13:06:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1146 transitions. [2018-12-02 13:06:05,938 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1146 transitions. Word has length 138 [2018-12-02 13:06:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:05,938 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1146 transitions. [2018-12-02 13:06:05,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1146 transitions. [2018-12-02 13:06:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 13:06:05,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:05,939 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:05,939 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:05,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1038174536, now seen corresponding path program 1 times [2018-12-02 13:06:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:05,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:05,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:05,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:05,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:05,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:05,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:05,973 INFO L87 Difference]: Start difference. First operand 753 states and 1146 transitions. Second operand 4 states. [2018-12-02 13:06:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:06,368 INFO L93 Difference]: Finished difference Result 1683 states and 2572 transitions. [2018-12-02 13:06:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:06,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 13:06:06,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:06,371 INFO L225 Difference]: With dead ends: 1683 [2018-12-02 13:06:06,371 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:06,372 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 13:06:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 777. [2018-12-02 13:06:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-12-02 13:06:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2018-12-02 13:06:06,402 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 138 [2018-12-02 13:06:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:06,402 INFO L480 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2018-12-02 13:06:06,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2018-12-02 13:06:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 13:06:06,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:06,403 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:06,403 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:06,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -732393769, now seen corresponding path program 1 times [2018-12-02 13:06:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:06,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:06,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:06,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:06,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:06,434 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 4 states. [2018-12-02 13:06:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:06,673 INFO L93 Difference]: Finished difference Result 1707 states and 2604 transitions. [2018-12-02 13:06:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:06,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-02 13:06:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:06,675 INFO L225 Difference]: With dead ends: 1707 [2018-12-02 13:06:06,675 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:06,676 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 13:06:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 779. [2018-12-02 13:06:06,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2018-12-02 13:06:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1182 transitions. [2018-12-02 13:06:06,704 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1182 transitions. Word has length 139 [2018-12-02 13:06:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:06,704 INFO L480 AbstractCegarLoop]: Abstraction has 779 states and 1182 transitions. [2018-12-02 13:06:06,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:06,704 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1182 transitions. [2018-12-02 13:06:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 13:06:06,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:06,705 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:06,705 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:06,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:06,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1421638109, now seen corresponding path program 1 times [2018-12-02 13:06:06,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:06,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:06,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:06,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:06,734 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:06,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:06,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:06,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:06,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:06,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:06,735 INFO L87 Difference]: Start difference. First operand 779 states and 1182 transitions. Second operand 4 states. [2018-12-02 13:06:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:07,006 INFO L93 Difference]: Finished difference Result 1709 states and 2604 transitions. [2018-12-02 13:06:07,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:07,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-02 13:06:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:07,009 INFO L225 Difference]: With dead ends: 1709 [2018-12-02 13:06:07,009 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:07,010 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 13:06:07,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 781. [2018-12-02 13:06:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-12-02 13:06:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1184 transitions. [2018-12-02 13:06:07,039 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1184 transitions. Word has length 140 [2018-12-02 13:06:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:07,039 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1184 transitions. [2018-12-02 13:06:07,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1184 transitions. [2018-12-02 13:06:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 13:06:07,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:07,040 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:07,040 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:07,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash 741912284, now seen corresponding path program 1 times [2018-12-02 13:06:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:07,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:07,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:07,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:07,070 INFO L87 Difference]: Start difference. First operand 781 states and 1184 transitions. Second operand 4 states. [2018-12-02 13:06:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:07,362 INFO L93 Difference]: Finished difference Result 1691 states and 2580 transitions. [2018-12-02 13:06:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:07,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-02 13:06:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:07,365 INFO L225 Difference]: With dead ends: 1691 [2018-12-02 13:06:07,365 INFO L226 Difference]: Without dead ends: 935 [2018-12-02 13:06:07,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 13:06:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-02 13:06:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 783. [2018-12-02 13:06:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-02 13:06:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1186 transitions. [2018-12-02 13:06:07,406 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1186 transitions. Word has length 141 [2018-12-02 13:06:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:07,406 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1186 transitions. [2018-12-02 13:06:07,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1186 transitions. [2018-12-02 13:06:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 13:06:07,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:07,407 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, 1, 1] [2018-12-02 13:06:07,407 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:07,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash 441613261, now seen corresponding path program 1 times [2018-12-02 13:06:07,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:07,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:07,437 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 13:06:07,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:07,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:07,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:07,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:07,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:07,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:07,438 INFO L87 Difference]: Start difference. First operand 783 states and 1186 transitions. Second operand 4 states. [2018-12-02 13:06:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:07,708 INFO L93 Difference]: Finished difference Result 1713 states and 2604 transitions. [2018-12-02 13:06:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:07,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-02 13:06:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:07,710 INFO L225 Difference]: With dead ends: 1713 [2018-12-02 13:06:07,710 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:07,711 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 13:06:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-02 13:06:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-02 13:06:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1184 transitions. [2018-12-02 13:06:07,741 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1184 transitions. Word has length 144 [2018-12-02 13:06:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:07,741 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1184 transitions. [2018-12-02 13:06:07,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1184 transitions. [2018-12-02 13:06:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 13:06:07,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:07,742 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, 1, 1] [2018-12-02 13:06:07,743 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:07,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2103612318, now seen corresponding path program 1 times [2018-12-02 13:06:07,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:07,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:07,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:07,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:07,775 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 13:06:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:07,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:07,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:07,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:07,776 INFO L87 Difference]: Start difference. First operand 783 states and 1184 transitions. Second operand 4 states. [2018-12-02 13:06:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:08,042 INFO L93 Difference]: Finished difference Result 1713 states and 2600 transitions. [2018-12-02 13:06:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:08,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 13:06:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:08,044 INFO L225 Difference]: With dead ends: 1713 [2018-12-02 13:06:08,044 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:08,045 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 13:06:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-02 13:06:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-02 13:06:08,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1182 transitions. [2018-12-02 13:06:08,074 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1182 transitions. Word has length 145 [2018-12-02 13:06:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:08,075 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1182 transitions. [2018-12-02 13:06:08,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1182 transitions. [2018-12-02 13:06:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 13:06:08,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:08,075 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, 1, 1] [2018-12-02 13:06:08,075 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:08,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1863536050, now seen corresponding path program 1 times [2018-12-02 13:06:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:08,125 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 13:06:08,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:08,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:08,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:08,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:08,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:08,125 INFO L87 Difference]: Start difference. First operand 783 states and 1182 transitions. Second operand 4 states. [2018-12-02 13:06:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:08,409 INFO L93 Difference]: Finished difference Result 1713 states and 2596 transitions. [2018-12-02 13:06:08,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:08,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-02 13:06:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:08,411 INFO L225 Difference]: With dead ends: 1713 [2018-12-02 13:06:08,411 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:08,412 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 13:06:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 783. [2018-12-02 13:06:08,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-12-02 13:06:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1180 transitions. [2018-12-02 13:06:08,442 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1180 transitions. Word has length 146 [2018-12-02 13:06:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:08,442 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1180 transitions. [2018-12-02 13:06:08,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1180 transitions. [2018-12-02 13:06:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 13:06:08,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:08,442 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, 1, 1] [2018-12-02 13:06:08,443 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:08,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1555846567, now seen corresponding path program 1 times [2018-12-02 13:06:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:08,479 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 13:06:08,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:08,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:08,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:08,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:08,480 INFO L87 Difference]: Start difference. First operand 783 states and 1180 transitions. Second operand 4 states. [2018-12-02 13:06:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:08,784 INFO L93 Difference]: Finished difference Result 1693 states and 2568 transitions. [2018-12-02 13:06:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:08,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-02 13:06:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:08,786 INFO L225 Difference]: With dead ends: 1693 [2018-12-02 13:06:08,786 INFO L226 Difference]: Without dead ends: 935 [2018-12-02 13:06:08,788 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 13:06:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-02 13:06:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 753. [2018-12-02 13:06:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-12-02 13:06:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1138 transitions. [2018-12-02 13:06:08,820 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1138 transitions. Word has length 147 [2018-12-02 13:06:08,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:08,821 INFO L480 AbstractCegarLoop]: Abstraction has 753 states and 1138 transitions. [2018-12-02 13:06:08,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1138 transitions. [2018-12-02 13:06:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 13:06:08,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:08,821 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:08,821 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:08,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 161783640, now seen corresponding path program 1 times [2018-12-02 13:06:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:08,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:08,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:08,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:08,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:08,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:08,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:08,854 INFO L87 Difference]: Start difference. First operand 753 states and 1138 transitions. Second operand 4 states. [2018-12-02 13:06:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:09,093 INFO L93 Difference]: Finished difference Result 1663 states and 2524 transitions. [2018-12-02 13:06:09,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:09,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 13:06:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:09,094 INFO L225 Difference]: With dead ends: 1663 [2018-12-02 13:06:09,095 INFO L226 Difference]: Without dead ends: 935 [2018-12-02 13:06:09,095 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 13:06:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-02 13:06:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 809. [2018-12-02 13:06:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-12-02 13:06:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1228 transitions. [2018-12-02 13:06:09,127 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1228 transitions. Word has length 148 [2018-12-02 13:06:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:09,127 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1228 transitions. [2018-12-02 13:06:09,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1228 transitions. [2018-12-02 13:06:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 13:06:09,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:09,128 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:09,128 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:09,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1421164105, now seen corresponding path program 1 times [2018-12-02 13:06:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:09,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:09,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:09,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:09,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:09,168 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:09,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:09,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:09,168 INFO L87 Difference]: Start difference. First operand 809 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:09,759 INFO L93 Difference]: Finished difference Result 1703 states and 2586 transitions. [2018-12-02 13:06:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:09,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-02 13:06:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:09,762 INFO L225 Difference]: With dead ends: 1703 [2018-12-02 13:06:09,762 INFO L226 Difference]: Without dead ends: 919 [2018-12-02 13:06:09,763 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 13:06:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-02 13:06:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2018-12-02 13:06:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-02 13:06:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2018-12-02 13:06:09,804 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 149 [2018-12-02 13:06:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:09,805 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2018-12-02 13:06:09,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2018-12-02 13:06:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 13:06:09,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:09,805 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:09,805 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:09,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1338047429, now seen corresponding path program 1 times [2018-12-02 13:06:09,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:09,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:09,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:09,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 13:06:09,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:09,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:09,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:09,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:09,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:09,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:09,852 INFO L87 Difference]: Start difference. First operand 811 states and 1230 transitions. Second operand 4 states. [2018-12-02 13:06:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:10,091 INFO L93 Difference]: Finished difference Result 1705 states and 2586 transitions. [2018-12-02 13:06:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:10,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-02 13:06:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:10,092 INFO L225 Difference]: With dead ends: 1705 [2018-12-02 13:06:10,092 INFO L226 Difference]: Without dead ends: 919 [2018-12-02 13:06:10,093 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 13:06:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-02 13:06:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 811. [2018-12-02 13:06:10,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-02 13:06:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1228 transitions. [2018-12-02 13:06:10,127 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1228 transitions. Word has length 151 [2018-12-02 13:06:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:10,127 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1228 transitions. [2018-12-02 13:06:10,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1228 transitions. [2018-12-02 13:06:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 13:06:10,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:10,128 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:10,128 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash 348247356, now seen corresponding path program 1 times [2018-12-02 13:06:10,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 13:06:10,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:10,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:10,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:10,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:10,170 INFO L87 Difference]: Start difference. First operand 811 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:10,393 INFO L93 Difference]: Finished difference Result 1701 states and 2578 transitions. [2018-12-02 13:06:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:10,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 13:06:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:10,395 INFO L225 Difference]: With dead ends: 1701 [2018-12-02 13:06:10,395 INFO L226 Difference]: Without dead ends: 915 [2018-12-02 13:06:10,396 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 13:06:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-02 13:06:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 811. [2018-12-02 13:06:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2018-12-02 13:06:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1226 transitions. [2018-12-02 13:06:10,430 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1226 transitions. Word has length 152 [2018-12-02 13:06:10,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:10,430 INFO L480 AbstractCegarLoop]: Abstraction has 811 states and 1226 transitions. [2018-12-02 13:06:10,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1226 transitions. [2018-12-02 13:06:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 13:06:10,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:10,432 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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 13:06:10,432 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:10,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1809961318, now seen corresponding path program 1 times [2018-12-02 13:06:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:10,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:10,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:10,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:10,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:10,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:10,468 INFO L87 Difference]: Start difference. First operand 811 states and 1226 transitions. Second operand 4 states. [2018-12-02 13:06:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:10,688 INFO L93 Difference]: Finished difference Result 1695 states and 2566 transitions. [2018-12-02 13:06:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:10,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 13:06:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:10,689 INFO L225 Difference]: With dead ends: 1695 [2018-12-02 13:06:10,689 INFO L226 Difference]: Without dead ends: 909 [2018-12-02 13:06:10,690 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 13:06:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-02 13:06:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 817. [2018-12-02 13:06:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1236 transitions. [2018-12-02 13:06:10,724 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1236 transitions. Word has length 152 [2018-12-02 13:06:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:10,725 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1236 transitions. [2018-12-02 13:06:10,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1236 transitions. [2018-12-02 13:06:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 13:06:10,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:10,725 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:10,726 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:10,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1925375604, now seen corresponding path program 1 times [2018-12-02 13:06:10,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:10,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:10,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 13:06:10,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:10,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:10,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:10,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:10,758 INFO L87 Difference]: Start difference. First operand 817 states and 1236 transitions. Second operand 4 states. [2018-12-02 13:06:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:10,995 INFO L93 Difference]: Finished difference Result 1679 states and 2540 transitions. [2018-12-02 13:06:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:10,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 13:06:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:10,996 INFO L225 Difference]: With dead ends: 1679 [2018-12-02 13:06:10,996 INFO L226 Difference]: Without dead ends: 887 [2018-12-02 13:06:10,997 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 13:06:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-02 13:06:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-02 13:06:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1234 transitions. [2018-12-02 13:06:11,031 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1234 transitions. Word has length 152 [2018-12-02 13:06:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:11,031 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1234 transitions. [2018-12-02 13:06:11,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1234 transitions. [2018-12-02 13:06:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 13:06:11,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:11,032 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:11,032 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:11,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1829144195, now seen corresponding path program 1 times [2018-12-02 13:06:11,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 13:06:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:11,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:11,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:11,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:11,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:11,071 INFO L87 Difference]: Start difference. First operand 817 states and 1234 transitions. Second operand 4 states. [2018-12-02 13:06:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:11,351 INFO L93 Difference]: Finished difference Result 1679 states and 2536 transitions. [2018-12-02 13:06:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:11,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 13:06:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:11,352 INFO L225 Difference]: With dead ends: 1679 [2018-12-02 13:06:11,353 INFO L226 Difference]: Without dead ends: 887 [2018-12-02 13:06:11,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 13:06:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-02 13:06:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-02 13:06:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1232 transitions. [2018-12-02 13:06:11,402 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1232 transitions. Word has length 153 [2018-12-02 13:06:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:11,402 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1232 transitions. [2018-12-02 13:06:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1232 transitions. [2018-12-02 13:06:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 13:06:11,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:11,403 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, 1, 1] [2018-12-02 13:06:11,403 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:11,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash 845729325, now seen corresponding path program 1 times [2018-12-02 13:06:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:11,437 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 13:06:11,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:11,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:11,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:11,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:11,438 INFO L87 Difference]: Start difference. First operand 817 states and 1232 transitions. Second operand 4 states. [2018-12-02 13:06:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:11,723 INFO L93 Difference]: Finished difference Result 1727 states and 2604 transitions. [2018-12-02 13:06:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:11,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 13:06:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:11,724 INFO L225 Difference]: With dead ends: 1727 [2018-12-02 13:06:11,724 INFO L226 Difference]: Without dead ends: 935 [2018-12-02 13:06:11,725 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 13:06:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-12-02 13:06:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 817. [2018-12-02 13:06:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1230 transitions. [2018-12-02 13:06:11,760 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1230 transitions. Word has length 154 [2018-12-02 13:06:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:11,761 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1230 transitions. [2018-12-02 13:06:11,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1230 transitions. [2018-12-02 13:06:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 13:06:11,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:11,761 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:11,761 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:11,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:11,762 INFO L82 PathProgramCache]: Analyzing trace with hash -775063631, now seen corresponding path program 1 times [2018-12-02 13:06:11,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:11,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 13:06:11,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:11,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:11,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:11,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:11,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:11,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:11,794 INFO L87 Difference]: Start difference. First operand 817 states and 1230 transitions. Second operand 4 states. [2018-12-02 13:06:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:12,061 INFO L93 Difference]: Finished difference Result 1679 states and 2528 transitions. [2018-12-02 13:06:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:12,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 13:06:12,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:12,063 INFO L225 Difference]: With dead ends: 1679 [2018-12-02 13:06:12,063 INFO L226 Difference]: Without dead ends: 887 [2018-12-02 13:06:12,063 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 13:06:12,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-12-02 13:06:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2018-12-02 13:06:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1228 transitions. [2018-12-02 13:06:12,101 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1228 transitions. Word has length 154 [2018-12-02 13:06:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:12,101 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1228 transitions. [2018-12-02 13:06:12,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1228 transitions. [2018-12-02 13:06:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 13:06:12,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:12,102 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, 1, 1] [2018-12-02 13:06:12,102 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:12,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1693684350, now seen corresponding path program 1 times [2018-12-02 13:06:12,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:12,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:12,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:12,134 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 13:06:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:12,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:12,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:12,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:12,135 INFO L87 Difference]: Start difference. First operand 817 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:12,392 INFO L93 Difference]: Finished difference Result 1711 states and 2570 transitions. [2018-12-02 13:06:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:12,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 13:06:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:12,393 INFO L225 Difference]: With dead ends: 1711 [2018-12-02 13:06:12,393 INFO L226 Difference]: Without dead ends: 919 [2018-12-02 13:06:12,394 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 13:06:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-02 13:06:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 817. [2018-12-02 13:06:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-12-02 13:06:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1226 transitions. [2018-12-02 13:06:12,430 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1226 transitions. Word has length 155 [2018-12-02 13:06:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:12,430 INFO L480 AbstractCegarLoop]: Abstraction has 817 states and 1226 transitions. [2018-12-02 13:06:12,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1226 transitions. [2018-12-02 13:06:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 13:06:12,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:12,431 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1] [2018-12-02 13:06:12,431 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:12,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1629077281, now seen corresponding path program 1 times [2018-12-02 13:06:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:12,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:12,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:12,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:12,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:12,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:12,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:12,466 INFO L87 Difference]: Start difference. First operand 817 states and 1226 transitions. Second operand 4 states. [2018-12-02 13:06:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:12,700 INFO L93 Difference]: Finished difference Result 1701 states and 2554 transitions. [2018-12-02 13:06:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:12,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 13:06:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:12,701 INFO L225 Difference]: With dead ends: 1701 [2018-12-02 13:06:12,702 INFO L226 Difference]: Without dead ends: 909 [2018-12-02 13:06:12,702 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 13:06:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-02 13:06:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 819. [2018-12-02 13:06:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2018-12-02 13:06:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1228 transitions. [2018-12-02 13:06:12,742 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1228 transitions. Word has length 155 [2018-12-02 13:06:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:12,743 INFO L480 AbstractCegarLoop]: Abstraction has 819 states and 1228 transitions. [2018-12-02 13:06:12,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1228 transitions. [2018-12-02 13:06:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 13:06:12,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:12,743 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:12,744 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:12,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1363635080, now seen corresponding path program 1 times [2018-12-02 13:06:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:12,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 13:06:12,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:12,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:12,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:12,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:12,781 INFO L87 Difference]: Start difference. First operand 819 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:12,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:12,999 INFO L93 Difference]: Finished difference Result 1663 states and 2500 transitions. [2018-12-02 13:06:13,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:13,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 13:06:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:13,001 INFO L225 Difference]: With dead ends: 1663 [2018-12-02 13:06:13,001 INFO L226 Difference]: Without dead ends: 869 [2018-12-02 13:06:13,002 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 13:06:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-12-02 13:06:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 819. [2018-12-02 13:06:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2018-12-02 13:06:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1226 transitions. [2018-12-02 13:06:13,041 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1226 transitions. Word has length 155 [2018-12-02 13:06:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:13,041 INFO L480 AbstractCegarLoop]: Abstraction has 819 states and 1226 transitions. [2018-12-02 13:06:13,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1226 transitions. [2018-12-02 13:06:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 13:06:13,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:13,042 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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 13:06:13,042 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:13,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1547235803, now seen corresponding path program 1 times [2018-12-02 13:06:13,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:13,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:13,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:13,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:13,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:13,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:13,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:13,090 INFO L87 Difference]: Start difference. First operand 819 states and 1226 transitions. Second operand 4 states. [2018-12-02 13:06:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:13,420 INFO L93 Difference]: Finished difference Result 1691 states and 2534 transitions. [2018-12-02 13:06:13,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:13,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 13:06:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:13,420 INFO L225 Difference]: With dead ends: 1691 [2018-12-02 13:06:13,420 INFO L226 Difference]: Without dead ends: 897 [2018-12-02 13:06:13,421 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 13:06:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-02 13:06:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 821. [2018-12-02 13:06:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-12-02 13:06:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1228 transitions. [2018-12-02 13:06:13,459 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1228 transitions. Word has length 156 [2018-12-02 13:06:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:13,459 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1228 transitions. [2018-12-02 13:06:13,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1228 transitions. [2018-12-02 13:06:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 13:06:13,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:13,460 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1] [2018-12-02 13:06:13,460 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:13,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:13,460 INFO L82 PathProgramCache]: Analyzing trace with hash 533423430, now seen corresponding path program 1 times [2018-12-02 13:06:13,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:13,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:13,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:13,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:13,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:13,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:13,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:13,498 INFO L87 Difference]: Start difference. First operand 821 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:13,890 INFO L93 Difference]: Finished difference Result 1693 states and 2534 transitions. [2018-12-02 13:06:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:13,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 13:06:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:13,893 INFO L225 Difference]: With dead ends: 1693 [2018-12-02 13:06:13,893 INFO L226 Difference]: Without dead ends: 897 [2018-12-02 13:06:13,894 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 13:06:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-02 13:06:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 823. [2018-12-02 13:06:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-02 13:06:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1230 transitions. [2018-12-02 13:06:13,941 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1230 transitions. Word has length 156 [2018-12-02 13:06:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:13,941 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1230 transitions. [2018-12-02 13:06:13,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1230 transitions. [2018-12-02 13:06:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 13:06:13,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:13,942 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-12-02 13:06:13,942 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:13,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1236997818, now seen corresponding path program 1 times [2018-12-02 13:06:13,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:13,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 13:06:13,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:13,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:13,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:13,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:13,980 INFO L87 Difference]: Start difference. First operand 823 states and 1230 transitions. Second operand 4 states. [2018-12-02 13:06:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:14,240 INFO L93 Difference]: Finished difference Result 1717 states and 2562 transitions. [2018-12-02 13:06:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:14,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 13:06:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:14,241 INFO L225 Difference]: With dead ends: 1717 [2018-12-02 13:06:14,241 INFO L226 Difference]: Without dead ends: 919 [2018-12-02 13:06:14,241 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 13:06:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-02 13:06:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2018-12-02 13:06:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-12-02 13:06:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1228 transitions. [2018-12-02 13:06:14,281 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1228 transitions. Word has length 157 [2018-12-02 13:06:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:14,281 INFO L480 AbstractCegarLoop]: Abstraction has 823 states and 1228 transitions. [2018-12-02 13:06:14,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1228 transitions. [2018-12-02 13:06:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 13:06:14,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:14,282 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2018-12-02 13:06:14,282 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:14,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:14,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1447392288, now seen corresponding path program 1 times [2018-12-02 13:06:14,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:14,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:14,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:14,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:14,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:14,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:14,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:14,326 INFO L87 Difference]: Start difference. First operand 823 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:14,691 INFO L93 Difference]: Finished difference Result 1689 states and 2523 transitions. [2018-12-02 13:06:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 13:06:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:14,692 INFO L225 Difference]: With dead ends: 1689 [2018-12-02 13:06:14,692 INFO L226 Difference]: Without dead ends: 891 [2018-12-02 13:06:14,693 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 13:06:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-02 13:06:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 825. [2018-12-02 13:06:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-02 13:06:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1230 transitions. [2018-12-02 13:06:14,732 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1230 transitions. Word has length 157 [2018-12-02 13:06:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:14,732 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1230 transitions. [2018-12-02 13:06:14,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1230 transitions. [2018-12-02 13:06:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 13:06:14,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:14,733 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-12-02 13:06:14,733 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:14,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:14,733 INFO L82 PathProgramCache]: Analyzing trace with hash -814181999, now seen corresponding path program 1 times [2018-12-02 13:06:14,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:14,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:14,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 13:06:14,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:14,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:14,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:14,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:14,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:14,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:14,772 INFO L87 Difference]: Start difference. First operand 825 states and 1230 transitions. Second operand 4 states. [2018-12-02 13:06:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:15,066 INFO L93 Difference]: Finished difference Result 1715 states and 2554 transitions. [2018-12-02 13:06:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:15,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 13:06:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:15,067 INFO L225 Difference]: With dead ends: 1715 [2018-12-02 13:06:15,067 INFO L226 Difference]: Without dead ends: 915 [2018-12-02 13:06:15,067 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 13:06:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-02 13:06:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 825. [2018-12-02 13:06:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-02 13:06:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1228 transitions. [2018-12-02 13:06:15,108 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1228 transitions. Word has length 158 [2018-12-02 13:06:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:15,108 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1228 transitions. [2018-12-02 13:06:15,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1228 transitions. [2018-12-02 13:06:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 13:06:15,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:15,108 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, 1, 1] [2018-12-02 13:06:15,109 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:15,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1322576623, now seen corresponding path program 1 times [2018-12-02 13:06:15,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:15,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:15,151 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 13:06:15,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:15,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:15,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:15,152 INFO L87 Difference]: Start difference. First operand 825 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:15,561 INFO L93 Difference]: Finished difference Result 1709 states and 2542 transitions. [2018-12-02 13:06:15,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:15,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 13:06:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:15,562 INFO L225 Difference]: With dead ends: 1709 [2018-12-02 13:06:15,562 INFO L226 Difference]: Without dead ends: 909 [2018-12-02 13:06:15,563 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 13:06:15,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-02 13:06:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 825. [2018-12-02 13:06:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-12-02 13:06:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1226 transitions. [2018-12-02 13:06:15,613 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1226 transitions. Word has length 158 [2018-12-02 13:06:15,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:15,613 INFO L480 AbstractCegarLoop]: Abstraction has 825 states and 1226 transitions. [2018-12-02 13:06:15,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:15,613 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1226 transitions. [2018-12-02 13:06:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 13:06:15,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:15,614 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2018-12-02 13:06:15,614 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:15,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash -642039090, now seen corresponding path program 1 times [2018-12-02 13:06:15,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:15,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:15,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:15,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:15,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:15,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:15,659 INFO L87 Difference]: Start difference. First operand 825 states and 1226 transitions. Second operand 4 states. [2018-12-02 13:06:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:15,908 INFO L93 Difference]: Finished difference Result 1691 states and 2515 transitions. [2018-12-02 13:06:15,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:15,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 13:06:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:15,908 INFO L225 Difference]: With dead ends: 1691 [2018-12-02 13:06:15,909 INFO L226 Difference]: Without dead ends: 891 [2018-12-02 13:06:15,909 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 13:06:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-02 13:06:15,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 827. [2018-12-02 13:06:15,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2018-12-02 13:06:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1228 transitions. [2018-12-02 13:06:15,951 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1228 transitions. Word has length 158 [2018-12-02 13:06:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:15,951 INFO L480 AbstractCegarLoop]: Abstraction has 827 states and 1228 transitions. [2018-12-02 13:06:15,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1228 transitions. [2018-12-02 13:06:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 13:06:15,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:15,952 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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 13:06:15,952 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:15,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -114411896, now seen corresponding path program 1 times [2018-12-02 13:06:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:15,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:15,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 13:06:15,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:15,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:15,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:15,986 INFO L87 Difference]: Start difference. First operand 827 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:16,236 INFO L93 Difference]: Finished difference Result 1687 states and 2508 transitions. [2018-12-02 13:06:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:16,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 13:06:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:16,237 INFO L225 Difference]: With dead ends: 1687 [2018-12-02 13:06:16,237 INFO L226 Difference]: Without dead ends: 885 [2018-12-02 13:06:16,238 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 13:06:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-12-02 13:06:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 829. [2018-12-02 13:06:16,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-02 13:06:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1230 transitions. [2018-12-02 13:06:16,280 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1230 transitions. Word has length 159 [2018-12-02 13:06:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:16,281 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1230 transitions. [2018-12-02 13:06:16,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1230 transitions. [2018-12-02 13:06:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 13:06:16,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:16,281 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, 1, 1, 1] [2018-12-02 13:06:16,281 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:16,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1240684438, now seen corresponding path program 1 times [2018-12-02 13:06:16,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:16,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:16,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:16,313 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 13:06:16,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:16,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:16,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:16,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:16,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:16,314 INFO L87 Difference]: Start difference. First operand 829 states and 1230 transitions. Second operand 4 states. [2018-12-02 13:06:16,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:16,557 INFO L93 Difference]: Finished difference Result 1713 states and 2538 transitions. [2018-12-02 13:06:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:16,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 13:06:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:16,559 INFO L225 Difference]: With dead ends: 1713 [2018-12-02 13:06:16,559 INFO L226 Difference]: Without dead ends: 909 [2018-12-02 13:06:16,559 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 13:06:16,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-02 13:06:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 829. [2018-12-02 13:06:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-02 13:06:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1228 transitions. [2018-12-02 13:06:16,601 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1228 transitions. Word has length 161 [2018-12-02 13:06:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1228 transitions. [2018-12-02 13:06:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1228 transitions. [2018-12-02 13:06:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 13:06:16,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:16,602 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, 1, 1, 1] [2018-12-02 13:06:16,602 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:16,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:16,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1903007738, now seen corresponding path program 1 times [2018-12-02 13:06:16,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:16,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:16,635 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 13:06:16,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:16,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:16,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:16,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:16,636 INFO L87 Difference]: Start difference. First operand 829 states and 1228 transitions. Second operand 4 states. [2018-12-02 13:06:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:16,890 INFO L93 Difference]: Finished difference Result 1701 states and 2518 transitions. [2018-12-02 13:06:16,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:16,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 13:06:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:16,892 INFO L225 Difference]: With dead ends: 1701 [2018-12-02 13:06:16,892 INFO L226 Difference]: Without dead ends: 897 [2018-12-02 13:06:16,893 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 13:06:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-02 13:06:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2018-12-02 13:06:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-02 13:06:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1226 transitions. [2018-12-02 13:06:16,937 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1226 transitions. Word has length 162 [2018-12-02 13:06:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1226 transitions. [2018-12-02 13:06:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1226 transitions. [2018-12-02 13:06:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 13:06:16,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:16,938 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, 1, 1, 1] [2018-12-02 13:06:16,939 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:16,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash -311300325, now seen corresponding path program 1 times [2018-12-02 13:06:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:16,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:16,978 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 13:06:16,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:16,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:16,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:16,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:16,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:16,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:16,979 INFO L87 Difference]: Start difference. First operand 829 states and 1226 transitions. Second operand 4 states. [2018-12-02 13:06:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:17,236 INFO L93 Difference]: Finished difference Result 1701 states and 2514 transitions. [2018-12-02 13:06:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:17,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 13:06:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:17,237 INFO L225 Difference]: With dead ends: 1701 [2018-12-02 13:06:17,237 INFO L226 Difference]: Without dead ends: 897 [2018-12-02 13:06:17,237 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 13:06:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-12-02 13:06:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 829. [2018-12-02 13:06:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2018-12-02 13:06:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1224 transitions. [2018-12-02 13:06:17,280 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1224 transitions. Word has length 162 [2018-12-02 13:06:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:17,280 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 1224 transitions. [2018-12-02 13:06:17,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1224 transitions. [2018-12-02 13:06:17,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 13:06:17,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:17,281 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] [2018-12-02 13:06:17,281 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:17,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:17,282 INFO L82 PathProgramCache]: Analyzing trace with hash -518747860, now seen corresponding path program 1 times [2018-12-02 13:06:17,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:17,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:17,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:17,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:17,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:17,328 INFO L87 Difference]: Start difference. First operand 829 states and 1224 transitions. Second operand 4 states. [2018-12-02 13:06:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:17,922 INFO L93 Difference]: Finished difference Result 1767 states and 2628 transitions. [2018-12-02 13:06:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:17,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 13:06:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:17,924 INFO L225 Difference]: With dead ends: 1767 [2018-12-02 13:06:17,924 INFO L226 Difference]: Without dead ends: 963 [2018-12-02 13:06:17,926 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 13:06:17,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-02 13:06:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 889. [2018-12-02 13:06:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-02 13:06:17,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1330 transitions. [2018-12-02 13:06:17,984 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1330 transitions. Word has length 162 [2018-12-02 13:06:17,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:17,984 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1330 transitions. [2018-12-02 13:06:17,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1330 transitions. [2018-12-02 13:06:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 13:06:17,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:17,985 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, 1, 1, 1] [2018-12-02 13:06:17,985 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:17,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1030759659, now seen corresponding path program 1 times [2018-12-02 13:06:17,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:17,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:17,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:17,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:18,030 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 13:06:18,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:18,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:18,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:18,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:18,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:18,031 INFO L87 Difference]: Start difference. First operand 889 states and 1330 transitions. Second operand 4 states. [2018-12-02 13:06:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:18,564 INFO L93 Difference]: Finished difference Result 1815 states and 2715 transitions. [2018-12-02 13:06:18,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:18,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-02 13:06:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:18,565 INFO L225 Difference]: With dead ends: 1815 [2018-12-02 13:06:18,565 INFO L226 Difference]: Without dead ends: 951 [2018-12-02 13:06:18,565 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 13:06:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-02 13:06:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2018-12-02 13:06:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-02 13:06:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1328 transitions. [2018-12-02 13:06:18,609 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1328 transitions. Word has length 163 [2018-12-02 13:06:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:18,610 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1328 transitions. [2018-12-02 13:06:18,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1328 transitions. [2018-12-02 13:06:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-02 13:06:18,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:18,611 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, 1, 1, 1] [2018-12-02 13:06:18,611 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:18,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:18,611 INFO L82 PathProgramCache]: Analyzing trace with hash -672748701, now seen corresponding path program 1 times [2018-12-02 13:06:18,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:18,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:18,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:18,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:18,651 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 13:06:18,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:18,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:18,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:18,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:18,652 INFO L87 Difference]: Start difference. First operand 889 states and 1328 transitions. Second operand 4 states. [2018-12-02 13:06:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:18,901 INFO L93 Difference]: Finished difference Result 1815 states and 2711 transitions. [2018-12-02 13:06:18,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:18,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-12-02 13:06:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:18,902 INFO L225 Difference]: With dead ends: 1815 [2018-12-02 13:06:18,902 INFO L226 Difference]: Without dead ends: 951 [2018-12-02 13:06:18,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:06:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-02 13:06:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 889. [2018-12-02 13:06:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-12-02 13:06:18,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1326 transitions. [2018-12-02 13:06:18,948 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1326 transitions. Word has length 164 [2018-12-02 13:06:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:18,948 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 1326 transitions. [2018-12-02 13:06:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1326 transitions. [2018-12-02 13:06:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 13:06:18,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:18,949 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, 1, 1, 1] [2018-12-02 13:06:18,949 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:18,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1066409837, now seen corresponding path program 1 times [2018-12-02 13:06:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:18,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:18,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:18,985 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 13:06:18,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:18,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:18,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:18,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:18,986 INFO L87 Difference]: Start difference. First operand 889 states and 1326 transitions. Second operand 4 states. [2018-12-02 13:06:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:19,237 INFO L93 Difference]: Finished difference Result 1809 states and 2700 transitions. [2018-12-02 13:06:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:19,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 13:06:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:19,238 INFO L225 Difference]: With dead ends: 1809 [2018-12-02 13:06:19,238 INFO L226 Difference]: Without dead ends: 945 [2018-12-02 13:06:19,239 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 13:06:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-12-02 13:06:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 813. [2018-12-02 13:06:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2018-12-02 13:06:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1214 transitions. [2018-12-02 13:06:19,286 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1214 transitions. Word has length 165 [2018-12-02 13:06:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:19,286 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 1214 transitions. [2018-12-02 13:06:19,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1214 transitions. [2018-12-02 13:06:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 13:06:19,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:19,287 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:19,287 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:19,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1244843128, now seen corresponding path program 1 times [2018-12-02 13:06:19,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:19,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 13:06:19,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:19,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:19,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:19,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:19,327 INFO L87 Difference]: Start difference. First operand 813 states and 1214 transitions. Second operand 4 states. [2018-12-02 13:06:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:19,565 INFO L93 Difference]: Finished difference Result 1733 states and 2586 transitions. [2018-12-02 13:06:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:19,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 13:06:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:19,566 INFO L225 Difference]: With dead ends: 1733 [2018-12-02 13:06:19,566 INFO L226 Difference]: Without dead ends: 945 [2018-12-02 13:06:19,567 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 13:06:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2018-12-02 13:06:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 873. [2018-12-02 13:06:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1304 transitions. [2018-12-02 13:06:19,612 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1304 transitions. Word has length 165 [2018-12-02 13:06:19,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:19,613 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1304 transitions. [2018-12-02 13:06:19,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1304 transitions. [2018-12-02 13:06:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 13:06:19,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:19,613 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:19,614 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:19,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1488640487, now seen corresponding path program 1 times [2018-12-02 13:06:19,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:19,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:19,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 13:06:19,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:19,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:19,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:19,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:19,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:19,647 INFO L87 Difference]: Start difference. First operand 873 states and 1304 transitions. Second operand 4 states. [2018-12-02 13:06:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:19,938 INFO L93 Difference]: Finished difference Result 1801 states and 2688 transitions. [2018-12-02 13:06:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:19,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 13:06:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:19,939 INFO L225 Difference]: With dead ends: 1801 [2018-12-02 13:06:19,939 INFO L226 Difference]: Without dead ends: 953 [2018-12-02 13:06:19,940 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 13:06:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-02 13:06:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2018-12-02 13:06:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1302 transitions. [2018-12-02 13:06:19,986 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1302 transitions. Word has length 165 [2018-12-02 13:06:19,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:19,986 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1302 transitions. [2018-12-02 13:06:19,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1302 transitions. [2018-12-02 13:06:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 13:06:19,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:19,987 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:19,987 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:19,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:19,987 INFO L82 PathProgramCache]: Analyzing trace with hash 289460616, now seen corresponding path program 1 times [2018-12-02 13:06:19,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:19,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:19,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 13:06:20,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:20,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:20,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:20,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:20,039 INFO L87 Difference]: Start difference. First operand 873 states and 1302 transitions. Second operand 4 states. [2018-12-02 13:06:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:20,319 INFO L93 Difference]: Finished difference Result 1801 states and 2684 transitions. [2018-12-02 13:06:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:20,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 13:06:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:20,320 INFO L225 Difference]: With dead ends: 1801 [2018-12-02 13:06:20,320 INFO L226 Difference]: Without dead ends: 953 [2018-12-02 13:06:20,321 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 13:06:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-12-02 13:06:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 873. [2018-12-02 13:06:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1300 transitions. [2018-12-02 13:06:20,373 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1300 transitions. Word has length 166 [2018-12-02 13:06:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:20,373 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1300 transitions. [2018-12-02 13:06:20,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1300 transitions. [2018-12-02 13:06:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 13:06:20,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:20,374 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:20,374 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:20,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:20,374 INFO L82 PathProgramCache]: Analyzing trace with hash -359739297, now seen corresponding path program 1 times [2018-12-02 13:06:20,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:20,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 13:06:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:20,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:20,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:20,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:20,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:20,413 INFO L87 Difference]: Start difference. First operand 873 states and 1300 transitions. Second operand 4 states. [2018-12-02 13:06:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:20,640 INFO L93 Difference]: Finished difference Result 1749 states and 2612 transitions. [2018-12-02 13:06:20,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:20,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 13:06:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:20,641 INFO L225 Difference]: With dead ends: 1749 [2018-12-02 13:06:20,641 INFO L226 Difference]: Without dead ends: 901 [2018-12-02 13:06:20,642 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 13:06:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-12-02 13:06:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 873. [2018-12-02 13:06:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1298 transitions. [2018-12-02 13:06:20,692 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1298 transitions. Word has length 167 [2018-12-02 13:06:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:20,692 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1298 transitions. [2018-12-02 13:06:20,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1298 transitions. [2018-12-02 13:06:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 13:06:20,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:20,693 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:20,693 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:20,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614324, now seen corresponding path program 1 times [2018-12-02 13:06:20,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:20,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:20,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:20,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:20,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 13:06:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:20,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:20,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:20,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:20,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:20,731 INFO L87 Difference]: Start difference. First operand 873 states and 1298 transitions. Second operand 4 states. [2018-12-02 13:06:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:20,992 INFO L93 Difference]: Finished difference Result 1771 states and 2640 transitions. [2018-12-02 13:06:20,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:20,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 13:06:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:20,994 INFO L225 Difference]: With dead ends: 1771 [2018-12-02 13:06:20,994 INFO L226 Difference]: Without dead ends: 923 [2018-12-02 13:06:20,995 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 13:06:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-12-02 13:06:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 873. [2018-12-02 13:06:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1296 transitions. [2018-12-02 13:06:21,059 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1296 transitions. Word has length 167 [2018-12-02 13:06:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:21,060 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1296 transitions. [2018-12-02 13:06:21,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1296 transitions. [2018-12-02 13:06:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 13:06:21,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:21,060 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:21,060 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:21,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 769147445, now seen corresponding path program 1 times [2018-12-02 13:06:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 13:06:21,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:21,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:21,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:21,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:21,095 INFO L87 Difference]: Start difference. First operand 873 states and 1296 transitions. Second operand 4 states. [2018-12-02 13:06:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:21,363 INFO L93 Difference]: Finished difference Result 1767 states and 2632 transitions. [2018-12-02 13:06:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:21,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-02 13:06:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:21,365 INFO L225 Difference]: With dead ends: 1767 [2018-12-02 13:06:21,365 INFO L226 Difference]: Without dead ends: 919 [2018-12-02 13:06:21,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 13:06:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-12-02 13:06:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 873. [2018-12-02 13:06:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2018-12-02 13:06:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1294 transitions. [2018-12-02 13:06:21,423 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1294 transitions. Word has length 168 [2018-12-02 13:06:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:21,423 INFO L480 AbstractCegarLoop]: Abstraction has 873 states and 1294 transitions. [2018-12-02 13:06:21,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1294 transitions. [2018-12-02 13:06:21,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 13:06:21,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:21,424 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] [2018-12-02 13:06:21,424 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:21,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:21,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2111104399, now seen corresponding path program 1 times [2018-12-02 13:06:21,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:06:21,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:21,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:06:21,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:06:21,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:06:21,511 INFO L87 Difference]: Start difference. First operand 873 states and 1294 transitions. Second operand 5 states. [2018-12-02 13:06:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:21,925 INFO L93 Difference]: Finished difference Result 1879 states and 2804 transitions. [2018-12-02 13:06:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 13:06:21,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2018-12-02 13:06:21,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:21,927 INFO L225 Difference]: With dead ends: 1879 [2018-12-02 13:06:21,927 INFO L226 Difference]: Without dead ends: 1031 [2018-12-02 13:06:21,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 13:06:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-12-02 13:06:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 939. [2018-12-02 13:06:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2018-12-02 13:06:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1412 transitions. [2018-12-02 13:06:21,990 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1412 transitions. Word has length 168 [2018-12-02 13:06:21,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:21,990 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 1412 transitions. [2018-12-02 13:06:21,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:06:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1412 transitions. [2018-12-02 13:06:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 13:06:21,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:21,991 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, 1, 1, 1] [2018-12-02 13:06:21,991 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:21,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:21,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1317585046, now seen corresponding path program 1 times [2018-12-02 13:06:21,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:21,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:21,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:22,324 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 13:06:22,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:06:22,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:06:22,324 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-12-02 13:06:22,326 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], [514], [519], [524], [539], [544], [549], [554], [560], [565], [567], [572], [577], [583], [586], [590], [611], [645], [647], [659], [662], [663], [664], [666] [2018-12-02 13:06:22,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:06:22,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:06:22,844 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 13:06:22,845 INFO L272 AbstractInterpreter]: Visited 79 different actions 269 times. Merged at 62 different actions 181 times. Never widened. Performed 2189 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2189 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 118 variables. [2018-12-02 13:06:22,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:22,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 13:06:22,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:06:22,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/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 13:06:22,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:22,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 13:06:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:22,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:06:23,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,005 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 13:06:23,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,026 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 13:06:23,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,047 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 13:06:23,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,078 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 13:06:23,080 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 13:06:23,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,083 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 13:06:23,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,089 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 13:06:23,090 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,098 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,102 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,117 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 13:06:23,117 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 13:06:23,157 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 13:06:23,160 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 13:06:23,181 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 13:06:23,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,191 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 13:06:23,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,231 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 103 treesize of output 82 [2018-12-02 13:06:23,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,241 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 82 treesize of output 132 [2018-12-02 13:06:23,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,256 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 84 treesize of output 168 [2018-12-02 13:06:23,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,275 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,297 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 13:06:23,316 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 13:06:23,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,327 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 13:06:23,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:23,351 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 13:06:23,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,364 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 13:06:23,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:23,388 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 13:06:23,391 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 13:06:23,405 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 103 treesize of output 82 [2018-12-02 13:06:23,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,413 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 82 treesize of output 132 [2018-12-02 13:06:23,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,428 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 84 treesize of output 168 [2018-12-02 13:06:23,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,469 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 13:06:23,474 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 13:06:23,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,481 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 13:06:23,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:23,506 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 13:06:23,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,513 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 13:06:23,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:23,539 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 13:06:23,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,550 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 13:06:23,551 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 13:06:23,555 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 13:06:23,575 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 13:06:23,578 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 13:06:23,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,599 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 13:06:23,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-02 13:06:23,646 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 13:06:23,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,656 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 13:06:23,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,701 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 13:06:23,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,709 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 13:06:23,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,731 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 13:06:23,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-02 13:06:23,772 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 13:06:23,775 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 13:06:23,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,809 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 13:06:23,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,819 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 13:06:23,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,846 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 13:06:23,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-02 13:06:23,877 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 13:06:23,879 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 13:06:23,879 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 13:06:23,882 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 13:06:23,900 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 13:06:23,904 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 13:06:23,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,918 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 13:06:23,919 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:23,929 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 13:06:23,937 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 13:06:23,939 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 13:06:23,939 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,943 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,948 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 13:06:23,948 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-02 13:06:23,984 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 13:06:23,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:23,989 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 13:06:23,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,001 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 13:06:24,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-02 13:06:24,043 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 13:06:24,045 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 13:06:24,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:24,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:24,057 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 13:06:24,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,063 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 13:06:24,063 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-02 13:06:24,216 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 13:06:24,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:06:24,271 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 13:06:24,273 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 13:06:24,273 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 13:06:24,275 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 13:06:24,277 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 13:06:24,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-02 13:06:24,443 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 13:06:24,446 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 13:06:24,450 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 13:06:24,463 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 13:06:24,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,468 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 13:06:24,469 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 13:06:24,470 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:24,473 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 13:06:24,476 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 13:06:24,476 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-02 13:06:24,484 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 13:06:24,486 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 13:06:24,493 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 13:06:24,495 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 13:06:24,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:24,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-02 13:06:24,506 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 56 treesize of output 52 [2018-12-02 13:06:24,507 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:24,508 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 52 treesize of output 52 [2018-12-02 13:06:24,508 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 13:06:24,512 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 13:06:24,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:24,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-02 13:06:24,566 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 13:06:24,569 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 13:06:24,570 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 13:06:24,573 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 13:06:24,574 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 13:06:24,579 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 13:06:24,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-02 13:06:24,590 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-02 13:06:26,657 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 13:06:26,658 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 13:06:26,677 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 13:06:26,681 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 13:06:26,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:26,687 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-02 13:06:28,903 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 13:06:28,906 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 13:06:28,955 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 13:06:28,956 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 13:06:28,976 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 13:06:28,982 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 13:06:28,995 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:28,999 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:29,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:29,005 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:144, output treesize:83 [2018-12-02 13:06:31,084 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 13:06:31,086 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 13:06:31,105 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 13:06:31,108 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 13:06:31,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:31,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-02 13:06:33,186 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 13:06:33,190 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 13:06:33,197 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 13:06:33,201 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 13:06:33,208 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 13:06:33,212 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 13:06:33,238 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:33,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:33,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:33,247 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-02 13:06:35,343 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 13:06:35,355 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 13:06:35,356 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 13:06:35,366 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 13:06:35,367 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 13:06:35,377 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 13:06:35,498 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,615 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,626 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,627 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,635 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,636 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,645 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,731 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,735 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,794 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,798 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,809 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,815 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,823 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,827 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,862 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,863 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:35,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:35,873 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:103 [2018-12-02 13:06:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 28 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 13:06:36,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 13:06:36,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-02 13:06:36,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 13:06:36,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 13:06:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 13:06:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2018-12-02 13:06:36,043 INFO L87 Difference]: Start difference. First operand 939 states and 1412 transitions. Second operand 19 states. [2018-12-02 13:06:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:40,161 INFO L93 Difference]: Finished difference Result 2536 states and 3792 transitions. [2018-12-02 13:06:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 13:06:40,161 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 173 [2018-12-02 13:06:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:40,164 INFO L225 Difference]: With dead ends: 2536 [2018-12-02 13:06:40,164 INFO L226 Difference]: Without dead ends: 1622 [2018-12-02 13:06:40,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 325 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=231, Invalid=1100, Unknown=1, NotChecked=0, Total=1332 [2018-12-02 13:06:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2018-12-02 13:06:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 899. [2018-12-02 13:06:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-12-02 13:06:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1334 transitions. [2018-12-02 13:06:40,243 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1334 transitions. Word has length 173 [2018-12-02 13:06:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:40,244 INFO L480 AbstractCegarLoop]: Abstraction has 899 states and 1334 transitions. [2018-12-02 13:06:40,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 13:06:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1334 transitions. [2018-12-02 13:06:40,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 13:06:40,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:40,246 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:40,246 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:40,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash -284520792, now seen corresponding path program 1 times [2018-12-02 13:06:40,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:40,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:40,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:40,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 13:06:40,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:40,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:40,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:40,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:40,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:40,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:40,314 INFO L87 Difference]: Start difference. First operand 899 states and 1334 transitions. Second operand 4 states. [2018-12-02 13:06:40,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:40,586 INFO L93 Difference]: Finished difference Result 1845 states and 2734 transitions. [2018-12-02 13:06:40,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:40,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 13:06:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:40,588 INFO L225 Difference]: With dead ends: 1845 [2018-12-02 13:06:40,588 INFO L226 Difference]: Without dead ends: 971 [2018-12-02 13:06:40,589 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 13:06:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2018-12-02 13:06:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 839. [2018-12-02 13:06:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2018-12-02 13:06:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1242 transitions. [2018-12-02 13:06:40,650 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1242 transitions. Word has length 173 [2018-12-02 13:06:40,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:40,650 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 1242 transitions. [2018-12-02 13:06:40,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1242 transitions. [2018-12-02 13:06:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 13:06:40,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:40,651 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:40,651 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:40,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2036911981, now seen corresponding path program 1 times [2018-12-02 13:06:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:40,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:40,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 13:06:40,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:40,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:40,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:40,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:40,707 INFO L87 Difference]: Start difference. First operand 839 states and 1242 transitions. Second operand 4 states. [2018-12-02 13:06:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:40,939 INFO L93 Difference]: Finished difference Result 1781 states and 2636 transitions. [2018-12-02 13:06:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:40,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-02 13:06:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:40,940 INFO L225 Difference]: With dead ends: 1781 [2018-12-02 13:06:40,940 INFO L226 Difference]: Without dead ends: 967 [2018-12-02 13:06:40,941 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 13:06:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2018-12-02 13:06:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 901. [2018-12-02 13:06:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 13:06:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1334 transitions. [2018-12-02 13:06:41,031 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1334 transitions. Word has length 174 [2018-12-02 13:06:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:41,031 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1334 transitions. [2018-12-02 13:06:41,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1334 transitions. [2018-12-02 13:06:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 13:06:41,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:41,032 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] [2018-12-02 13:06:41,032 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:41,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash -175998908, now seen corresponding path program 1 times [2018-12-02 13:06:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:41,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:41,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:41,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:41,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:41,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:41,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:41,082 INFO L87 Difference]: Start difference. First operand 901 states and 1334 transitions. Second operand 4 states. [2018-12-02 13:06:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:41,442 INFO L93 Difference]: Finished difference Result 1851 states and 2740 transitions. [2018-12-02 13:06:41,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:41,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-02 13:06:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:41,443 INFO L225 Difference]: With dead ends: 1851 [2018-12-02 13:06:41,443 INFO L226 Difference]: Without dead ends: 975 [2018-12-02 13:06:41,444 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 13:06:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-02 13:06:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-02 13:06:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 13:06:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1332 transitions. [2018-12-02 13:06:41,507 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1332 transitions. Word has length 177 [2018-12-02 13:06:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:41,507 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1332 transitions. [2018-12-02 13:06:41,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1332 transitions. [2018-12-02 13:06:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 13:06:41,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:41,508 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] [2018-12-02 13:06:41,508 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:41,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:41,508 INFO L82 PathProgramCache]: Analyzing trace with hash 225246923, now seen corresponding path program 1 times [2018-12-02 13:06:41,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:41,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:41,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:41,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:41,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:41,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:41,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:41,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:41,553 INFO L87 Difference]: Start difference. First operand 901 states and 1332 transitions. Second operand 4 states. [2018-12-02 13:06:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:41,867 INFO L93 Difference]: Finished difference Result 1851 states and 2736 transitions. [2018-12-02 13:06:41,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:41,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-02 13:06:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:41,868 INFO L225 Difference]: With dead ends: 1851 [2018-12-02 13:06:41,868 INFO L226 Difference]: Without dead ends: 975 [2018-12-02 13:06:41,868 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 13:06:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-02 13:06:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-02 13:06:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 13:06:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1330 transitions. [2018-12-02 13:06:41,928 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1330 transitions. Word has length 178 [2018-12-02 13:06:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:41,929 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1330 transitions. [2018-12-02 13:06:41,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1330 transitions. [2018-12-02 13:06:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 13:06:41,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:41,929 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] [2018-12-02 13:06:41,929 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:41,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1043728489, now seen corresponding path program 1 times [2018-12-02 13:06:41,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:41,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:41,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:41,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:41,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:41,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:41,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:41,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:41,999 INFO L87 Difference]: Start difference. First operand 901 states and 1330 transitions. Second operand 4 states. [2018-12-02 13:06:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:42,658 INFO L93 Difference]: Finished difference Result 1851 states and 2732 transitions. [2018-12-02 13:06:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:42,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-02 13:06:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:42,661 INFO L225 Difference]: With dead ends: 1851 [2018-12-02 13:06:42,661 INFO L226 Difference]: Without dead ends: 975 [2018-12-02 13:06:42,663 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 13:06:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-02 13:06:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 901. [2018-12-02 13:06:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 13:06:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1328 transitions. [2018-12-02 13:06:42,740 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1328 transitions. Word has length 179 [2018-12-02 13:06:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:42,740 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1328 transitions. [2018-12-02 13:06:42,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1328 transitions. [2018-12-02 13:06:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 13:06:42,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:42,741 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] [2018-12-02 13:06:42,741 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:42,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1911615952, now seen corresponding path program 1 times [2018-12-02 13:06:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:42,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:42,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:42,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 13:06:42,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:42,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 13:06:42,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 13:06:42,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 13:06:42,796 INFO L87 Difference]: Start difference. First operand 901 states and 1328 transitions. Second operand 4 states. [2018-12-02 13:06:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:43,081 INFO L93 Difference]: Finished difference Result 1831 states and 2704 transitions. [2018-12-02 13:06:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:43,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-02 13:06:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:43,083 INFO L225 Difference]: With dead ends: 1831 [2018-12-02 13:06:43,083 INFO L226 Difference]: Without dead ends: 955 [2018-12-02 13:06:43,084 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 13:06:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-12-02 13:06:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 901. [2018-12-02 13:06:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-12-02 13:06:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1326 transitions. [2018-12-02 13:06:43,146 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1326 transitions. Word has length 180 [2018-12-02 13:06:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:43,146 INFO L480 AbstractCegarLoop]: Abstraction has 901 states and 1326 transitions. [2018-12-02 13:06:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 13:06:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1326 transitions. [2018-12-02 13:06:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 13:06:43,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:43,148 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] [2018-12-02 13:06:43,148 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:43,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -404264575, now seen corresponding path program 1 times [2018-12-02 13:06:43,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:43,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:43,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 13:06:43,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:43,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:06:43,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:43,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:06:43,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:06:43,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:06:43,221 INFO L87 Difference]: Start difference. First operand 901 states and 1326 transitions. Second operand 5 states. [2018-12-02 13:06:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:43,608 INFO L93 Difference]: Finished difference Result 2083 states and 3108 transitions. [2018-12-02 13:06:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:43,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-12-02 13:06:43,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:43,610 INFO L225 Difference]: With dead ends: 2083 [2018-12-02 13:06:43,610 INFO L226 Difference]: Without dead ends: 1207 [2018-12-02 13:06:43,610 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 13:06:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-12-02 13:06:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 979. [2018-12-02 13:06:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2018-12-02 13:06:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1468 transitions. [2018-12-02 13:06:43,685 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1468 transitions. Word has length 183 [2018-12-02 13:06:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:43,685 INFO L480 AbstractCegarLoop]: Abstraction has 979 states and 1468 transitions. [2018-12-02 13:06:43,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:06:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1468 transitions. [2018-12-02 13:06:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-02 13:06:43,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:43,686 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] [2018-12-02 13:06:43,686 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:43,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:43,686 INFO L82 PathProgramCache]: Analyzing trace with hash 112427317, now seen corresponding path program 1 times [2018-12-02 13:06:43,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:43,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:43,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:43,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 13:06:43,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 13:06:43,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 13:06:43,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 13:06:43,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 13:06:43,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 13:06:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 13:06:43,748 INFO L87 Difference]: Start difference. First operand 979 states and 1468 transitions. Second operand 5 states. [2018-12-02 13:06:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:44,125 INFO L93 Difference]: Finished difference Result 2151 states and 3244 transitions. [2018-12-02 13:06:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 13:06:44,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-12-02 13:06:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:44,127 INFO L225 Difference]: With dead ends: 2151 [2018-12-02 13:06:44,127 INFO L226 Difference]: Without dead ends: 1197 [2018-12-02 13:06:44,127 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 13:06:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-12-02 13:06:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1033. [2018-12-02 13:06:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2018-12-02 13:06:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1578 transitions. [2018-12-02 13:06:44,188 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1578 transitions. Word has length 184 [2018-12-02 13:06:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:44,189 INFO L480 AbstractCegarLoop]: Abstraction has 1033 states and 1578 transitions. [2018-12-02 13:06:44,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 13:06:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1578 transitions. [2018-12-02 13:06:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-02 13:06:44,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:44,190 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 13:06:44,190 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:44,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 420335011, now seen corresponding path program 1 times [2018-12-02 13:06:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:44,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 4 proven. 205 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:44,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:06:44,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 13:06:44,426 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-12-02 13:06:44,427 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], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [329], [331], [336], [338], [343], [348], [389], [391], [393], [396], [407], [409], [419], [421], [426], [432], [454], [456], [514], [519], [524], [611], [645], [647], [659], [662], [663], [664], [666] [2018-12-02 13:06:44,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 13:06:44,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 13:06:44,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 13:06:44,663 INFO L272 AbstractInterpreter]: Visited 85 different actions 225 times. Merged at 68 different actions 130 times. Never widened. Performed 1637 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1637 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 137 variables. [2018-12-02 13:06:44,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:44,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 13:06:44,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 13:06:44,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 13:06:44,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:44,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 13:06:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 13:06:44,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 13:06:44,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,804 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 13:06:44,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,829 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 13:06:44,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,854 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 13:06:44,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,882 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 13:06:44,884 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 13:06:44,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,886 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 13:06:44,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,891 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 13:06:44,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,899 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,917 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 13:06:44,917 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 13:06:44,951 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 13:06:44,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:44,962 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 13:06:44,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:44,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,003 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 13:06:45,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,013 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 13:06:45,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,044 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 13:06:45,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,050 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 13:06:45,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,071 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 13:06:45,090 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 13:06:45,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,098 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 13:06:45,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:45,125 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 13:06:45,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,133 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 13:06:45,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:45,155 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 13:06:45,158 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 13:06:45,175 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 103 treesize of output 82 [2018-12-02 13:06:45,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,187 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 82 treesize of output 132 [2018-12-02 13:06:45,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,201 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 84 treesize of output 168 [2018-12-02 13:06:45,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,233 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 13:06:45,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 13:06:45,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,244 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 13:06:45,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:45,264 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 13:06:45,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,268 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 13:06:45,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 13:06:45,290 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 13:06:45,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,298 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 13:06:45,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,320 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 13:06:45,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,327 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 13:06:45,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 13:06:45,351 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 13:06:45,353 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 45 treesize of output 37 [2018-12-02 13:06:45,353 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 13:06:45,354 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 13:06:45,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 13:06:45,368 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 1 [2018-12-02 13:06:45,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 13:06:45,384 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 13:06:45,388 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 13:06:45,411 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 103 treesize of output 82 [2018-12-02 13:06:45,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,419 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 82 treesize of output 132 [2018-12-02 13:06:45,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,432 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 84 treesize of output 168 [2018-12-02 13:06:45,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,462 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 13:06:45,466 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 13:06:45,468 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 45 treesize of output 37 [2018-12-02 13:06:45,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 13:06:45,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 13:06:45,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 13:06:45,485 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 1 [2018-12-02 13:06:45,485 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 13:06:45,512 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 109 treesize of output 80 [2018-12-02 13:06:45,515 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 13:06:45,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,547 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-02 13:06:45,551 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 22 treesize of output 21 [2018-12-02 13:06:45,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,583 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 44 treesize of output 49 [2018-12-02 13:06:45,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,590 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 13:06:45,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,630 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 13:06:45,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,699 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:45,703 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:45,750 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:45,768 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:45,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,837 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 226 treesize of output 227 [2018-12-02 13:06:45,840 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 50 treesize of output 1 [2018-12-02 13:06:45,840 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,850 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,885 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 240 treesize of output 182 [2018-12-02 13:06:45,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,914 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 157 treesize of output 232 [2018-12-02 13:06:45,914 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-02 13:06:45,950 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 22 treesize of output 21 [2018-12-02 13:06:45,951 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:45,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 125 [2018-12-02 13:06:45,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:45,989 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 122 treesize of output 210 [2018-12-02 13:06:45,989 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,013 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,031 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,047 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,075 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 62 treesize of output 55 [2018-12-02 13:06:46,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 13:06:46,080 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,086 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,104 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 13:06:46,131 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 53 treesize of output 49 [2018-12-02 13:06:46,133 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 49 treesize of output 41 [2018-12-02 13:06:46,134 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 13:06:46,138 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 13:06:46,152 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 119 treesize of output 97 [2018-12-02 13:06:46,154 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 97 treesize of output 77 [2018-12-02 13:06:46,155 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 13:06:46,161 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 13:06:46,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2018-12-02 13:06:46,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 13:06:46,174 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,186 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 13:06:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:46,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 13:06:46,458 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 13:06:46,464 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 13:06:46,497 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 13:06:46,502 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 13:06:46,525 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 13:06:46,538 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 13:06:46,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,562 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 273 [2018-12-02 13:06:46,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 13:06:46,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 258 treesize of output 245 [2018-12-02 13:06:46,589 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,602 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 198 treesize of output 196 [2018-12-02 13:06:46,607 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 191 treesize of output 187 [2018-12-02 13:06:46,608 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,610 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,621 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 187 treesize of output 159 [2018-12-02 13:06:46,623 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 13:06:46,623 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 129 [2018-12-02 13:06:46,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,645 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,645 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 31 treesize of output 70 [2018-12-02 13:06:46,646 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 112 [2018-12-02 13:06:46,670 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,671 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,671 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 107 treesize of output 98 [2018-12-02 13:06:46,671 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,685 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 91 treesize of output 83 [2018-12-02 13:06:46,685 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,695 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,696 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,696 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,697 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,697 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,697 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-02 13:06:46,698 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,706 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 13:06:46,708 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 182 treesize of output 168 [2018-12-02 13:06:46,709 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 13:06:46,710 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,715 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 13:06:46,715 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 17 treesize of output 7 [2018-12-02 13:06:46,716 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,718 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 13:06:46,725 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 13:06:46,730 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 13:06:46,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 13:06:46,738 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:98 [2018-12-02 13:06:46,743 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 13:06:46,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,747 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 13:06:46,748 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 13:06:46,749 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 13:06:46,750 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 13:06:46,752 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 13:06:46,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 13:06:46,760 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 13:06:46,762 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 13:06:46,769 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 13:06:46,770 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 13:06:46,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-02 13:06:46,775 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 13:06:46,777 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 13:06:46,779 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 13:06:46,780 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 13:06:46,781 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 13:06:46,782 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 13:06:46,783 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 13:06:46,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 13:06:46,789 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 13:06:46,791 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 13:06:46,800 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 13:06:46,801 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 13:06:46,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-02 13:06:46,806 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 13:06:46,807 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 13:06:46,808 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 13:06:46,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 13:06:46,812 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 13:06:46,813 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 13:06:46,814 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 13:06:46,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 13:06:46,818 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 13:06:46,820 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 13:06:46,824 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 13:06:46,826 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 13:06:46,828 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 13:06:46,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 13:06:46,833 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 13:06:46,834 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 13:06:46,835 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 13:06:46,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 13:06:46,839 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 13:06:46,840 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 13:06:46,842 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 13:06:46,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 13:06:46,846 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 13:06:46,848 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 13:06:46,855 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 13:06:46,856 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 13:06:46,863 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 13:06:46,864 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 13:06:46,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 13:06:46,866 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:20 [2018-12-02 13:06:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 13:06:46,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 13:06:46,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 19 [2018-12-02 13:06:46,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 13:06:46,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 13:06:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 13:06:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-12-02 13:06:46,936 INFO L87 Difference]: Start difference. First operand 1033 states and 1578 transitions. Second operand 15 states. [2018-12-02 13:06:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 13:06:50,159 INFO L93 Difference]: Finished difference Result 3461 states and 5276 transitions. [2018-12-02 13:06:50,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 13:06:50,159 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 197 [2018-12-02 13:06:50,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 13:06:50,160 INFO L225 Difference]: With dead ends: 3461 [2018-12-02 13:06:50,160 INFO L226 Difference]: Without dead ends: 2453 [2018-12-02 13:06:50,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 374 SyntacticMatches, 23 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-12-02 13:06:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-12-02 13:06:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1411. [2018-12-02 13:06:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-12-02 13:06:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2216 transitions. [2018-12-02 13:06:50,243 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2216 transitions. Word has length 197 [2018-12-02 13:06:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 13:06:50,243 INFO L480 AbstractCegarLoop]: Abstraction has 1411 states and 2216 transitions. [2018-12-02 13:06:50,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 13:06:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2216 transitions. [2018-12-02 13:06:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-02 13:06:50,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 13:06:50,244 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, 1, 1, 1] [2018-12-02 13:06:50,244 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 13:06:50,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 13:06:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -66263640, now seen corresponding path program 1 times [2018-12-02 13:06:50,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 13:06:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:50,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 13:06:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 13:06:50,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 13:06:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:06:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 13:06:50,417 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 13:06:50,460 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24590 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 13:06:50,461 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24587 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 13:06:50,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:06:50 BoogieIcfgContainer [2018-12-02 13:06:50,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 13:06:50,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 13:06:50,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 13:06:50,515 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 13:06:50,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:05:49" (3/4) ... [2018-12-02 13:06:50,518 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 13:06:50,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 13:06:50,518 INFO L168 Benchmark]: Toolchain (without parser) took 62013.99 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 655.4 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -313.3 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,519 INFO L168 Benchmark]: CDTParser took 0.13 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 13:06:50,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,520 INFO L168 Benchmark]: Boogie Preprocessor took 58.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,520 INFO L168 Benchmark]: RCFGBuilder took 574.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,520 INFO L168 Benchmark]: TraceAbstraction took 60970.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 501.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:50,520 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 13:06:50,521 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.2 MB). Peak memory consumption was 95.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60970.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 501.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -229.6 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 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 24590 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 24587 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: 1750]: 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={24589: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))={24611:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24602:0}, s={24597:0}, SSLv3_server_data={24589:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24597:0}, SSLv3_server_data={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=1, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589: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] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] 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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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={24589: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=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589: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] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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=1, s={24597:0}, s={24597:0}, s->state=8656, skip=0, SSLv3_server_data={24589: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 [L1594] EXPR s->session [L1594] EXPR s->s3 [L1594] EXPR (s->s3)->tmp.new_cipher [L1594] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1605] COND FALSE !(blastFlag == 13) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1611] COND FALSE !(ret <= 0) [L1616] s->state = 8672 [L1617] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1618] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589: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] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=1, s={24597:0}, s={24597:0}, s->state=8672, skip=0, SSLv3_server_data={24589: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 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1631] COND FALSE !(blastFlag == 14) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1637] COND FALSE !(ret <= 0) [L1642] s->state = 8448 [L1643] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->hit=1, skip=0, SSLv3_server_data={24589: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] [L1643] COND TRUE s->hit [L1644] EXPR s->s3 [L1644] (s->s3)->tmp.next_state = 8640 [L1648] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589: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] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, ret=7, s={24597:0}, s={24597:0}, s->state=8448, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24594, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->s3={24602:0}, skip=0, SSLv3_server_data={24589: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] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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=2, got_new_session=1, init=1, num1=0, ret=7, s={24597:0}, s={24597:0}, s->state=8640, skip=0, SSLv3_server_data={24589: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 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1574] COND FALSE !(blastFlag == 12) VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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] [L1750] __VERIFIER_error() VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, num1=0, ret=0, s={24597:0}, s={24597:0}, skip=0, SSLv3_server_data={24589: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, 164 locations, 1 error locations. UNSAFE Result, 60.9s OverallTime, 116 OverallIterations, 7 TraceHistogramMax, 35.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 27103 SDtfs, 9982 SDslu, 44746 SDs, 0 SdLazy, 28976 SolverSat, 1558 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1510 GetRequests, 925 SyntacticMatches, 187 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 13.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1411occurred in iteration=115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 115 MinimizatonAttempts, 8930 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 15323 NumberOfCodeBlocks, 15323 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 15372 ConstructedInterpolants, 191 QuantifiedInterpolants, 11951553 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1610 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 119 InterpolantComputations, 113 PerfectInterpolantSequences, 15810/16800 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 13:06:52,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 13:06:52,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 13:06:52,060 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 13:06:52,060 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 13:06:52,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 13:06:52,061 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 13:06:52,062 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 13:06:52,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 13:06:52,064 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 13:06:52,065 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 13:06:52,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 13:06:52,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 13:06:52,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 13:06:52,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 13:06:52,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 13:06:52,068 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 13:06:52,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 13:06:52,070 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 13:06:52,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 13:06:52,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 13:06:52,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 13:06:52,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 13:06:52,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 13:06:52,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 13:06:52,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 13:06:52,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 13:06:52,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 13:06:52,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 13:06:52,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 13:06:52,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 13:06:52,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 13:06:52,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 13:06:52,077 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 13:06:52,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 13:06:52,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 13:06:52,077 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 13:06:52,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 13:06:52,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 13:06:52,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 13:06:52,087 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 13:06:52,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 13:06:52,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 13:06:52,088 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 13:06:52,088 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 13:06:52,088 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 13:06:52,088 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 13:06:52,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 13:06:52,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 13:06:52,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 13:06:52,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 13:06:52,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 13:06:52,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 13:06:52,091 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 13:06:52,091 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 13:06:52,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 13:06:52,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 13:06:52,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 13:06:52,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 13:06:52,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 13:06:52,092 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 13:06:52,092 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 13:06:52,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 13:06:52,092 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 13:06:52,092 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 13:06:52,092 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_3812264e-c798-4694-9d7d-8395d101cbc3/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-12-02 13:06:52,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 13:06:52,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 13:06:52,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 13:06:52,127 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 13:06:52,127 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 13:06:52,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-02 13:06:52,164 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/b9905b4c0/05ab8c3ce1d444c98e42636cb388ca81/FLAG7d3c501ed [2018-12-02 13:06:52,620 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 13:06:52,621 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-12-02 13:06:52,631 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/b9905b4c0/05ab8c3ce1d444c98e42636cb388ca81/FLAG7d3c501ed [2018-12-02 13:06:52,639 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3812264e-c798-4694-9d7d-8395d101cbc3/bin-2019/utaipan/data/b9905b4c0/05ab8c3ce1d444c98e42636cb388ca81 [2018-12-02 13:06:52,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 13:06:52,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 13:06:52,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 13:06:52,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 13:06:52,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 13:06:52,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:06:52" (1/1) ... [2018-12-02 13:06:52,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:06:52, skipping insertion in model container [2018-12-02 13:06:52,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:06:52" (1/1) ... [2018-12-02 13:06:52,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 13:06:52,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 13:06:52,943 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:06:53,003 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 13:06:53,061 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 13:06:53,061 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 13:06:53,064 INFO L168 Benchmark]: Toolchain (without parser) took 423.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:53,065 INFO L168 Benchmark]: CDTParser took 0.11 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 13:06:53,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-02 13:06:53,067 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.11 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 421.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 40.6 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...