./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_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_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/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 c336041bbe834e5f5652b9c9de80bd23d0aa7014 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/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 c336041bbe834e5f5652b9c9de80bd23d0aa7014 ............................................................................................................................................................................. 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-09 05:04:46,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:04:46,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:04:46,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:04:46,989 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:04:46,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:04:46,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:04:46,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:04:46,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:04:46,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:04:46,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:04:46,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:04:46,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:04:46,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:04:46,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:04:46,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:04:46,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:04:46,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:04:47,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:04:47,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:04:47,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:04:47,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:04:47,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:04:47,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:04:47,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:04:47,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:04:47,006 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:04:47,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:04:47,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:04:47,008 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:04:47,008 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:04:47,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:04:47,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:04:47,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:04:47,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:04:47,010 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:04:47,011 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 05:04:47,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:04:47,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:04:47,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:04:47,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:04:47,022 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:04:47,023 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:04:47,023 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:04:47,023 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:04:47,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:04:47,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:04:47,023 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:04:47,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:04:47,024 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:04:47,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:04:47,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:04:47,025 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_964a7122-90cc-4671-b104-3ff93d001893/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 -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-12-09 05:04:47,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:04:47,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:04:47,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:04:47,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:04:47,056 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:04:47,056 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-09 05:04:47,098 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/1aea2f26e/bb2d1ff7e3154f3a98f86ce7f8f01b05/FLAG501b4e23c [2018-12-09 05:04:47,545 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:04:47,545 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-09 05:04:47,556 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/1aea2f26e/bb2d1ff7e3154f3a98f86ce7f8f01b05/FLAG501b4e23c [2018-12-09 05:04:47,564 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/1aea2f26e/bb2d1ff7e3154f3a98f86ce7f8f01b05 [2018-12-09 05:04:47,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:04:47,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:04:47,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:04:47,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:04:47,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:04:47,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,572 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 09.12 05:04:47, skipping insertion in model container [2018-12-09 05:04:47,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:04:47,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:04:47,864 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:04:47,873 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:04:47,924 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:04:47,935 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:04:47,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47 WrapperNode [2018-12-09 05:04:47,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:04:47,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:04:47,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:04:47,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:04:47,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:04:47,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:04:47,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:04:47,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:04:47,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:47,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:48,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:48,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... [2018-12-09 05:04:48,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:04:48,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:04:48,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:04:48,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:04:48,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/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-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:04:48,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 05:04:48,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:04:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 05:04:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 05:04:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 05:04:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:04:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:04:48,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:04:48,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:04:48,264 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 05:04:48,264 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 05:04:48,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:04:48,638 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 05:04:48,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:04:48 BoogieIcfgContainer [2018-12-09 05:04:48,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:04:48,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:04:48,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:04:48,642 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:04:48,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:04:47" (1/3) ... [2018-12-09 05:04:48,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60159274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:04:48, skipping insertion in model container [2018-12-09 05:04:48,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:47" (2/3) ... [2018-12-09 05:04:48,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60159274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:04:48, skipping insertion in model container [2018-12-09 05:04:48,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:04:48" (3/3) ... [2018-12-09 05:04:48,645 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-09 05:04:48,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:04:48,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:04:48,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:04:48,701 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:04:48,701 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:04:48,701 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:04:48,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:04:48,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:04:48,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:04:48,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:04:48,702 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:04:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-09 05:04:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 05:04:48,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:48,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:48,727 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:48,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-12-09 05:04:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:48,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:48,915 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-09 05:04:48,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:48,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:48,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:48,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:48,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:48,931 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-09 05:04:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:49,207 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-09 05:04:49,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:49,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-09 05:04:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:49,219 INFO L225 Difference]: With dead ends: 333 [2018-12-09 05:04:49,219 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 05:04:49,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:04:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 05:04:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 05:04:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 05:04:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-09 05:04:49,258 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-09 05:04:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:49,258 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-09 05:04:49,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-09 05:04:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 05:04:49,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:49,260 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:49,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:49,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:49,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1978591950, now seen corresponding path program 1 times [2018-12-09 05:04:49,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:49,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:49,364 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-09 05:04:49,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:49,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:49,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:49,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:49,366 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-09 05:04:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:49,546 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-09 05:04:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:49,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 05:04:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:49,548 INFO L225 Difference]: With dead ends: 296 [2018-12-09 05:04:49,548 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 05:04:49,548 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-09 05:04:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 05:04:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 05:04:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 05:04:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-09 05:04:49,555 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-09 05:04:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-09 05:04:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-09 05:04:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 05:04:49,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:49,556 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:49,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:49,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -659098542, now seen corresponding path program 1 times [2018-12-09 05:04:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:49,633 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-09 05:04:49,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:49,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:04:49,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:49,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:04:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:04:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:04:49,634 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-09 05:04:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:49,906 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-09 05:04:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:04:49,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-09 05:04:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:49,908 INFO L225 Difference]: With dead ends: 300 [2018-12-09 05:04:49,908 INFO L226 Difference]: Without dead ends: 173 [2018-12-09 05:04:49,909 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-09 05:04:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-09 05:04:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-09 05:04:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 05:04:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-09 05:04:49,917 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-09 05:04:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:49,917 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-09 05:04:49,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:04:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-09 05:04:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 05:04:49,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:49,918 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:49,919 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:49,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1162543817, now seen corresponding path program 1 times [2018-12-09 05:04:49,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:49,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:49,978 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-09 05:04:49,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:49,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:49,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:49,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:49,979 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-09 05:04:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:50,148 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-09 05:04:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:50,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 05:04:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:50,150 INFO L225 Difference]: With dead ends: 333 [2018-12-09 05:04:50,150 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 05:04:50,151 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-09 05:04:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 05:04:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-09 05:04:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 05:04:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-09 05:04:50,159 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-09 05:04:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:50,159 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-09 05:04:50,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-09 05:04:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 05:04:50,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:50,160 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:50,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:50,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -480987638, now seen corresponding path program 1 times [2018-12-09 05:04:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:50,217 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-09 05:04:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:50,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:50,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:50,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:50,218 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-09 05:04:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:50,364 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-09 05:04:50,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:50,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 05:04:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:50,365 INFO L225 Difference]: With dead ends: 332 [2018-12-09 05:04:50,365 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 05:04:50,366 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-09 05:04:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 05:04:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 05:04:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 05:04:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-09 05:04:50,370 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-09 05:04:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:50,370 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-09 05:04:50,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-09 05:04:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 05:04:50,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:50,371 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:50,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:50,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:50,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2014271313, now seen corresponding path program 1 times [2018-12-09 05:04:50,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:50,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:50,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:50,412 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-09 05:04:50,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:50,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:50,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:50,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:50,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:50,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:50,413 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-09 05:04:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:50,548 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-09 05:04:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:50,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 05:04:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:50,549 INFO L225 Difference]: With dead ends: 332 [2018-12-09 05:04:50,549 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 05:04:50,549 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-09 05:04:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 05:04:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 05:04:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 05:04:50,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-09 05:04:50,554 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-09 05:04:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:50,554 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-09 05:04:50,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-09 05:04:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 05:04:50,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:50,554 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:50,555 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:50,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:50,555 INFO L82 PathProgramCache]: Analyzing trace with hash -515871290, now seen corresponding path program 1 times [2018-12-09 05:04:50,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:50,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:50,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:50,595 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-09 05:04:50,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:50,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:50,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:50,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:50,596 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-09 05:04:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:50,750 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-09 05:04:50,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:50,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 05:04:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:50,751 INFO L225 Difference]: With dead ends: 332 [2018-12-09 05:04:50,751 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 05:04:50,752 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-09 05:04:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 05:04:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 05:04:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 05:04:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-09 05:04:50,757 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-09 05:04:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:50,757 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-09 05:04:50,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-09 05:04:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 05:04:50,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:50,759 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:50,759 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:50,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:50,759 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-12-09 05:04:50,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:50,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:50,803 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-09 05:04:50,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:50,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:50,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:50,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:50,805 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-09 05:04:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:50,950 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-09 05:04:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:50,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 05:04:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:50,951 INFO L225 Difference]: With dead ends: 361 [2018-12-09 05:04:50,951 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 05:04:50,951 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-09 05:04:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 05:04:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 05:04:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-09 05:04:50,955 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-09 05:04:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:50,955 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-09 05:04:50,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-09 05:04:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 05:04:50,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:50,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:50,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:50,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1702821866, now seen corresponding path program 1 times [2018-12-09 05:04:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:50,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:50,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:50,986 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-09 05:04:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:50,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:50,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:50,987 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-09 05:04:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:51,114 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-09 05:04:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:51,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 05:04:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:51,115 INFO L225 Difference]: With dead ends: 376 [2018-12-09 05:04:51,115 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 05:04:51,116 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-09 05:04:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 05:04:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-09 05:04:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-09 05:04:51,120 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-09 05:04:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:51,120 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-09 05:04:51,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-09 05:04:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 05:04:51,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:51,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:51,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:51,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 480798369, now seen corresponding path program 1 times [2018-12-09 05:04:51,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:51,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:51,162 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-09 05:04:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:51,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:51,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:51,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:51,163 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-09 05:04:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:51,296 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-09 05:04:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:51,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 05:04:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:51,297 INFO L225 Difference]: With dead ends: 366 [2018-12-09 05:04:51,297 INFO L226 Difference]: Without dead ends: 197 [2018-12-09 05:04:51,297 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-09 05:04:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-09 05:04:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-09 05:04:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-09 05:04:51,302 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-09 05:04:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:51,302 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-09 05:04:51,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-09 05:04:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 05:04:51,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:51,303 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:51,303 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:51,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1484856716, now seen corresponding path program 1 times [2018-12-09 05:04:51,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:51,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:51,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:51,345 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-09 05:04:51,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:51,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:51,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:51,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:51,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:51,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:51,346 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-09 05:04:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:51,518 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-09 05:04:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:51,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-09 05:04:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:51,520 INFO L225 Difference]: With dead ends: 383 [2018-12-09 05:04:51,520 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 05:04:51,521 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-09 05:04:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 05:04:51,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 05:04:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:51,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-09 05:04:51,528 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-09 05:04:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:51,529 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-09 05:04:51,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:51,529 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-09 05:04:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 05:04:51,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:51,530 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:51,530 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:51,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270063, now seen corresponding path program 1 times [2018-12-09 05:04:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:51,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:51,581 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-09 05:04:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:51,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:51,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:51,582 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-09 05:04:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:51,774 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-09 05:04:51,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:51,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 05:04:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:51,775 INFO L225 Difference]: With dead ends: 381 [2018-12-09 05:04:51,775 INFO L226 Difference]: Without dead ends: 212 [2018-12-09 05:04:51,776 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-09 05:04:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-09 05:04:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-09 05:04:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-09 05:04:51,779 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-09 05:04:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:51,779 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-09 05:04:51,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-09 05:04:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 05:04:51,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:51,780 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:51,780 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:51,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash -488261392, now seen corresponding path program 1 times [2018-12-09 05:04:51,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:51,808 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-09 05:04:51,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:51,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:51,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:51,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:51,808 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-09 05:04:51,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:51,986 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-09 05:04:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:51,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 05:04:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:51,987 INFO L225 Difference]: With dead ends: 380 [2018-12-09 05:04:51,987 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 05:04:51,988 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-09 05:04:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 05:04:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 05:04:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-09 05:04:51,994 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-09 05:04:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:51,994 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-09 05:04:51,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-09 05:04:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 05:04:51,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:51,995 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:51,995 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2055209609, now seen corresponding path program 1 times [2018-12-09 05:04:51,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:51,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:52,047 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-09 05:04:52,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:52,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:52,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:52,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:52,048 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-09 05:04:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:52,198 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-09 05:04:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:52,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-09 05:04:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:52,199 INFO L225 Difference]: With dead ends: 380 [2018-12-09 05:04:52,199 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 05:04:52,200 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-09 05:04:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 05:04:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 05:04:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-09 05:04:52,206 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-09 05:04:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:52,206 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-09 05:04:52,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-09 05:04:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 05:04:52,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:52,207 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:52,207 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:52,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1083985708, now seen corresponding path program 1 times [2018-12-09 05:04:52,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:52,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:52,261 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-09 05:04:52,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:52,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:52,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:52,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:52,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:52,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:52,262 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-09 05:04:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:52,431 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-09 05:04:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:52,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 05:04:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:52,432 INFO L225 Difference]: With dead ends: 380 [2018-12-09 05:04:52,432 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 05:04:52,433 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-09 05:04:52,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 05:04:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 05:04:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-09 05:04:52,439 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-09 05:04:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:52,439 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-09 05:04:52,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-09 05:04:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 05:04:52,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:52,440 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:52,440 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:52,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:52,441 INFO L82 PathProgramCache]: Analyzing trace with hash -241218748, now seen corresponding path program 1 times [2018-12-09 05:04:52,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:52,482 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-09 05:04:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:52,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:52,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:52,482 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-09 05:04:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:52,631 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-09 05:04:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:52,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 05:04:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:52,632 INFO L225 Difference]: With dead ends: 380 [2018-12-09 05:04:52,632 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 05:04:52,632 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-09 05:04:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 05:04:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 05:04:52,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-09 05:04:52,638 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-09 05:04:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:52,638 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-09 05:04:52,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-09 05:04:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:04:52,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:52,639 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:52,639 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:52,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 345081479, now seen corresponding path program 1 times [2018-12-09 05:04:52,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:52,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:52,689 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-09 05:04:52,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:52,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:52,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:52,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:52,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:52,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:52,690 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-09 05:04:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:52,834 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-09 05:04:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:52,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 05:04:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:52,835 INFO L225 Difference]: With dead ends: 370 [2018-12-09 05:04:52,835 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 05:04:52,836 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-09 05:04:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 05:04:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-09 05:04:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 05:04:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-09 05:04:52,842 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-09 05:04:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:52,842 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-09 05:04:52,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-09 05:04:52,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 05:04:52,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:52,843 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:52,843 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:52,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-12-09 05:04:52,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:52,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:52,891 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-09 05:04:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:52,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:52,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:52,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:52,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:52,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:52,892 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-09 05:04:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:53,123 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-09 05:04:53,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:53,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 05:04:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:53,124 INFO L225 Difference]: With dead ends: 469 [2018-12-09 05:04:53,124 INFO L226 Difference]: Without dead ends: 300 [2018-12-09 05:04:53,125 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-09 05:04:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-09 05:04:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-12-09 05:04:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-09 05:04:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-09 05:04:53,132 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-09 05:04:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:53,132 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-09 05:04:53,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:53,133 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-09 05:04:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 05:04:53,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:53,133 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:53,133 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:53,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:53,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1368287841, now seen corresponding path program 1 times [2018-12-09 05:04:53,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:53,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:53,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:53,184 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-09 05:04:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:53,185 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:53,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:53,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:53,185 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-09 05:04:53,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:53,383 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-09 05:04:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:53,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 05:04:53,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:53,384 INFO L225 Difference]: With dead ends: 472 [2018-12-09 05:04:53,384 INFO L226 Difference]: Without dead ends: 273 [2018-12-09 05:04:53,385 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-09 05:04:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-09 05:04:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-09 05:04:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-09 05:04:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-09 05:04:53,393 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-09 05:04:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:53,393 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-09 05:04:53,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-09 05:04:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 05:04:53,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:53,395 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:53,395 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:53,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2002550352, now seen corresponding path program 1 times [2018-12-09 05:04:53,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:53,444 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-09 05:04:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:53,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:53,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:53,445 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-09 05:04:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:53,694 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-09 05:04:53,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:53,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 05:04:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:53,696 INFO L225 Difference]: With dead ends: 539 [2018-12-09 05:04:53,696 INFO L226 Difference]: Without dead ends: 316 [2018-12-09 05:04:53,697 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-09 05:04:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-09 05:04:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-12-09 05:04:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 05:04:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-09 05:04:53,711 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-09 05:04:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:53,712 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-09 05:04:53,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-09 05:04:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 05:04:53,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:53,713 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:53,713 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:53,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -959400867, now seen corresponding path program 1 times [2018-12-09 05:04:53,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:53,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:53,794 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-09 05:04:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:53,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:53,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:53,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:53,796 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-09 05:04:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:54,040 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-12-09 05:04:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:54,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 05:04:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:54,041 INFO L225 Difference]: With dead ends: 540 [2018-12-09 05:04:54,041 INFO L226 Difference]: Without dead ends: 316 [2018-12-09 05:04:54,041 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-09 05:04:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-09 05:04:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-12-09 05:04:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-09 05:04:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-09 05:04:54,049 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2018-12-09 05:04:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:54,049 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-09 05:04:54,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-09 05:04:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 05:04:54,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:54,049 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-09 05:04:54,050 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:54,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:54,050 INFO L82 PathProgramCache]: Analyzing trace with hash 316009449, now seen corresponding path program 1 times [2018-12-09 05:04:54,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:54,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:54,092 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-09 05:04:54,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:54,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:54,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:54,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:54,093 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-09 05:04:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:54,327 INFO L93 Difference]: Finished difference Result 544 states and 826 transitions. [2018-12-09 05:04:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:54,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-09 05:04:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:54,328 INFO L225 Difference]: With dead ends: 544 [2018-12-09 05:04:54,328 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 05:04:54,329 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-09 05:04:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 05:04:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-09 05:04:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-09 05:04:54,334 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2018-12-09 05:04:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:54,334 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-09 05:04:54,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-09 05:04:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:04:54,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:54,335 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:54,335 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:54,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash 62751798, now seen corresponding path program 1 times [2018-12-09 05:04:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:54,384 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-09 05:04:54,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:54,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:54,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:54,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:54,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:54,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:54,385 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-09 05:04:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:54,579 INFO L93 Difference]: Finished difference Result 545 states and 826 transitions. [2018-12-09 05:04:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:54,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 05:04:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:54,580 INFO L225 Difference]: With dead ends: 545 [2018-12-09 05:04:54,580 INFO L226 Difference]: Without dead ends: 310 [2018-12-09 05:04:54,580 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-09 05:04:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-09 05:04:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-09 05:04:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-09 05:04:54,589 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-09 05:04:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:54,589 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-09 05:04:54,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-09 05:04:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 05:04:54,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:54,590 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:54,590 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:54,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:54,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1991024500, now seen corresponding path program 1 times [2018-12-09 05:04:54,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:54,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:54,631 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-09 05:04:54,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:54,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:54,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:54,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:54,631 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-09 05:04:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:54,798 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-09 05:04:54,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:54,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 05:04:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:54,800 INFO L225 Difference]: With dead ends: 520 [2018-12-09 05:04:54,800 INFO L226 Difference]: Without dead ends: 285 [2018-12-09 05:04:54,800 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-09 05:04:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-09 05:04:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-09 05:04:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-09 05:04:54,806 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-09 05:04:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:54,806 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-09 05:04:54,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-09 05:04:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:04:54,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:54,807 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:54,807 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:54,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash 19690565, now seen corresponding path program 1 times [2018-12-09 05:04:54,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:54,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:54,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:54,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:54,836 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-09 05:04:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:54,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:54,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:54,837 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-09 05:04:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:55,033 INFO L93 Difference]: Finished difference Result 543 states and 820 transitions. [2018-12-09 05:04:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:55,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 05:04:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:55,035 INFO L225 Difference]: With dead ends: 543 [2018-12-09 05:04:55,035 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 05:04:55,035 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-09 05:04:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 05:04:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-09 05:04:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-09 05:04:55,046 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-09 05:04:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:55,046 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-09 05:04:55,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-09 05:04:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:04:55,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:55,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:55,047 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:55,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1623840890, now seen corresponding path program 1 times [2018-12-09 05:04:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:55,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:55,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:55,089 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-09 05:04:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:55,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:55,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:55,091 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-09 05:04:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:55,278 INFO L93 Difference]: Finished difference Result 542 states and 817 transitions. [2018-12-09 05:04:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:55,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 05:04:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:55,279 INFO L225 Difference]: With dead ends: 542 [2018-12-09 05:04:55,279 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 05:04:55,280 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-09 05:04:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 05:04:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-09 05:04:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-09 05:04:55,289 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-09 05:04:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:55,289 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-09 05:04:55,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-09 05:04:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:04:55,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:55,290 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:55,290 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:55,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -333397817, now seen corresponding path program 1 times [2018-12-09 05:04:55,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:55,340 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-09 05:04:55,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:55,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:55,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:55,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:55,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:55,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:55,341 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-09 05:04:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:55,498 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-09 05:04:55,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:55,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 05:04:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:55,499 INFO L225 Difference]: With dead ends: 518 [2018-12-09 05:04:55,499 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 05:04:55,500 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-09 05:04:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 05:04:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-09 05:04:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-09 05:04:55,505 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-09 05:04:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:55,505 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-09 05:04:55,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-09 05:04:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 05:04:55,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:55,506 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:55,506 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:55,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:55,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1976929272, now seen corresponding path program 1 times [2018-12-09 05:04:55,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:55,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:55,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:55,543 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-09 05:04:55,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:55,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:55,544 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:55,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:55,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:55,544 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-09 05:04:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:55,688 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-09 05:04:55,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:55,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 05:04:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:55,689 INFO L225 Difference]: With dead ends: 517 [2018-12-09 05:04:55,689 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 05:04:55,689 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-09 05:04:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 05:04:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 05:04:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-09 05:04:55,695 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-09 05:04:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:55,695 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-09 05:04:55,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-09 05:04:55,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 05:04:55,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:55,696 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:55,696 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:55,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1211983539, now seen corresponding path program 1 times [2018-12-09 05:04:55,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:55,720 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-09 05:04:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:55,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:55,721 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-09 05:04:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:55,931 INFO L93 Difference]: Finished difference Result 542 states and 811 transitions. [2018-12-09 05:04:55,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:55,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 05:04:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:55,932 INFO L225 Difference]: With dead ends: 542 [2018-12-09 05:04:55,932 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 05:04:55,932 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-09 05:04:55,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 05:04:55,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-09 05:04:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-09 05:04:55,941 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-09 05:04:55,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:55,942 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-09 05:04:55,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-09 05:04:55,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 05:04:55,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:55,942 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:55,943 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:55,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:55,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1143821711, now seen corresponding path program 1 times [2018-12-09 05:04:55,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:55,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:55,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:55,975 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-09 05:04:55,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:55,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:55,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:55,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:55,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:55,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:55,976 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-09 05:04:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:56,125 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-09 05:04:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:56,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 05:04:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:56,126 INFO L225 Difference]: With dead ends: 517 [2018-12-09 05:04:56,126 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 05:04:56,126 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-09 05:04:56,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 05:04:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 05:04:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-09 05:04:56,136 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-09 05:04:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:56,136 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-09 05:04:56,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-09 05:04:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:04:56,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:56,137 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:56,137 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:56,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 713781314, now seen corresponding path program 1 times [2018-12-09 05:04:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:56,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:56,174 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-09 05:04:56,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:56,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:56,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:56,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:56,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:56,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:56,175 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-09 05:04:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:56,371 INFO L93 Difference]: Finished difference Result 542 states and 807 transitions. [2018-12-09 05:04:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:56,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 05:04:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:56,372 INFO L225 Difference]: With dead ends: 542 [2018-12-09 05:04:56,372 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 05:04:56,373 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-09 05:04:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 05:04:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-09 05:04:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-09 05:04:56,380 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-09 05:04:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:56,380 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-09 05:04:56,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-09 05:04:56,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 05:04:56,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:56,381 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:56,381 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:56,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 698262596, now seen corresponding path program 1 times [2018-12-09 05:04:56,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:56,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:56,410 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-09 05:04:56,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:56,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:56,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:56,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:56,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:56,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:56,411 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-09 05:04:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:56,595 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-09 05:04:56,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:56,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 05:04:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:56,596 INFO L225 Difference]: With dead ends: 517 [2018-12-09 05:04:56,596 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 05:04:56,596 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-09 05:04:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 05:04:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 05:04:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-09 05:04:56,603 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-09 05:04:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:56,603 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-09 05:04:56,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-09 05:04:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 05:04:56,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:56,604 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:56,604 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:56,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1167346926, now seen corresponding path program 1 times [2018-12-09 05:04:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:56,635 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-09 05:04:56,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:56,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:56,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:56,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:56,636 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-09 05:04:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:56,838 INFO L93 Difference]: Finished difference Result 542 states and 803 transitions. [2018-12-09 05:04:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:56,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 05:04:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:56,839 INFO L225 Difference]: With dead ends: 542 [2018-12-09 05:04:56,839 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 05:04:56,839 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-09 05:04:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 05:04:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-09 05:04:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-09 05:04:56,846 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-09 05:04:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:56,846 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-09 05:04:56,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-09 05:04:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 05:04:56,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:56,847 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:56,847 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:56,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:56,847 INFO L82 PathProgramCache]: Analyzing trace with hash 686266668, now seen corresponding path program 1 times [2018-12-09 05:04:56,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:56,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:56,882 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-09 05:04:56,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:56,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:56,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:56,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:56,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:56,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:56,883 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-09 05:04:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,050 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-09 05:04:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 05:04:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,051 INFO L225 Difference]: With dead ends: 517 [2018-12-09 05:04:57,051 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 05:04:57,051 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-09 05:04:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 05:04:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 05:04:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-09 05:04:57,057 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-09 05:04:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,057 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-09 05:04:57,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-09 05:04:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:04:57,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,058 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,058 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1060944413, now seen corresponding path program 1 times [2018-12-09 05:04:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,085 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-09 05:04:57,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:57,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:57,085 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-09 05:04:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,256 INFO L93 Difference]: Finished difference Result 532 states and 787 transitions. [2018-12-09 05:04:57,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:57,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 05:04:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,257 INFO L225 Difference]: With dead ends: 532 [2018-12-09 05:04:57,257 INFO L226 Difference]: Without dead ends: 297 [2018-12-09 05:04:57,257 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-09 05:04:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-09 05:04:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-09 05:04:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-09 05:04:57,265 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-09 05:04:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,265 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-09 05:04:57,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-09 05:04:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 05:04:57,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,266 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash -967641697, now seen corresponding path program 1 times [2018-12-09 05:04:57,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,308 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-09 05:04:57,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:57,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:57,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:57,309 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-09 05:04:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,460 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-09 05:04:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:57,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 05:04:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,461 INFO L225 Difference]: With dead ends: 507 [2018-12-09 05:04:57,462 INFO L226 Difference]: Without dead ends: 272 [2018-12-09 05:04:57,462 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-09 05:04:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-09 05:04:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-09 05:04:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-09 05:04:57,468 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-09 05:04:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,468 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-09 05:04:57,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-09 05:04:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:04:57,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,469 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,469 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1531434557, now seen corresponding path program 1 times [2018-12-09 05:04:57,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,497 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-09 05:04:57,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:57,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:57,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:57,498 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-09 05:04:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,672 INFO L93 Difference]: Finished difference Result 532 states and 783 transitions. [2018-12-09 05:04:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:57,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 05:04:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,673 INFO L225 Difference]: With dead ends: 532 [2018-12-09 05:04:57,673 INFO L226 Difference]: Without dead ends: 297 [2018-12-09 05:04:57,673 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-09 05:04:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-09 05:04:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-09 05:04:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 05:04:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-09 05:04:57,680 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-09 05:04:57,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,680 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-09 05:04:57,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-09 05:04:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 05:04:57,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,681 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,681 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,681 INFO L82 PathProgramCache]: Analyzing trace with hash -144649147, now seen corresponding path program 1 times [2018-12-09 05:04:57,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-09 05:04:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:57,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:57,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:57,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:57,705 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-09 05:04:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,735 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-09 05:04:57,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:57,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-09 05:04:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,736 INFO L225 Difference]: With dead ends: 728 [2018-12-09 05:04:57,736 INFO L226 Difference]: Without dead ends: 493 [2018-12-09 05:04:57,736 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-09 05:04:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-09 05:04:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-09 05:04:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-09 05:04:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-09 05:04:57,749 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-09 05:04:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,749 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-09 05:04:57,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-09 05:04:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 05:04:57,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,750 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,750 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -282131921, now seen corresponding path program 1 times [2018-12-09 05:04:57,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,771 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-09 05:04:57,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:57,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:57,772 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-09 05:04:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,822 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-09 05:04:57,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:57,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 05:04:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,823 INFO L225 Difference]: With dead ends: 1196 [2018-12-09 05:04:57,823 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 05:04:57,824 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-09 05:04:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 05:04:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-09 05:04:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-09 05:04:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-09 05:04:57,846 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-09 05:04:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,846 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-09 05:04:57,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-09 05:04:57,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 05:04:57,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,847 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,847 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1666602963, now seen corresponding path program 1 times [2018-12-09 05:04:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,879 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-09 05:04:57,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:57,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:57,880 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-09 05:04:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:57,926 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-09 05:04:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:57,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-09 05:04:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:57,927 INFO L225 Difference]: With dead ends: 1662 [2018-12-09 05:04:57,927 INFO L226 Difference]: Without dead ends: 961 [2018-12-09 05:04:57,928 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-09 05:04:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-09 05:04:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-09 05:04:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-09 05:04:57,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-09 05:04:57,952 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2018-12-09 05:04:57,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:57,952 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-09 05:04:57,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:57,952 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-09 05:04:57,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 05:04:57,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:57,953 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:57,953 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:57,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash -37863631, now seen corresponding path program 1 times [2018-12-09 05:04:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:57,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:57,997 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-09 05:04:57,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:57,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:57,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:57,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:57,998 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-09 05:04:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:58,286 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-12-09 05:04:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:58,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 05:04:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:58,288 INFO L225 Difference]: With dead ends: 2303 [2018-12-09 05:04:58,288 INFO L226 Difference]: Without dead ends: 1369 [2018-12-09 05:04:58,289 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-09 05:04:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-12-09 05:04:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-12-09 05:04:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-09 05:04:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-09 05:04:58,317 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2018-12-09 05:04:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:58,318 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-09 05:04:58,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-09 05:04:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 05:04:58,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:58,318 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:58,319 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:58,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:58,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1181107307, now seen corresponding path program 1 times [2018-12-09 05:04:58,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:58,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:58,363 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-09 05:04:58,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:58,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:58,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:58,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:58,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:58,364 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-09 05:04:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:58,657 INFO L93 Difference]: Finished difference Result 2441 states and 3659 transitions. [2018-12-09 05:04:58,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:58,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-09 05:04:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:58,660 INFO L225 Difference]: With dead ends: 2441 [2018-12-09 05:04:58,660 INFO L226 Difference]: Without dead ends: 1351 [2018-12-09 05:04:58,661 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-09 05:04:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-12-09 05:04:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2018-12-09 05:04:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-09 05:04:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-09 05:04:58,690 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2018-12-09 05:04:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:58,690 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-09 05:04:58,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-09 05:04:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 05:04:58,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:58,691 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:58,691 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:58,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:58,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2028637021, now seen corresponding path program 1 times [2018-12-09 05:04:58,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:58,720 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-09 05:04:58,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:58,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:58,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:58,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:58,720 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2018-12-09 05:04:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:58,771 INFO L93 Difference]: Finished difference Result 1341 states and 2010 transitions. [2018-12-09 05:04:58,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:58,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-09 05:04:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:58,774 INFO L225 Difference]: With dead ends: 1341 [2018-12-09 05:04:58,774 INFO L226 Difference]: Without dead ends: 1339 [2018-12-09 05:04:58,775 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-09 05:04:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-12-09 05:04:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2018-12-09 05:04:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:04:58,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2018-12-09 05:04:58,810 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2018-12-09 05:04:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:58,810 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2018-12-09 05:04:58,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2018-12-09 05:04:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 05:04:58,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:58,812 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:58,812 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:58,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:58,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1213729120, now seen corresponding path program 1 times [2018-12-09 05:04:58,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:58,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:58,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:04:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:58,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:58,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:58,875 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2018-12-09 05:04:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:59,181 INFO L93 Difference]: Finished difference Result 2994 states and 4461 transitions. [2018-12-09 05:04:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:59,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-09 05:04:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:59,184 INFO L225 Difference]: With dead ends: 2994 [2018-12-09 05:04:59,185 INFO L226 Difference]: Without dead ends: 1682 [2018-12-09 05:04:59,186 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-09 05:04:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-12-09 05:04:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2018-12-09 05:04:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:04:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2018-12-09 05:04:59,222 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2018-12-09 05:04:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:59,222 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2018-12-09 05:04:59,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2018-12-09 05:04:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 05:04:59,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:59,223 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:59,223 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:59,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:59,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1413134743, now seen corresponding path program 1 times [2018-12-09 05:04:59,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:59,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:59,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:59,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:04:59,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:59,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:59,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:59,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:59,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:59,265 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2018-12-09 05:04:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:59,796 INFO L93 Difference]: Finished difference Result 2984 states and 4441 transitions. [2018-12-09 05:04:59,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:04:59,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-09 05:04:59,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:59,799 INFO L225 Difference]: With dead ends: 2984 [2018-12-09 05:04:59,799 INFO L226 Difference]: Without dead ends: 1672 [2018-12-09 05:04:59,801 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-09 05:04:59,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-12-09 05:04:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2018-12-09 05:04:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:04:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2018-12-09 05:04:59,839 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2018-12-09 05:04:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:59,839 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2018-12-09 05:04:59,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:04:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2018-12-09 05:04:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 05:04:59,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:59,840 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:59,840 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:59,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -244893672, now seen corresponding path program 1 times [2018-12-09 05:04:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:59,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:59,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:04:59,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:59,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:04:59,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:59,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:04:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:04:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:04:59,889 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2018-12-09 05:05:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:00,216 INFO L93 Difference]: Finished difference Result 2979 states and 4426 transitions. [2018-12-09 05:05:00,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:00,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-09 05:05:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:00,219 INFO L225 Difference]: With dead ends: 2979 [2018-12-09 05:05:00,219 INFO L226 Difference]: Without dead ends: 1667 [2018-12-09 05:05:00,220 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-09 05:05:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-09 05:05:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-09 05:05:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2018-12-09 05:05:00,275 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2018-12-09 05:05:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:00,275 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2018-12-09 05:05:00,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:00,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2018-12-09 05:05:00,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 05:05:00,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:00,276 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:00,276 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:00,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1997763491, now seen corresponding path program 1 times [2018-12-09 05:05:00,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:00,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:00,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:00,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:00,313 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-09 05:05:00,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:00,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:00,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:00,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:00,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:00,313 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2018-12-09 05:05:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:00,627 INFO L93 Difference]: Finished difference Result 2979 states and 4416 transitions. [2018-12-09 05:05:00,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:00,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-09 05:05:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:00,630 INFO L225 Difference]: With dead ends: 2979 [2018-12-09 05:05:00,630 INFO L226 Difference]: Without dead ends: 1667 [2018-12-09 05:05:00,631 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-09 05:05:00,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-09 05:05:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-09 05:05:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2018-12-09 05:05:00,670 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2018-12-09 05:05:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:00,670 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2018-12-09 05:05:00,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2018-12-09 05:05:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 05:05:00,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:00,671 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:00,671 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:00,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:00,671 INFO L82 PathProgramCache]: Analyzing trace with hash -656974124, now seen corresponding path program 1 times [2018-12-09 05:05:00,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:00,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:00,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:00,701 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-09 05:05:00,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:00,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:00,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:00,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:00,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:00,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:00,702 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2018-12-09 05:05:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:00,995 INFO L93 Difference]: Finished difference Result 2979 states and 4406 transitions. [2018-12-09 05:05:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:00,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-09 05:05:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:00,998 INFO L225 Difference]: With dead ends: 2979 [2018-12-09 05:05:00,998 INFO L226 Difference]: Without dead ends: 1667 [2018-12-09 05:05:00,999 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-09 05:05:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-09 05:05:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-09 05:05:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2018-12-09 05:05:01,040 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2018-12-09 05:05:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:01,040 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2018-12-09 05:05:01,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2018-12-09 05:05:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 05:05:01,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:01,041 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:01,041 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:01,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash 631021400, now seen corresponding path program 1 times [2018-12-09 05:05:01,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:01,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:01,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:01,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:01,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:01,072 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-09 05:05:01,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:01,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:01,072 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:01,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:01,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:01,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:01,073 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2018-12-09 05:05:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:01,685 INFO L93 Difference]: Finished difference Result 2979 states and 4396 transitions. [2018-12-09 05:05:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:01,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-09 05:05:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:01,690 INFO L225 Difference]: With dead ends: 2979 [2018-12-09 05:05:01,690 INFO L226 Difference]: Without dead ends: 1667 [2018-12-09 05:05:01,691 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-09 05:05:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-09 05:05:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-09 05:05:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2018-12-09 05:05:01,734 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2018-12-09 05:05:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:01,734 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2018-12-09 05:05:01,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2018-12-09 05:05:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 05:05:01,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:01,736 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:01,736 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:01,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 282407791, now seen corresponding path program 1 times [2018-12-09 05:05:01,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:01,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:01,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:01,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:01,767 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-09 05:05:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:01,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:01,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:01,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:01,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:01,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:01,768 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2018-12-09 05:05:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:02,114 INFO L93 Difference]: Finished difference Result 2929 states and 4326 transitions. [2018-12-09 05:05:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:02,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 05:05:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:02,117 INFO L225 Difference]: With dead ends: 2929 [2018-12-09 05:05:02,117 INFO L226 Difference]: Without dead ends: 1617 [2018-12-09 05:05:02,119 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-09 05:05:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-09 05:05:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-09 05:05:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2018-12-09 05:05:02,162 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2018-12-09 05:05:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:02,163 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2018-12-09 05:05:02,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2018-12-09 05:05:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 05:05:02,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:02,164 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:02,164 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:02,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:02,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1267678059, now seen corresponding path program 1 times [2018-12-09 05:05:02,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:02,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:02,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:02,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:02,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:02,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:02,230 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2018-12-09 05:05:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:02,586 INFO L93 Difference]: Finished difference Result 2929 states and 4316 transitions. [2018-12-09 05:05:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:02,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 05:05:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:02,589 INFO L225 Difference]: With dead ends: 2929 [2018-12-09 05:05:02,589 INFO L226 Difference]: Without dead ends: 1617 [2018-12-09 05:05:02,590 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-09 05:05:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-09 05:05:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-09 05:05:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2018-12-09 05:05:02,635 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2018-12-09 05:05:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:02,635 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2018-12-09 05:05:02,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2018-12-09 05:05:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 05:05:02,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:02,637 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:02,637 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1266288130, now seen corresponding path program 1 times [2018-12-09 05:05:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:02,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:02,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:02,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:02,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:02,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:02,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:02,672 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2018-12-09 05:05:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:02,928 INFO L93 Difference]: Finished difference Result 2904 states and 4274 transitions. [2018-12-09 05:05:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:02,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-09 05:05:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:02,931 INFO L225 Difference]: With dead ends: 2904 [2018-12-09 05:05:02,931 INFO L226 Difference]: Without dead ends: 1592 [2018-12-09 05:05:02,932 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-09 05:05:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-09 05:05:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-09 05:05:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2018-12-09 05:05:02,979 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2018-12-09 05:05:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:02,979 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2018-12-09 05:05:02,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2018-12-09 05:05:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 05:05:02,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:02,981 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:02,981 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:02,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:02,981 INFO L82 PathProgramCache]: Analyzing trace with hash -881845026, now seen corresponding path program 1 times [2018-12-09 05:05:02,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:02,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:02,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:03,019 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-09 05:05:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:03,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:03,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:03,020 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2018-12-09 05:05:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:03,302 INFO L93 Difference]: Finished difference Result 2904 states and 4264 transitions. [2018-12-09 05:05:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:03,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 05:05:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:03,305 INFO L225 Difference]: With dead ends: 2904 [2018-12-09 05:05:03,305 INFO L226 Difference]: Without dead ends: 1592 [2018-12-09 05:05:03,306 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-09 05:05:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-09 05:05:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-09 05:05:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 05:05:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2018-12-09 05:05:03,351 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2018-12-09 05:05:03,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:03,351 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2018-12-09 05:05:03,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:03,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2018-12-09 05:05:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 05:05:03,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:03,352 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:03,352 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:03,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2122694251, now seen corresponding path program 1 times [2018-12-09 05:05:03,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:03,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:03,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:03,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:03,402 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-09 05:05:03,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:03,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:03,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:03,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:03,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:03,403 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2018-12-09 05:05:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:03,636 INFO L93 Difference]: Finished difference Result 2864 states and 4189 transitions. [2018-12-09 05:05:03,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:03,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 05:05:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:03,638 INFO L225 Difference]: With dead ends: 2864 [2018-12-09 05:05:03,638 INFO L226 Difference]: Without dead ends: 1552 [2018-12-09 05:05:03,640 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-09 05:05:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-09 05:05:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2018-12-09 05:05:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-09 05:05:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2018-12-09 05:05:03,701 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2018-12-09 05:05:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:03,701 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2018-12-09 05:05:03,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2018-12-09 05:05:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 05:05:03,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:03,702 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:03,702 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:03,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash -687223747, now seen corresponding path program 1 times [2018-12-09 05:05:03,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:03,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:03,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:03,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:03,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:03,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:03,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:03,737 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2018-12-09 05:05:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:04,002 INFO L93 Difference]: Finished difference Result 2844 states and 4149 transitions. [2018-12-09 05:05:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:04,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 05:05:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:04,005 INFO L225 Difference]: With dead ends: 2844 [2018-12-09 05:05:04,005 INFO L226 Difference]: Without dead ends: 1552 [2018-12-09 05:05:04,006 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-09 05:05:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-09 05:05:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-09 05:05:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-09 05:05:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2018-12-09 05:05:04,053 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2018-12-09 05:05:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:04,053 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2018-12-09 05:05:04,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2018-12-09 05:05:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 05:05:04,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:04,054 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:04,054 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:04,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2016708884, now seen corresponding path program 1 times [2018-12-09 05:05:04,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:04,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:04,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:04,116 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2018-12-09 05:05:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:04,378 INFO L93 Difference]: Finished difference Result 2869 states and 4179 transitions. [2018-12-09 05:05:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:04,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 05:05:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:04,381 INFO L225 Difference]: With dead ends: 2869 [2018-12-09 05:05:04,381 INFO L226 Difference]: Without dead ends: 1552 [2018-12-09 05:05:04,383 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-09 05:05:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-09 05:05:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-09 05:05:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-09 05:05:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2018-12-09 05:05:04,432 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2018-12-09 05:05:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:04,432 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2018-12-09 05:05:04,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2018-12-09 05:05:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 05:05:04,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:04,434 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:04,434 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:04,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1512822124, now seen corresponding path program 1 times [2018-12-09 05:05:04,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:04,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:04,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:04,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:04,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:04,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:04,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:04,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:04,488 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2018-12-09 05:05:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:04,729 INFO L93 Difference]: Finished difference Result 2859 states and 4159 transitions. [2018-12-09 05:05:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:04,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 05:05:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:04,732 INFO L225 Difference]: With dead ends: 2859 [2018-12-09 05:05:04,732 INFO L226 Difference]: Without dead ends: 1542 [2018-12-09 05:05:04,733 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-09 05:05:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-09 05:05:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2018-12-09 05:05:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-09 05:05:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2018-12-09 05:05:04,783 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2018-12-09 05:05:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:04,783 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2018-12-09 05:05:04,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2018-12-09 05:05:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 05:05:04,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:04,785 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:04,785 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:04,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:04,785 INFO L82 PathProgramCache]: Analyzing trace with hash -450055269, now seen corresponding path program 1 times [2018-12-09 05:05:04,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:04,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:04,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:04,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:04,821 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-09 05:05:04,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:04,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:04,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:04,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:04,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:04,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:04,822 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2018-12-09 05:05:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:05,045 INFO L93 Difference]: Finished difference Result 2849 states and 4139 transitions. [2018-12-09 05:05:05,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:05,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 05:05:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:05,047 INFO L225 Difference]: With dead ends: 2849 [2018-12-09 05:05:05,047 INFO L226 Difference]: Without dead ends: 1527 [2018-12-09 05:05:05,048 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-09 05:05:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2018-12-09 05:05:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1352. [2018-12-09 05:05:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-09 05:05:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1962 transitions. [2018-12-09 05:05:05,096 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1962 transitions. Word has length 156 [2018-12-09 05:05:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:05,096 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1962 transitions. [2018-12-09 05:05:05,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1962 transitions. [2018-12-09 05:05:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 05:05:05,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:05,097 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:05,098 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:05,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1699531317, now seen corresponding path program 1 times [2018-12-09 05:05:05,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:05,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 05:05:05,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:05,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:05,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:05,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:05,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:05,134 INFO L87 Difference]: Start difference. First operand 1352 states and 1962 transitions. Second operand 4 states. [2018-12-09 05:05:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:05,376 INFO L93 Difference]: Finished difference Result 2844 states and 4124 transitions. [2018-12-09 05:05:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:05,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 05:05:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:05,378 INFO L225 Difference]: With dead ends: 2844 [2018-12-09 05:05:05,378 INFO L226 Difference]: Without dead ends: 1517 [2018-12-09 05:05:05,379 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-09 05:05:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-09 05:05:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2018-12-09 05:05:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-09 05:05:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2018-12-09 05:05:05,436 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2018-12-09 05:05:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:05,437 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2018-12-09 05:05:05,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2018-12-09 05:05:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 05:05:05,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:05,438 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:05,438 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:05,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:05,438 INFO L82 PathProgramCache]: Analyzing trace with hash -845450932, now seen corresponding path program 1 times [2018-12-09 05:05:05,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:05,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:05,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:05,471 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-09 05:05:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:05,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:05,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:05,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:05,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:05,472 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2018-12-09 05:05:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:05,709 INFO L93 Difference]: Finished difference Result 2844 states and 4114 transitions. [2018-12-09 05:05:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:05,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 05:05:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:05,711 INFO L225 Difference]: With dead ends: 2844 [2018-12-09 05:05:05,711 INFO L226 Difference]: Without dead ends: 1517 [2018-12-09 05:05:05,712 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-09 05:05:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-09 05:05:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2018-12-09 05:05:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-12-09 05:05:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2018-12-09 05:05:05,763 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2018-12-09 05:05:05,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:05,763 INFO L480 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2018-12-09 05:05:05,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2018-12-09 05:05:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 05:05:05,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:05,764 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:05,764 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:05,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:05,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1221405048, now seen corresponding path program 1 times [2018-12-09 05:05:05,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:05,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:05,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:05,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:05,799 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-09 05:05:05,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:05,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:05,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:05,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:05,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:05,800 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2018-12-09 05:05:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:06,018 INFO L93 Difference]: Finished difference Result 2829 states and 4089 transitions. [2018-12-09 05:05:06,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:06,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 05:05:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:06,020 INFO L225 Difference]: With dead ends: 2829 [2018-12-09 05:05:06,021 INFO L226 Difference]: Without dead ends: 1497 [2018-12-09 05:05:06,022 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-09 05:05:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-09 05:05:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2018-12-09 05:05:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-09 05:05:06,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2018-12-09 05:05:06,073 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2018-12-09 05:05:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:06,073 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2018-12-09 05:05:06,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2018-12-09 05:05:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 05:05:06,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:06,075 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:06,075 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:06,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash 158075786, now seen corresponding path program 1 times [2018-12-09 05:05:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:06,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:06,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:06,114 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-09 05:05:06,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:06,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:06,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:06,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:06,115 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2018-12-09 05:05:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:06,352 INFO L93 Difference]: Finished difference Result 2834 states and 4089 transitions. [2018-12-09 05:05:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:06,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 05:05:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:06,353 INFO L225 Difference]: With dead ends: 2834 [2018-12-09 05:05:06,353 INFO L226 Difference]: Without dead ends: 1497 [2018-12-09 05:05:06,354 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-09 05:05:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-09 05:05:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2018-12-09 05:05:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-12-09 05:05:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2018-12-09 05:05:06,414 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2018-12-09 05:05:06,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:06,414 INFO L480 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2018-12-09 05:05:06,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2018-12-09 05:05:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 05:05:06,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:06,415 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:06,415 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:06,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash -982001362, now seen corresponding path program 1 times [2018-12-09 05:05:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:06,465 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-09 05:05:06,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:06,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:06,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:06,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:06,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:06,466 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2018-12-09 05:05:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:06,701 INFO L93 Difference]: Finished difference Result 2829 states and 4079 transitions. [2018-12-09 05:05:06,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:06,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-09 05:05:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:06,702 INFO L225 Difference]: With dead ends: 2829 [2018-12-09 05:05:06,702 INFO L226 Difference]: Without dead ends: 1487 [2018-12-09 05:05:06,703 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-09 05:05:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-09 05:05:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2018-12-09 05:05:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-09 05:05:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2018-12-09 05:05:06,755 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2018-12-09 05:05:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:06,755 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2018-12-09 05:05:06,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2018-12-09 05:05:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 05:05:06,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:06,756 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] [2018-12-09 05:05:06,756 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:06,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1227853683, now seen corresponding path program 1 times [2018-12-09 05:05:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:06,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:06,796 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-09 05:05:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:06,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:06,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:06,797 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2018-12-09 05:05:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:07,032 INFO L93 Difference]: Finished difference Result 2834 states and 4079 transitions. [2018-12-09 05:05:07,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:07,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-09 05:05:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:07,033 INFO L225 Difference]: With dead ends: 2834 [2018-12-09 05:05:07,034 INFO L226 Difference]: Without dead ends: 1487 [2018-12-09 05:05:07,034 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-09 05:05:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-09 05:05:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2018-12-09 05:05:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-12-09 05:05:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2018-12-09 05:05:07,087 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2018-12-09 05:05:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:07,087 INFO L480 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2018-12-09 05:05:07,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2018-12-09 05:05:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-09 05:05:07,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:07,088 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] [2018-12-09 05:05:07,088 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:07,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1322913775, now seen corresponding path program 1 times [2018-12-09 05:05:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:07,132 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-09 05:05:07,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:07,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:07,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:07,133 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2018-12-09 05:05:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:07,334 INFO L93 Difference]: Finished difference Result 2819 states and 4056 transitions. [2018-12-09 05:05:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:07,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-09 05:05:07,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:07,336 INFO L225 Difference]: With dead ends: 2819 [2018-12-09 05:05:07,336 INFO L226 Difference]: Without dead ends: 1467 [2018-12-09 05:05:07,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-09 05:05:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-12-09 05:05:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2018-12-09 05:05:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-09 05:05:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2018-12-09 05:05:07,389 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2018-12-09 05:05:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:07,389 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2018-12-09 05:05:07,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2018-12-09 05:05:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-09 05:05:07,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:07,390 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:07,390 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:07,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash -976864343, now seen corresponding path program 1 times [2018-12-09 05:05:07,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 05:05:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:07,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:07,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:07,436 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 4 states. [2018-12-09 05:05:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:07,691 INFO L93 Difference]: Finished difference Result 3054 states and 4427 transitions. [2018-12-09 05:05:07,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:07,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-09 05:05:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:07,693 INFO L225 Difference]: With dead ends: 3054 [2018-12-09 05:05:07,693 INFO L226 Difference]: Without dead ends: 1697 [2018-12-09 05:05:07,694 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-09 05:05:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2018-12-09 05:05:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1522. [2018-12-09 05:05:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2018-12-09 05:05:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2232 transitions. [2018-12-09 05:05:07,748 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2232 transitions. Word has length 169 [2018-12-09 05:05:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:07,748 INFO L480 AbstractCegarLoop]: Abstraction has 1522 states and 2232 transitions. [2018-12-09 05:05:07,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2232 transitions. [2018-12-09 05:05:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 05:05:07,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:07,749 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:07,749 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:07,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 397999207, now seen corresponding path program 1 times [2018-12-09 05:05:07,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:07,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:07,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:08,052 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-09 05:05:08,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:05:08,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 05:05:08,053 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-09 05:05:08,054 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], [500], [503], [519], [524], [527], [535], [540], [542], [545], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-12-09 05:05:08,079 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 05:05:08,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 05:05:08,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 05:05:08,548 INFO L272 AbstractInterpreter]: Visited 76 different actions 236 times. Merged at 54 different actions 148 times. Never widened. Performed 1891 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 7 different actions. Largest state had 118 variables. [2018-12-09 05:05:08,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:08,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 05:05:08,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:05:08,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/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-09 05:05:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:08,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 05:05:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:08,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:08,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,690 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-09 05:05:08,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,711 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-09 05:05:08,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,732 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-09 05:05:08,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,761 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-09 05:05:08,763 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-09 05:05:08,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,767 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-09 05:05:08,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,777 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-09 05:05:08,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,790 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,804 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-09 05:05:08,805 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 05:05:08,843 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-09 05:05:08,847 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-09 05:05:08,866 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-09 05:05:08,869 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-09 05:05:08,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-09 05:05:08,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-09 05:05:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-09 05:05:08,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-09 05:05:08,931 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,947 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,967 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:08,974 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 05:05:08,992 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-09 05:05:08,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:08,999 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,004 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-09 05:05:09,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 05:05:09,030 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-09 05:05:09,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,037 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-09 05:05:09,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 05:05:09,062 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-09 05:05:09,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,071 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-09 05:05:09,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,099 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-09 05:05:09,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,107 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-09 05:05:09,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,133 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 05:05:09,142 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-09 05:05:09,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,155 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-09 05:05:09,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 05:05:09,182 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-09 05:05:09,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,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-09 05:05:09,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 05:05:09,218 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-09 05:05:09,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,225 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-09 05:05:09,227 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-09 05:05:09,231 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-09 05:05:09,251 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-09 05:05:09,254 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-09 05:05:09,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,273 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-09 05:05:09,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-09 05:05:09,310 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-09 05:05:09,313 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-09 05:05:09,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 111 [2018-12-09 05:05:09,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 155 [2018-12-09 05:05:09,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 195 [2018-12-09 05:05:09,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,423 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-09 05:05:09,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-09 05:05:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 05:05:09,452 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-09 05:05:09,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,479 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-09 05:05:09,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,488 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-09 05:05:09,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,517 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-09 05:05:09,517 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-09 05:05:09,554 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-09 05:05:09,557 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-09 05:05:09,557 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-09 05:05:09,560 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-09 05:05:09,580 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-09 05:05:09,583 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-09 05:05:09,584 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-09 05:05:09,591 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-09 05:05:09,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,598 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-09 05:05:09,606 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-09 05:05:09,607 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-09 05:05:09,607 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,614 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-09 05:05:09,614 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-09 05:05:09,643 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-09 05:05:09,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,647 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-09 05:05:09,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,659 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-09 05:05:09,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 05:05:09,705 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-09 05:05:09,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:09,709 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-09 05:05:09,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,715 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-09 05:05:09,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:09,719 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-09 05:05:09,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-09 05:05:09,866 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-09 05:05:09,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:05:09,924 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-09 05:05:09,925 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-09 05:05:09,925 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-09 05:05:09,927 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-09 05:05:09,928 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-09 05:05:09,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-09 05:05:09,970 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-09 05:05:09,973 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-09 05:05:09,978 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-09 05:05:09,995 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-09 05:05:09,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:10,002 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-09 05:05:10,003 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-09 05:05:10,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:10,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:10,019 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-09 05:05:10,026 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-09 05:05:10,026 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-09 05:05:10,035 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-09 05:05:10,037 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-09 05:05:10,045 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-09 05:05:10,046 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-09 05:05:10,047 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-09 05:05:10,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-09 05:05:10,053 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-09 05:05:10,055 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 05:05:10,056 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-09 05:05:10,057 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-09 05:05:10,060 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-09 05:05:10,061 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-09 05:05:10,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-09 05:05:10,127 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-09 05:05:10,130 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-09 05:05:10,131 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-09 05:05:10,134 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-09 05:05:10,135 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-09 05:05:10,140 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-09 05:05:10,151 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-09 05:05:10,152 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-09 05:05:14,194 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-09 05:05:14,229 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-09 05:05:14,234 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-09 05:05:14,240 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-09 05:05:14,244 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-09 05:05:14,252 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-09 05:05:14,256 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-09 05:05:14,287 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-09 05:05:14,288 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-09 05:05:14,301 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-09 05:05:14,301 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 05:05:16,396 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-09 05:05:16,399 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-09 05:05:16,456 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-09 05:05:16,465 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-09 05:05:16,475 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-09 05:05:16,481 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-09 05:05:16,491 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-09 05:05:16,499 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-09 05:05:16,537 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-09 05:05:16,538 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-09 05:05:16,558 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-09 05:05:16,562 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-09 05:05:16,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 05:05:16,568 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:144, output treesize:68 [2018-12-09 05:05:18,633 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-09 05:05:18,639 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-09 05:05:18,653 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-09 05:05:18,660 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-09 05:05:18,668 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-09 05:05:18,673 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-09 05:05:18,700 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-09 05:05:18,701 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-09 05:05:18,709 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-09 05:05:18,710 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 05:05:20,996 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-09 05:05:20,997 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-09 05:05:21,017 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-09 05:05:21,020 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-09 05:05:21,025 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-09 05:05:21,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-09 05:05:23,124 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-09 05:05:23,130 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-09 05:05:23,210 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-09 05:05:23,221 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-09 05:05:23,222 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-09 05:05:23,232 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-09 05:05:23,233 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-09 05:05:23,245 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-09 05:05:23,346 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-09 05:05:23,355 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-09 05:05:23,356 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-09 05:05:23,364 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-09 05:05:23,365 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-09 05:05:23,371 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-09 05:05:23,453 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-09 05:05:23,462 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-09 05:05:23,469 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-09 05:05:23,475 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-09 05:05:23,484 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-09 05:05:23,491 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-09 05:05:23,542 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-09 05:05:23,546 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-09 05:05:23,586 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-09 05:05:23,587 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-09 05:05:23,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 05:05:23,612 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:93 [2018-12-09 05:05:23,753 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-09 05:05:23,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 05:05:23,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-12-09 05:05:23,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 05:05:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 05:05:23,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 05:05:23,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2018-12-09 05:05:23,770 INFO L87 Difference]: Start difference. First operand 1522 states and 2232 transitions. Second operand 18 states. [2018-12-09 05:05:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:27,785 INFO L93 Difference]: Finished difference Result 4888 states and 7236 transitions. [2018-12-09 05:05:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 05:05:27,785 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 170 [2018-12-09 05:05:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:27,790 INFO L225 Difference]: With dead ends: 4888 [2018-12-09 05:05:27,790 INFO L226 Difference]: Without dead ends: 3391 [2018-12-09 05:05:27,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 321 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=220, Invalid=1039, Unknown=1, NotChecked=0, Total=1260 [2018-12-09 05:05:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-12-09 05:05:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 1682. [2018-12-09 05:05:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-09 05:05:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2517 transitions. [2018-12-09 05:05:27,897 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2517 transitions. Word has length 170 [2018-12-09 05:05:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:27,897 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2517 transitions. [2018-12-09 05:05:27,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 05:05:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2517 transitions. [2018-12-09 05:05:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 05:05:27,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:27,899 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:27,899 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:27,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1098050897, now seen corresponding path program 1 times [2018-12-09 05:05:27,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:27,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:27,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:27,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:05:27,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:27,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:27,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:27,978 INFO L87 Difference]: Start difference. First operand 1682 states and 2517 transitions. Second operand 4 states. [2018-12-09 05:05:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:28,287 INFO L93 Difference]: Finished difference Result 3424 states and 5116 transitions. [2018-12-09 05:05:28,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:28,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-09 05:05:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:28,290 INFO L225 Difference]: With dead ends: 3424 [2018-12-09 05:05:28,291 INFO L226 Difference]: Without dead ends: 1767 [2018-12-09 05:05:28,293 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-09 05:05:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-12-09 05:05:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1682. [2018-12-09 05:05:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-09 05:05:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2512 transitions. [2018-12-09 05:05:28,387 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2512 transitions. Word has length 171 [2018-12-09 05:05:28,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:28,387 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2512 transitions. [2018-12-09 05:05:28,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2512 transitions. [2018-12-09 05:05:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 05:05:28,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:28,388 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:28,388 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:28,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash -901662024, now seen corresponding path program 1 times [2018-12-09 05:05:28,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:28,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:28,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:05:28,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:28,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:28,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:28,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:28,439 INFO L87 Difference]: Start difference. First operand 1682 states and 2512 transitions. Second operand 4 states. [2018-12-09 05:05:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:28,734 INFO L93 Difference]: Finished difference Result 3404 states and 5079 transitions. [2018-12-09 05:05:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:28,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-09 05:05:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:28,737 INFO L225 Difference]: With dead ends: 3404 [2018-12-09 05:05:28,737 INFO L226 Difference]: Without dead ends: 1747 [2018-12-09 05:05:28,739 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-09 05:05:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2018-12-09 05:05:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1682. [2018-12-09 05:05:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-09 05:05:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2507 transitions. [2018-12-09 05:05:28,816 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2507 transitions. Word has length 172 [2018-12-09 05:05:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:28,817 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2507 transitions. [2018-12-09 05:05:28,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2507 transitions. [2018-12-09 05:05:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 05:05:28,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:28,819 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:28,819 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:28,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:28,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799216, now seen corresponding path program 1 times [2018-12-09 05:05:28,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:28,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:28,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:28,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:28,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:28,873 INFO L87 Difference]: Start difference. First operand 1682 states and 2507 transitions. Second operand 4 states. [2018-12-09 05:05:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:29,321 INFO L93 Difference]: Finished difference Result 3509 states and 5212 transitions. [2018-12-09 05:05:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:29,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-09 05:05:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:29,324 INFO L225 Difference]: With dead ends: 3509 [2018-12-09 05:05:29,324 INFO L226 Difference]: Without dead ends: 1852 [2018-12-09 05:05:29,326 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-09 05:05:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2018-12-09 05:05:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1682. [2018-12-09 05:05:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-09 05:05:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2502 transitions. [2018-12-09 05:05:29,409 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2502 transitions. Word has length 183 [2018-12-09 05:05:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:29,409 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2502 transitions. [2018-12-09 05:05:29,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2502 transitions. [2018-12-09 05:05:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-09 05:05:29,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:29,410 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:29,410 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:29,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -6578482, now seen corresponding path program 1 times [2018-12-09 05:05:29,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:29,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 05:05:29,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:29,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:29,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:29,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:29,475 INFO L87 Difference]: Start difference. First operand 1682 states and 2502 transitions. Second operand 4 states. [2018-12-09 05:05:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:29,861 INFO L93 Difference]: Finished difference Result 3851 states and 5748 transitions. [2018-12-09 05:05:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:29,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-09 05:05:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:29,864 INFO L225 Difference]: With dead ends: 3851 [2018-12-09 05:05:29,864 INFO L226 Difference]: Without dead ends: 2194 [2018-12-09 05:05:29,865 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-09 05:05:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-12-09 05:05:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1877. [2018-12-09 05:05:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-09 05:05:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2857 transitions. [2018-12-09 05:05:29,945 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2857 transitions. Word has length 184 [2018-12-09 05:05:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:29,946 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2857 transitions. [2018-12-09 05:05:29,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2857 transitions. [2018-12-09 05:05:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-09 05:05:29,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:29,947 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-09 05:05:29,947 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:29,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:29,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1206962623, now seen corresponding path program 1 times [2018-12-09 05:05:29,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:29,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:29,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:29,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:30,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:30,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:30,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:30,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:30,015 INFO L87 Difference]: Start difference. First operand 1877 states and 2857 transitions. Second operand 4 states. [2018-12-09 05:05:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:30,310 INFO L93 Difference]: Finished difference Result 3899 states and 5912 transitions. [2018-12-09 05:05:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:30,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-09 05:05:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:30,313 INFO L225 Difference]: With dead ends: 3899 [2018-12-09 05:05:30,313 INFO L226 Difference]: Without dead ends: 2047 [2018-12-09 05:05:30,314 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-09 05:05:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-12-09 05:05:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1877. [2018-12-09 05:05:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-09 05:05:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2852 transitions. [2018-12-09 05:05:30,393 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2852 transitions. Word has length 184 [2018-12-09 05:05:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:30,393 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2852 transitions. [2018-12-09 05:05:30,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2852 transitions. [2018-12-09 05:05:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 05:05:30,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:30,395 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:30,395 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:30,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1095040103, now seen corresponding path program 1 times [2018-12-09 05:05:30,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:30,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:30,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-09 05:05:30,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:30,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:05:30,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:30,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:05:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:05:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:05:30,476 INFO L87 Difference]: Start difference. First operand 1877 states and 2852 transitions. Second operand 5 states. [2018-12-09 05:05:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:30,867 INFO L93 Difference]: Finished difference Result 4476 states and 6848 transitions. [2018-12-09 05:05:30,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:30,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-09 05:05:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:30,870 INFO L225 Difference]: With dead ends: 4476 [2018-12-09 05:05:30,870 INFO L226 Difference]: Without dead ends: 2624 [2018-12-09 05:05:30,872 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-09 05:05:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-12-09 05:05:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1877. [2018-12-09 05:05:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-09 05:05:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2852 transitions. [2018-12-09 05:05:30,956 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2852 transitions. Word has length 185 [2018-12-09 05:05:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:30,956 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2852 transitions. [2018-12-09 05:05:30,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:05:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2852 transitions. [2018-12-09 05:05:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 05:05:30,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:30,959 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:30,959 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:30,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -211267688, now seen corresponding path program 1 times [2018-12-09 05:05:30,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:30,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:30,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-09 05:05:31,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:31,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:31,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:31,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:31,009 INFO L87 Difference]: Start difference. First operand 1877 states and 2852 transitions. Second operand 4 states. [2018-12-09 05:05:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:31,389 INFO L93 Difference]: Finished difference Result 4219 states and 6416 transitions. [2018-12-09 05:05:31,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:31,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-09 05:05:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:31,391 INFO L225 Difference]: With dead ends: 4219 [2018-12-09 05:05:31,391 INFO L226 Difference]: Without dead ends: 2367 [2018-12-09 05:05:31,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:05:31,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2018-12-09 05:05:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2022. [2018-12-09 05:05:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-12-09 05:05:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3112 transitions. [2018-12-09 05:05:31,475 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3112 transitions. Word has length 185 [2018-12-09 05:05:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:31,475 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 3112 transitions. [2018-12-09 05:05:31,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3112 transitions. [2018-12-09 05:05:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 05:05:31,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:31,477 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:31,477 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:31,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1913718796, now seen corresponding path program 1 times [2018-12-09 05:05:31,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:31,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:31,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:31,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:31,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:31,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:31,531 INFO L87 Difference]: Start difference. First operand 2022 states and 3112 transitions. Second operand 4 states. [2018-12-09 05:05:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:31,911 INFO L93 Difference]: Finished difference Result 4189 states and 6422 transitions. [2018-12-09 05:05:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:31,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-09 05:05:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:31,913 INFO L225 Difference]: With dead ends: 4189 [2018-12-09 05:05:31,913 INFO L226 Difference]: Without dead ends: 2192 [2018-12-09 05:05:31,915 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-09 05:05:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-09 05:05:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2022. [2018-12-09 05:05:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-12-09 05:05:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3107 transitions. [2018-12-09 05:05:32,012 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3107 transitions. Word has length 185 [2018-12-09 05:05:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:32,012 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 3107 transitions. [2018-12-09 05:05:32,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3107 transitions. [2018-12-09 05:05:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 05:05:32,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:32,014 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:32,014 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:32,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:32,014 INFO L82 PathProgramCache]: Analyzing trace with hash -420829921, now seen corresponding path program 1 times [2018-12-09 05:05:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:32,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:32,089 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-09 05:05:32,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:32,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:05:32,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:32,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:05:32,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:05:32,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:05:32,090 INFO L87 Difference]: Start difference. First operand 2022 states and 3107 transitions. Second operand 5 states. [2018-12-09 05:05:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:32,484 INFO L93 Difference]: Finished difference Result 4546 states and 6988 transitions. [2018-12-09 05:05:32,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:32,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-09 05:05:32,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:32,486 INFO L225 Difference]: With dead ends: 4546 [2018-12-09 05:05:32,486 INFO L226 Difference]: Without dead ends: 2549 [2018-12-09 05:05:32,488 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-09 05:05:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2018-12-09 05:05:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1967. [2018-12-09 05:05:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3032 transitions. [2018-12-09 05:05:32,574 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3032 transitions. Word has length 186 [2018-12-09 05:05:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:32,574 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3032 transitions. [2018-12-09 05:05:32,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:05:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3032 transitions. [2018-12-09 05:05:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 05:05:32,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:32,576 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:32,576 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:32,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1119703676, now seen corresponding path program 1 times [2018-12-09 05:05:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:32,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:32,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:32,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:32,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:32,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:32,622 INFO L87 Difference]: Start difference. First operand 1967 states and 3032 transitions. Second operand 4 states. [2018-12-09 05:05:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:33,048 INFO L93 Difference]: Finished difference Result 4079 states and 6262 transitions. [2018-12-09 05:05:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:33,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-09 05:05:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:33,050 INFO L225 Difference]: With dead ends: 4079 [2018-12-09 05:05:33,050 INFO L226 Difference]: Without dead ends: 2137 [2018-12-09 05:05:33,052 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-09 05:05:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-09 05:05:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-09 05:05:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3027 transitions. [2018-12-09 05:05:33,137 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3027 transitions. Word has length 186 [2018-12-09 05:05:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:33,137 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3027 transitions. [2018-12-09 05:05:33,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3027 transitions. [2018-12-09 05:05:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-09 05:05:33,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:33,139 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:33,139 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:33,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash -770819865, now seen corresponding path program 1 times [2018-12-09 05:05:33,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:33,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:33,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:33,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:33,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:33,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:33,210 INFO L87 Difference]: Start difference. First operand 1967 states and 3027 transitions. Second operand 4 states. [2018-12-09 05:05:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:33,596 INFO L93 Difference]: Finished difference Result 4029 states and 6192 transitions. [2018-12-09 05:05:33,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:33,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-09 05:05:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:33,598 INFO L225 Difference]: With dead ends: 4029 [2018-12-09 05:05:33,598 INFO L226 Difference]: Without dead ends: 2087 [2018-12-09 05:05:33,600 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-09 05:05:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-09 05:05:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-09 05:05:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3022 transitions. [2018-12-09 05:05:33,686 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3022 transitions. Word has length 187 [2018-12-09 05:05:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:33,686 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3022 transitions. [2018-12-09 05:05:33,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3022 transitions. [2018-12-09 05:05:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 05:05:33,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:33,687 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2018-12-09 05:05:33,688 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:33,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:33,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1815194303, now seen corresponding path program 1 times [2018-12-09 05:05:33,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:33,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:33,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:33,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:33,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:33,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:33,728 INFO L87 Difference]: Start difference. First operand 1967 states and 3022 transitions. Second operand 4 states. [2018-12-09 05:05:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:34,057 INFO L93 Difference]: Finished difference Result 4029 states and 6182 transitions. [2018-12-09 05:05:34,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:34,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-09 05:05:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:34,060 INFO L225 Difference]: With dead ends: 4029 [2018-12-09 05:05:34,060 INFO L226 Difference]: Without dead ends: 2087 [2018-12-09 05:05:34,061 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-09 05:05:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-09 05:05:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-09 05:05:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3017 transitions. [2018-12-09 05:05:34,160 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3017 transitions. Word has length 191 [2018-12-09 05:05:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:34,160 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3017 transitions. [2018-12-09 05:05:34,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3017 transitions. [2018-12-09 05:05:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-09 05:05:34,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:34,162 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:34,162 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:34,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash -306585971, now seen corresponding path program 1 times [2018-12-09 05:05:34,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:34,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:34,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:34,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:34,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:34,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:34,202 INFO L87 Difference]: Start difference. First operand 1967 states and 3017 transitions. Second operand 4 states. [2018-12-09 05:05:34,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:34,484 INFO L93 Difference]: Finished difference Result 4029 states and 6172 transitions. [2018-12-09 05:05:34,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:34,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-09 05:05:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:34,486 INFO L225 Difference]: With dead ends: 4029 [2018-12-09 05:05:34,486 INFO L226 Difference]: Without dead ends: 2087 [2018-12-09 05:05:34,487 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-09 05:05:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-09 05:05:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-09 05:05:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3012 transitions. [2018-12-09 05:05:34,574 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3012 transitions. Word has length 191 [2018-12-09 05:05:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:34,574 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3012 transitions. [2018-12-09 05:05:34,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3012 transitions. [2018-12-09 05:05:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 05:05:34,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:34,576 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:34,576 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:34,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -157594570, now seen corresponding path program 1 times [2018-12-09 05:05:34,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:34,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:34,612 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:34,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:34,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:34,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:34,613 INFO L87 Difference]: Start difference. First operand 1967 states and 3012 transitions. Second operand 4 states. [2018-12-09 05:05:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:34,885 INFO L93 Difference]: Finished difference Result 4009 states and 6135 transitions. [2018-12-09 05:05:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:34,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-12-09 05:05:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:34,887 INFO L225 Difference]: With dead ends: 4009 [2018-12-09 05:05:34,887 INFO L226 Difference]: Without dead ends: 2067 [2018-12-09 05:05:34,889 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-09 05:05:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2018-12-09 05:05:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1967. [2018-12-09 05:05:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3007 transitions. [2018-12-09 05:05:34,977 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3007 transitions. Word has length 192 [2018-12-09 05:05:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:34,977 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3007 transitions. [2018-12-09 05:05:34,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3007 transitions. [2018-12-09 05:05:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 05:05:34,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:34,978 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1] [2018-12-09 05:05:34,978 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:34,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:34,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1272372770, now seen corresponding path program 1 times [2018-12-09 05:05:34,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:34,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:34,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:34,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 05:05:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:35,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:35,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:35,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:35,022 INFO L87 Difference]: Start difference. First operand 1967 states and 3007 transitions. Second operand 4 states. [2018-12-09 05:05:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:35,290 INFO L93 Difference]: Finished difference Result 3984 states and 6093 transitions. [2018-12-09 05:05:35,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:35,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-12-09 05:05:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:35,292 INFO L225 Difference]: With dead ends: 3984 [2018-12-09 05:05:35,292 INFO L226 Difference]: Without dead ends: 2042 [2018-12-09 05:05:35,293 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-09 05:05:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2018-12-09 05:05:35,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1967. [2018-12-09 05:05:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-09 05:05:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3002 transitions. [2018-12-09 05:05:35,381 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3002 transitions. Word has length 192 [2018-12-09 05:05:35,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:35,381 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3002 transitions. [2018-12-09 05:05:35,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3002 transitions. [2018-12-09 05:05:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 05:05:35,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:35,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:35,382 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:35,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 169569154, now seen corresponding path program 1 times [2018-12-09 05:05:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:35,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:35,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-09 05:05:35,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:35,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:35,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:35,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:35,437 INFO L87 Difference]: Start difference. First operand 1967 states and 3002 transitions. Second operand 4 states. [2018-12-09 05:05:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:35,766 INFO L93 Difference]: Finished difference Result 4244 states and 6487 transitions. [2018-12-09 05:05:35,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:35,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-12-09 05:05:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:35,768 INFO L225 Difference]: With dead ends: 4244 [2018-12-09 05:05:35,768 INFO L226 Difference]: Without dead ends: 2302 [2018-12-09 05:05:35,770 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-09 05:05:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-12-09 05:05:35,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2117. [2018-12-09 05:05:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3267 transitions. [2018-12-09 05:05:35,870 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3267 transitions. Word has length 194 [2018-12-09 05:05:35,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:35,870 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3267 transitions. [2018-12-09 05:05:35,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:35,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3267 transitions. [2018-12-09 05:05:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-09 05:05:35,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:35,872 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:35,872 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash 530671035, now seen corresponding path program 1 times [2018-12-09 05:05:35,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:35,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:35,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 05:05:35,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:35,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:35,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:35,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:35,913 INFO L87 Difference]: Start difference. First operand 2117 states and 3267 transitions. Second operand 4 states. [2018-12-09 05:05:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:36,167 INFO L93 Difference]: Finished difference Result 4274 states and 6589 transitions. [2018-12-09 05:05:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:36,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-09 05:05:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:36,169 INFO L225 Difference]: With dead ends: 4274 [2018-12-09 05:05:36,169 INFO L226 Difference]: Without dead ends: 2182 [2018-12-09 05:05:36,170 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-09 05:05:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-09 05:05:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-09 05:05:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3262 transitions. [2018-12-09 05:05:36,263 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3262 transitions. Word has length 195 [2018-12-09 05:05:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:36,263 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3262 transitions. [2018-12-09 05:05:36,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3262 transitions. [2018-12-09 05:05:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 05:05:36,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:36,264 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:36,265 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:36,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash 601945695, now seen corresponding path program 1 times [2018-12-09 05:05:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:36,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 05:05:36,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:36,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:36,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:36,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:36,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:36,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:36,302 INFO L87 Difference]: Start difference. First operand 2117 states and 3262 transitions. Second operand 4 states. [2018-12-09 05:05:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:36,594 INFO L93 Difference]: Finished difference Result 4274 states and 6579 transitions. [2018-12-09 05:05:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:36,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-09 05:05:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:36,596 INFO L225 Difference]: With dead ends: 4274 [2018-12-09 05:05:36,596 INFO L226 Difference]: Without dead ends: 2182 [2018-12-09 05:05:36,598 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-09 05:05:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-09 05:05:36,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-09 05:05:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3257 transitions. [2018-12-09 05:05:36,690 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3257 transitions. Word has length 196 [2018-12-09 05:05:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:36,691 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3257 transitions. [2018-12-09 05:05:36,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3257 transitions. [2018-12-09 05:05:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 05:05:36,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:36,692 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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] [2018-12-09 05:05:36,692 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:36,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:36,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1283046229, now seen corresponding path program 1 times [2018-12-09 05:05:36,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:36,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:36,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:36,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-09 05:05:36,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:36,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:36,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:36,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:36,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:36,736 INFO L87 Difference]: Start difference. First operand 2117 states and 3257 transitions. Second operand 4 states. [2018-12-09 05:05:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:37,050 INFO L93 Difference]: Finished difference Result 4284 states and 6593 transitions. [2018-12-09 05:05:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:37,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-09 05:05:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:37,052 INFO L225 Difference]: With dead ends: 4284 [2018-12-09 05:05:37,052 INFO L226 Difference]: Without dead ends: 2192 [2018-12-09 05:05:37,053 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-09 05:05:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-09 05:05:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2117. [2018-12-09 05:05:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3252 transitions. [2018-12-09 05:05:37,146 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3252 transitions. Word has length 196 [2018-12-09 05:05:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:37,146 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3252 transitions. [2018-12-09 05:05:37,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3252 transitions. [2018-12-09 05:05:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 05:05:37,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:37,148 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:37,148 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:37,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1554757866, now seen corresponding path program 1 times [2018-12-09 05:05:37,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:37,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-09 05:05:37,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:37,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:37,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:37,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:37,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:37,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:37,188 INFO L87 Difference]: Start difference. First operand 2117 states and 3252 transitions. Second operand 4 states. [2018-12-09 05:05:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:37,429 INFO L93 Difference]: Finished difference Result 4259 states and 6542 transitions. [2018-12-09 05:05:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:37,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-09 05:05:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:37,431 INFO L225 Difference]: With dead ends: 4259 [2018-12-09 05:05:37,431 INFO L226 Difference]: Without dead ends: 2167 [2018-12-09 05:05:37,432 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-09 05:05:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-12-09 05:05:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2117. [2018-12-09 05:05:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3247 transitions. [2018-12-09 05:05:37,526 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3247 transitions. Word has length 197 [2018-12-09 05:05:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:37,526 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3247 transitions. [2018-12-09 05:05:37,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3247 transitions. [2018-12-09 05:05:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 05:05:37,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:37,527 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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] [2018-12-09 05:05:37,527 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:37,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash 312564918, now seen corresponding path program 1 times [2018-12-09 05:05:37,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:37,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:37,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:37,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-09 05:05:37,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:37,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 05:05:37,570 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:05:37,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 05:05:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 05:05:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 05:05:37,571 INFO L87 Difference]: Start difference. First operand 2117 states and 3247 transitions. Second operand 4 states. [2018-12-09 05:05:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:37,924 INFO L93 Difference]: Finished difference Result 4274 states and 6563 transitions. [2018-12-09 05:05:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 05:05:37,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-09 05:05:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:37,926 INFO L225 Difference]: With dead ends: 4274 [2018-12-09 05:05:37,927 INFO L226 Difference]: Without dead ends: 2182 [2018-12-09 05:05:37,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-09 05:05:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-09 05:05:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-09 05:05:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-09 05:05:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3242 transitions. [2018-12-09 05:05:38,021 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3242 transitions. Word has length 197 [2018-12-09 05:05:38,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:38,021 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3242 transitions. [2018-12-09 05:05:38,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 05:05:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3242 transitions. [2018-12-09 05:05:38,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 05:05:38,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:38,022 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:05:38,022 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:38,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1533851099, now seen corresponding path program 1 times [2018-12-09 05:05:38,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:05:38,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:38,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:38,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:05:38,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:05:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:05:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:05:38,165 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:05:38,206 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-09 05:05:38,206 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 05:05:38,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:05:38 BoogieIcfgContainer [2018-12-09 05:05:38,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:05:38,256 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:05:38,256 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:05:38,256 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:05:38,257 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:04:48" (3/4) ... [2018-12-09 05:05:38,259 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 05:05:38,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:05:38,260 INFO L168 Benchmark]: Toolchain (without parser) took 50694.30 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 886.6 MB). Free memory was 947.0 MB in the beginning and 1.6 GB in the end (delta: -616.6 MB). Peak memory consumption was 269.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:38,260 INFO L168 Benchmark]: CDTParser took 0.16 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-09 05:05:38,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:38,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:05:38,261 INFO L168 Benchmark]: Boogie Preprocessor took 51.88 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: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:38,261 INFO L168 Benchmark]: RCFGBuilder took 627.52 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: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:38,261 INFO L168 Benchmark]: TraceAbstraction took 49616.87 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 752.9 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -549.4 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:38,261 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:05:38,262 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 35.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.88 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: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 627.52 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: 88.5 MB). Peak memory consumption was 88.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49616.87 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 752.9 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -549.4 MB). Peak memory consumption was 203.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.9 GB. Free memory is still 1.6 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 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1727]: 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))={24595:0}, malloc(sizeof(SSL_CTX))={24611:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24614:0}, s={24595:0}, SSLv3_server_data={24589:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614: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] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614: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] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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={24595:0}, s={24595: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 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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] [L1599] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614: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] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595: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 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->s3={24614: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] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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 [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->s3={24614: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] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595: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 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24595:0}, s={24595: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] [L1727] __VERIFIER_error() VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24595:0}, s={24595: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, 159 locations, 1 error locations. UNSAFE Result, 49.5s OverallTime, 89 OverallIterations, 8 TraceHistogramMax, 25.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20482 SDtfs, 6698 SDslu, 31051 SDs, 0 SdLazy, 20680 SolverSat, 988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 495 SyntacticMatches, 132 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2117occurred in iteration=83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 88 MinimizatonAttempts, 12296 StatesRemovedByMinimization, 87 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 11609 NumberOfCodeBlocks, 11609 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 11490 ConstructedInterpolants, 161 QuantifiedInterpolants, 6877494 SizeOfPredicates, 17 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 90 InterpolantComputations, 87 PerfectInterpolantSequences, 12757/13215 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-09 05:05:39,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:05:39,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:05:39,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:05:39,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:05:39,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:05:39,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:05:39,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:05:39,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:05:39,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:05:39,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:05:39,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:05:39,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:05:39,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:05:39,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:05:39,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:05:39,669 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:05:39,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:05:39,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:05:39,672 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:05:39,673 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:05:39,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:05:39,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:05:39,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:05:39,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:05:39,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:05:39,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:05:39,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:05:39,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:05:39,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:05:39,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:05:39,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:05:39,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:05:39,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:05:39,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:05:39,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:05:39,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 05:05:39,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:05:39,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:05:39,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:05:39,688 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:05:39,688 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:05:39,688 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:05:39,689 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:05:39,689 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:05:39,689 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:05:39,689 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:05:39,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:05:39,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:05:39,691 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:05:39,692 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:05:39,692 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:05:39,692 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:05:39,692 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:05:39,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:05:39,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 05:05:39,693 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 05:05:39,693 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_964a7122-90cc-4671-b104-3ff93d001893/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 -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-12-09 05:05:39,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:05:39,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:05:39,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:05:39,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:05:39,727 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:05:39,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-09 05:05:39,771 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/578a3c15b/7bdfed11c7fb4d999a87efc2e5461aa2/FLAG3e876cec0 [2018-12-09 05:05:40,242 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:05:40,243 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-09 05:05:40,253 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/578a3c15b/7bdfed11c7fb4d999a87efc2e5461aa2/FLAG3e876cec0 [2018-12-09 05:05:40,261 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_964a7122-90cc-4671-b104-3ff93d001893/bin-2019/utaipan/data/578a3c15b/7bdfed11c7fb4d999a87efc2e5461aa2 [2018-12-09 05:05:40,263 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:05:40,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:05:40,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:05:40,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:05:40,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:05:40,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:40" (1/1) ... [2018-12-09 05:05:40,268 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 09.12 05:05:40, skipping insertion in model container [2018-12-09 05:05:40,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:40" (1/1) ... [2018-12-09 05:05:40,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:05:40,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:05:40,533 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:05:40,545 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:05:40,642 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:05:40,643 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-09 05:05:40,645 INFO L168 Benchmark]: Toolchain (without parser) took 382.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:40,647 INFO L168 Benchmark]: CDTParser took 0.12 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-09 05:05:40,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:40,648 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 40.8 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...