./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26d2d88b107593355990b3892c0d3e9a5490a1a3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26d2d88b107593355990b3892c0d3e9a5490a1a3 .............................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 07:16:35,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:16:35,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:16:35,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:16:35,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:16:35,811 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:16:35,812 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:16:35,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:16:35,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:16:35,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:16:35,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:16:35,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:16:35,816 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:16:35,817 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:16:35,818 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:16:35,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:16:35,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:16:35,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:16:35,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:16:35,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:16:35,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:16:35,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:16:35,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:16:35,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:16:35,826 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:16:35,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:16:35,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:16:35,827 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:16:35,828 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:16:35,829 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:16:35,829 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:16:35,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:16:35,830 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:16:35,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:16:35,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:16:35,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:16:35,831 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 07:16:35,841 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:16:35,841 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:16:35,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:16:35,841 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:16:35,841 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:16:35,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:16:35,841 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:16:35,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:16:35,842 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:16:35,843 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:16:35,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:16:35,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:16:35,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 07:16:35,845 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 07:16:35,845 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_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-12-09 07:16:35,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:16:35,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:16:35,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:16:35,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:16:35,880 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:16:35,880 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-09 07:16:35,916 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/cef3d7287/a26e2b1651e24d6e83eb755732129f40/FLAG7ffa833ba [2018-12-09 07:16:36,453 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:16:36,454 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-09 07:16:36,466 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/cef3d7287/a26e2b1651e24d6e83eb755732129f40/FLAG7ffa833ba [2018-12-09 07:16:36,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/cef3d7287/a26e2b1651e24d6e83eb755732129f40 [2018-12-09 07:16:36,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:16:36,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:16:36,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:16:36,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:16:36,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:16:36,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:16:36" (1/1) ... [2018-12-09 07:16:36,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@861fafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:36, skipping insertion in model container [2018-12-09 07:16:36,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:16:36" (1/1) ... [2018-12-09 07:16:36,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:16:37,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:16:37,264 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:16:37,272 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:16:37,326 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:16:37,337 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:16:37,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37 WrapperNode [2018-12-09 07:16:37,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:16:37,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:16:37,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:16:37,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:16:37,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:16:37,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:16:37,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:16:37,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:16:37,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... [2018-12-09 07:16:37,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:16:37,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:16:37,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:16:37,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:16:37,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/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 07:16:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 07:16:37,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 07:16:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-09 07:16:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 07:16:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 07:16:37,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:16:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:16:37,595 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 07:16:37,595 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 07:16:37,958 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:16:37,958 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 07:16:37,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:16:37 BoogieIcfgContainer [2018-12-09 07:16:37,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:16:37,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 07:16:37,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 07:16:37,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 07:16:37,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:16:36" (1/3) ... [2018-12-09 07:16:37,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef17682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:16:37, skipping insertion in model container [2018-12-09 07:16:37,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:16:37" (2/3) ... [2018-12-09 07:16:37,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef17682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:16:37, skipping insertion in model container [2018-12-09 07:16:37,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:16:37" (3/3) ... [2018-12-09 07:16:37,964 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-09 07:16:37,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 07:16:37,975 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 07:16:37,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 07:16:38,003 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 07:16:38,003 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 07:16:38,003 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 07:16:38,003 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:16:38,003 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:16:38,003 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 07:16:38,003 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:16:38,003 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 07:16:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-09 07:16:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 07:16:38,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:38,019 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 07:16:38,020 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:38,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:38,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1546919168, now seen corresponding path program 1 times [2018-12-09 07:16:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:38,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:38,205 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 07:16:38,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:38,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:38,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:38,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:38,219 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-09 07:16:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:38,479 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-09 07:16:38,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:38,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-09 07:16:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:38,488 INFO L225 Difference]: With dead ends: 333 [2018-12-09 07:16:38,489 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 07:16:38,491 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 07:16:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 07:16:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 07:16:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 07:16:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-09 07:16:38,525 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-09 07:16:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:38,525 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-09 07:16:38,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-09 07:16:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 07:16:38,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:38,526 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 07:16:38,526 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:38,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1039083406, now seen corresponding path program 1 times [2018-12-09 07:16:38,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:38,606 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 07:16:38,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:38,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:38,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:38,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:38,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:38,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:38,608 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-09 07:16:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:38,788 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-09 07:16:38,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:38,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 07:16:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:38,790 INFO L225 Difference]: With dead ends: 296 [2018-12-09 07:16:38,790 INFO L226 Difference]: Without dead ends: 169 [2018-12-09 07:16:38,791 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 07:16:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-09 07:16:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-09 07:16:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-09 07:16:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-09 07:16:38,800 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-09 07:16:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:38,801 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-09 07:16:38,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-09 07:16:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 07:16:38,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:38,802 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 07:16:38,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:38,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash -7342962, now seen corresponding path program 1 times [2018-12-09 07:16:38,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:38,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:38,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:38,875 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 07:16:38,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:38,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:16:38,876 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:38,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:16:38,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:16:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:16:38,877 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-09 07:16:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:39,134 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-09 07:16:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:16:39,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-09 07:16:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:39,135 INFO L225 Difference]: With dead ends: 300 [2018-12-09 07:16:39,136 INFO L226 Difference]: Without dead ends: 173 [2018-12-09 07:16:39,136 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 07:16:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-09 07:16:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-09 07:16:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 07:16:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-09 07:16:39,144 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-09 07:16:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:39,144 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-09 07:16:39,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:16:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-09 07:16:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 07:16:39,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:39,145 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 07:16:39,145 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:39,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:39,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1814299397, now seen corresponding path program 1 times [2018-12-09 07:16:39,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:39,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:39,216 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 07:16:39,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:39,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:39,217 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:39,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:39,218 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-09 07:16:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:39,361 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-09 07:16:39,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:39,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 07:16:39,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:39,362 INFO L225 Difference]: With dead ends: 333 [2018-12-09 07:16:39,362 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 07:16:39,363 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 07:16:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 07:16:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-09 07:16:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 07:16:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-09 07:16:39,371 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-09 07:16:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:39,372 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-09 07:16:39,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-09 07:16:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 07:16:39,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:39,373 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 07:16:39,373 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:39,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 170767942, now seen corresponding path program 1 times [2018-12-09 07:16:39,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:39,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:39,417 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 07:16:39,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:39,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:39,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:39,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:39,418 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-09 07:16:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:39,579 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-09 07:16:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:39,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 07:16:39,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:39,580 INFO L225 Difference]: With dead ends: 332 [2018-12-09 07:16:39,580 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 07:16:39,581 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 07:16:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 07:16:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 07:16:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 07:16:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-09 07:16:39,588 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-09 07:16:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:39,588 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-09 07:16:39,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-09 07:16:39,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 07:16:39,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:39,589 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 07:16:39,589 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:39,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1692923025, now seen corresponding path program 1 times [2018-12-09 07:16:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:39,642 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 07:16:39,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:39,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:39,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:39,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:39,643 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-09 07:16:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:39,781 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-09 07:16:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:39,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 07:16:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:39,782 INFO L225 Difference]: With dead ends: 332 [2018-12-09 07:16:39,782 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 07:16:39,782 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 07:16:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 07:16:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 07:16:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 07:16:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-09 07:16:39,787 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-09 07:16:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-09 07:16:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-09 07:16:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 07:16:39,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:39,788 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 07:16:39,788 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:39,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:39,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1847214462, now seen corresponding path program 1 times [2018-12-09 07:16:39,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:39,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:39,831 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 07:16:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:39,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:39,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:39,833 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-09 07:16:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:39,984 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-09 07:16:39,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:39,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 07:16:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:39,985 INFO L225 Difference]: With dead ends: 332 [2018-12-09 07:16:39,985 INFO L226 Difference]: Without dead ends: 185 [2018-12-09 07:16:39,986 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 07:16:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-09 07:16:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-09 07:16:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 07:16:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-09 07:16:39,989 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-09 07:16:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:39,989 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-09 07:16:39,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-09 07:16:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 07:16:39,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:39,990 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 07:16:39,990 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:39,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:39,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1649145975, now seen corresponding path program 1 times [2018-12-09 07:16:39,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:39,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:39,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,022 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 07:16:40,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,022 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,023 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-09 07:16:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:40,162 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-09 07:16:40,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:40,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 07:16:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:40,163 INFO L225 Difference]: With dead ends: 361 [2018-12-09 07:16:40,163 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 07:16:40,163 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 07:16:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 07:16:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 07:16:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-09 07:16:40,167 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-09 07:16:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:40,167 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-09 07:16:40,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-09 07:16:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 07:16:40,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:40,168 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 07:16:40,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:40,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 677650986, now seen corresponding path program 1 times [2018-12-09 07:16:40,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,198 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 07:16:40,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,199 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-09 07:16:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:40,331 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-09 07:16:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:40,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 07:16:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:40,333 INFO L225 Difference]: With dead ends: 376 [2018-12-09 07:16:40,333 INFO L226 Difference]: Without dead ends: 207 [2018-12-09 07:16:40,333 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 07:16:40,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-09 07:16:40,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-09 07:16:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-09 07:16:40,337 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-09 07:16:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:40,338 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-09 07:16:40,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-09 07:16:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 07:16:40,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:40,338 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 07:16:40,338 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:40,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 357033949, now seen corresponding path program 1 times [2018-12-09 07:16:40,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,371 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 07:16:40,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,372 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-09 07:16:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:40,507 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-09 07:16:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:40,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-09 07:16:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:40,508 INFO L225 Difference]: With dead ends: 366 [2018-12-09 07:16:40,508 INFO L226 Difference]: Without dead ends: 197 [2018-12-09 07:16:40,509 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 07:16:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-09 07:16:40,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-09 07:16:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-09 07:16:40,513 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-09 07:16:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:40,513 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-09 07:16:40,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-09 07:16:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 07:16:40,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:40,514 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 07:16:40,514 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:40,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:40,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1058138999, now seen corresponding path program 1 times [2018-12-09 07:16:40,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:40,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,554 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 07:16:40,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,555 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-09 07:16:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:40,722 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-09 07:16:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:40,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-09 07:16:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:40,724 INFO L225 Difference]: With dead ends: 383 [2018-12-09 07:16:40,724 INFO L226 Difference]: Without dead ends: 214 [2018-12-09 07:16:40,724 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 07:16:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-09 07:16:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-09 07:16:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-09 07:16:40,729 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-09 07:16:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:40,730 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-09 07:16:40,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-09 07:16:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 07:16:40,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:40,731 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 07:16:40,731 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:40,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1223576014, now seen corresponding path program 1 times [2018-12-09 07:16:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,788 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 07:16:40,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,790 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-09 07:16:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:40,952 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-09 07:16:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:40,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 07:16:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:40,953 INFO L225 Difference]: With dead ends: 381 [2018-12-09 07:16:40,953 INFO L226 Difference]: Without dead ends: 212 [2018-12-09 07:16:40,954 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 07:16:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-09 07:16:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-09 07:16:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-09 07:16:40,957 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-09 07:16:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:40,957 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-09 07:16:40,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-09 07:16:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 07:16:40,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:40,958 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 07:16:40,958 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:40,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash -419955441, now seen corresponding path program 1 times [2018-12-09 07:16:40,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:40,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:40,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:40,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:40,985 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 07:16:40,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:40,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:40,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:40,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:40,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:40,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:40,986 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-09 07:16:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:41,157 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-09 07:16:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:41,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 07:16:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:41,158 INFO L225 Difference]: With dead ends: 380 [2018-12-09 07:16:41,158 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 07:16:41,158 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 07:16:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 07:16:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 07:16:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-09 07:16:41,165 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-09 07:16:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:41,165 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-09 07:16:41,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:41,165 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-09 07:16:41,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 07:16:41,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:41,166 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 07:16:41,166 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:41,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:41,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1469488582, now seen corresponding path program 1 times [2018-12-09 07:16:41,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:41,213 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 07:16:41,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:41,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:41,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:41,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:41,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:41,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:41,214 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-09 07:16:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:41,392 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-09 07:16:41,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:41,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-09 07:16:41,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:41,393 INFO L225 Difference]: With dead ends: 380 [2018-12-09 07:16:41,393 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 07:16:41,393 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 07:16:41,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 07:16:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 07:16:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-09 07:16:41,397 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-09 07:16:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:41,397 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-09 07:16:41,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-09 07:16:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 07:16:41,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:41,398 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 07:16:41,398 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:41,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1698264843, now seen corresponding path program 1 times [2018-12-09 07:16:41,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:41,437 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 07:16:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:41,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:41,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:41,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:41,438 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-09 07:16:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:41,602 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-09 07:16:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:41,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 07:16:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:41,603 INFO L225 Difference]: With dead ends: 380 [2018-12-09 07:16:41,603 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 07:16:41,603 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 07:16:41,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 07:16:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 07:16:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-09 07:16:41,607 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-09 07:16:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:41,607 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-09 07:16:41,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-09 07:16:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 07:16:41,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:41,608 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 07:16:41,608 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:41,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1081640255, now seen corresponding path program 1 times [2018-12-09 07:16:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:41,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:41,635 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 07:16:41,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:41,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:41,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:41,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:41,636 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-09 07:16:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:41,790 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-09 07:16:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:41,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-09 07:16:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:41,791 INFO L225 Difference]: With dead ends: 380 [2018-12-09 07:16:41,791 INFO L226 Difference]: Without dead ends: 211 [2018-12-09 07:16:41,791 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 07:16:41,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-09 07:16:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-09 07:16:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-09 07:16:41,798 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-09 07:16:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:41,798 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-09 07:16:41,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-09 07:16:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 07:16:41,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:41,799 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 07:16:41,799 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:41,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1653580326, now seen corresponding path program 1 times [2018-12-09 07:16:41,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:41,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:41,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:41,843 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 07:16:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:41,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:41,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:41,844 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-09 07:16:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:42,003 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-09 07:16:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:42,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-09 07:16:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:42,004 INFO L225 Difference]: With dead ends: 370 [2018-12-09 07:16:42,004 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 07:16:42,004 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 07:16:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 07:16:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-09 07:16:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 07:16:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-09 07:16:42,008 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-09 07:16:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:42,008 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-09 07:16:42,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-09 07:16:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 07:16:42,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:42,009 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 07:16:42,009 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:42,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash -586078850, now seen corresponding path program 1 times [2018-12-09 07:16:42,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:42,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:42,050 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 07:16:42,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:42,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:42,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:42,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:42,051 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-09 07:16:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:42,280 INFO L93 Difference]: Finished difference Result 467 states and 692 transitions. [2018-12-09 07:16:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:42,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 07:16:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:42,281 INFO L225 Difference]: With dead ends: 467 [2018-12-09 07:16:42,281 INFO L226 Difference]: Without dead ends: 298 [2018-12-09 07:16:42,281 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 07:16:42,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-09 07:16:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 224. [2018-12-09 07:16:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-09 07:16:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-09 07:16:42,286 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-09 07:16:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:42,286 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-09 07:16:42,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-09 07:16:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 07:16:42,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:42,286 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 07:16:42,287 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:42,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -658465408, now seen corresponding path program 1 times [2018-12-09 07:16:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:42,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:42,325 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 07:16:42,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:42,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:42,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:42,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:42,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:42,326 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-09 07:16:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:42,507 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-09 07:16:42,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:42,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 07:16:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:42,508 INFO L225 Difference]: With dead ends: 472 [2018-12-09 07:16:42,508 INFO L226 Difference]: Without dead ends: 273 [2018-12-09 07:16:42,509 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 07:16:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-09 07:16:42,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-09 07:16:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-09 07:16:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-09 07:16:42,515 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-09 07:16:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:42,515 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-09 07:16:42,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-09 07:16:42,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 07:16:42,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:42,515 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 07:16:42,516 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:42,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash -407391601, now seen corresponding path program 1 times [2018-12-09 07:16:42,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:42,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:42,574 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 07:16:42,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:42,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:42,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:42,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:42,575 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-09 07:16:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:42,793 INFO L93 Difference]: Finished difference Result 537 states and 811 transitions. [2018-12-09 07:16:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:42,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 07:16:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:42,794 INFO L225 Difference]: With dead ends: 537 [2018-12-09 07:16:42,794 INFO L226 Difference]: Without dead ends: 314 [2018-12-09 07:16:42,795 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 07:16:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-09 07:16:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 249. [2018-12-09 07:16:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 07:16:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-09 07:16:42,803 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-09 07:16:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:42,803 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-09 07:16:42,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-09 07:16:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 07:16:42,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:42,804 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 07:16:42,804 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:42,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 454550748, now seen corresponding path program 1 times [2018-12-09 07:16:42,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:42,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:42,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:42,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:42,851 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 07:16:42,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:42,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:42,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:42,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:42,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:42,851 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-09 07:16:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:43,080 INFO L93 Difference]: Finished difference Result 538 states and 811 transitions. [2018-12-09 07:16:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:43,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-09 07:16:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:43,081 INFO L225 Difference]: With dead ends: 538 [2018-12-09 07:16:43,081 INFO L226 Difference]: Without dead ends: 314 [2018-12-09 07:16:43,082 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 07:16:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-09 07:16:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 259. [2018-12-09 07:16:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-09 07:16:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-09 07:16:43,087 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2018-12-09 07:16:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:43,087 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-09 07:16:43,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-09 07:16:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 07:16:43,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:43,088 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 07:16:43,088 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:43,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1199163944, now seen corresponding path program 1 times [2018-12-09 07:16:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:43,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:43,121 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 07:16:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:43,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:43,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:43,122 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-09 07:16:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:43,314 INFO L93 Difference]: Finished difference Result 542 states and 822 transitions. [2018-12-09 07:16:43,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:43,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-09 07:16:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:43,315 INFO L225 Difference]: With dead ends: 542 [2018-12-09 07:16:43,315 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 07:16:43,315 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 07:16:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 07:16:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-09 07:16:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-09 07:16:43,321 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2018-12-09 07:16:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:43,321 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-09 07:16:43,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-09 07:16:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 07:16:43,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:43,321 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 07:16:43,322 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:43,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:43,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1774849204, now seen corresponding path program 1 times [2018-12-09 07:16:43,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:43,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:43,353 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 07:16:43,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:43,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:43,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:43,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:43,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:43,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:43,354 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-09 07:16:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:43,609 INFO L93 Difference]: Finished difference Result 543 states and 822 transitions. [2018-12-09 07:16:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:43,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 07:16:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:43,610 INFO L225 Difference]: With dead ends: 543 [2018-12-09 07:16:43,610 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 07:16:43,611 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 07:16:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 07:16:43,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-09 07:16:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-09 07:16:43,620 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-09 07:16:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:43,620 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-09 07:16:43,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-09 07:16:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 07:16:43,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:43,621 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 07:16:43,621 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:43,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -591845390, now seen corresponding path program 1 times [2018-12-09 07:16:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:43,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:43,669 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 07:16:43,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:43,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:43,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:43,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:43,670 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-09 07:16:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:43,850 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-09 07:16:43,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:43,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-09 07:16:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:43,851 INFO L225 Difference]: With dead ends: 520 [2018-12-09 07:16:43,851 INFO L226 Difference]: Without dead ends: 285 [2018-12-09 07:16:43,852 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 07:16:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-09 07:16:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-09 07:16:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-09 07:16:43,858 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-09 07:16:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:43,858 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-09 07:16:43,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-09 07:16:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 07:16:43,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:43,859 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 07:16:43,859 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:43,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1148102909, now seen corresponding path program 1 times [2018-12-09 07:16:43,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:43,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:43,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:43,894 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 07:16:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:43,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:43,894 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:43,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:43,895 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-09 07:16:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:44,100 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2018-12-09 07:16:44,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:44,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 07:16:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:44,102 INFO L225 Difference]: With dead ends: 541 [2018-12-09 07:16:44,102 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 07:16:44,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:16:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 07:16:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 260. [2018-12-09 07:16:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-09 07:16:44,109 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-09 07:16:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:44,109 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-09 07:16:44,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-09 07:16:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 07:16:44,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:44,111 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 07:16:44,111 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:44,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1503332932, now seen corresponding path program 1 times [2018-12-09 07:16:44,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:44,154 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 07:16:44,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:44,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:44,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:44,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:44,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:44,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:44,155 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-09 07:16:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:44,372 INFO L93 Difference]: Finished difference Result 540 states and 813 transitions. [2018-12-09 07:16:44,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:44,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 07:16:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:44,373 INFO L225 Difference]: With dead ends: 540 [2018-12-09 07:16:44,373 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 07:16:44,374 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 07:16:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 07:16:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 07:16:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-09 07:16:44,379 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-09 07:16:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:44,380 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-09 07:16:44,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-09 07:16:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 07:16:44,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:44,380 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 07:16:44,380 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:44,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:44,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1501191291, now seen corresponding path program 1 times [2018-12-09 07:16:44,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:44,414 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 07:16:44,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:44,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:44,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:44,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:44,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:44,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:44,414 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-09 07:16:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:44,588 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-09 07:16:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:44,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 07:16:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:44,589 INFO L225 Difference]: With dead ends: 518 [2018-12-09 07:16:44,589 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 07:16:44,589 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 07:16:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 07:16:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-09 07:16:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-09 07:16:44,595 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-09 07:16:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:44,595 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-09 07:16:44,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-09 07:16:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 07:16:44,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:44,595 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 07:16:44,596 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1150244550, now seen corresponding path program 1 times [2018-12-09 07:16:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:44,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:44,627 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 07:16:44,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:44,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:44,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:44,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:44,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:44,627 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-09 07:16:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:44,781 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-09 07:16:44,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:44,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-09 07:16:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:44,782 INFO L225 Difference]: With dead ends: 517 [2018-12-09 07:16:44,782 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 07:16:44,782 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 07:16:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 07:16:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 07:16:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-09 07:16:44,788 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-09 07:16:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:44,788 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-09 07:16:44,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-09 07:16:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 07:16:44,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:44,789 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 07:16:44,789 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:44,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash 961886001, now seen corresponding path program 1 times [2018-12-09 07:16:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:44,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:44,816 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 07:16:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:44,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:44,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:44,817 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-09 07:16:45,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:45,009 INFO L93 Difference]: Finished difference Result 540 states and 807 transitions. [2018-12-09 07:16:45,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:45,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 07:16:45,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:45,010 INFO L225 Difference]: With dead ends: 540 [2018-12-09 07:16:45,010 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 07:16:45,011 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 07:16:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 07:16:45,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 07:16:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:45,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-09 07:16:45,021 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-09 07:16:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:45,021 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-09 07:16:45,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-09 07:16:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 07:16:45,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:45,022 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 07:16:45,022 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:45,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:45,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1393919249, now seen corresponding path program 1 times [2018-12-09 07:16:45,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:45,056 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 07:16:45,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:45,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:45,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:45,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:45,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:45,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:45,057 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-09 07:16:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:45,202 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-09 07:16:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:45,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-09 07:16:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:45,203 INFO L225 Difference]: With dead ends: 517 [2018-12-09 07:16:45,203 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 07:16:45,204 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 07:16:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 07:16:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 07:16:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-09 07:16:45,210 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-09 07:16:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:45,210 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-09 07:16:45,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-09 07:16:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 07:16:45,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:45,211 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 07:16:45,211 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:45,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:45,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1152513280, now seen corresponding path program 1 times [2018-12-09 07:16:45,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:45,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:45,252 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 07:16:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:45,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:45,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:45,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:45,253 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-09 07:16:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:45,451 INFO L93 Difference]: Finished difference Result 540 states and 803 transitions. [2018-12-09 07:16:45,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:45,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 07:16:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:45,453 INFO L225 Difference]: With dead ends: 540 [2018-12-09 07:16:45,453 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 07:16:45,454 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 07:16:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 07:16:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 07:16:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-09 07:16:45,464 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-09 07:16:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:45,464 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-09 07:16:45,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-09 07:16:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 07:16:45,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:45,465 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 07:16:45,465 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:45,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1168031998, now seen corresponding path program 1 times [2018-12-09 07:16:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:45,507 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 07:16:45,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:45,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:45,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:45,508 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-09 07:16:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:45,664 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-09 07:16:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:45,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-09 07:16:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:45,665 INFO L225 Difference]: With dead ends: 517 [2018-12-09 07:16:45,665 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 07:16:45,666 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 07:16:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 07:16:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 07:16:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-09 07:16:45,673 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-09 07:16:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:45,673 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-09 07:16:45,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-09 07:16:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:16:45,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:45,674 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 07:16:45,674 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:45,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 738551148, now seen corresponding path program 1 times [2018-12-09 07:16:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:45,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:45,706 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 07:16:45,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:45,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:45,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:45,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:45,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:45,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:45,707 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-09 07:16:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:45,897 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2018-12-09 07:16:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:45,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 07:16:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:45,899 INFO L225 Difference]: With dead ends: 540 [2018-12-09 07:16:45,899 INFO L226 Difference]: Without dead ends: 305 [2018-12-09 07:16:45,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:16:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-09 07:16:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-09 07:16:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-09 07:16:45,907 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-09 07:16:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:45,908 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-09 07:16:45,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-09 07:16:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 07:16:45,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:45,909 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 07:16:45,909 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:45,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:45,909 INFO L82 PathProgramCache]: Analyzing trace with hash 257470890, now seen corresponding path program 1 times [2018-12-09 07:16:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:45,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:45,955 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 07:16:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:45,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:45,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:45,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:45,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:45,957 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-09 07:16:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,142 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-09 07:16:46,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:46,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-09 07:16:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,143 INFO L225 Difference]: With dead ends: 517 [2018-12-09 07:16:46,143 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 07:16:46,143 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 07:16:46,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 07:16:46,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-09 07:16:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-09 07:16:46,150 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-09 07:16:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,151 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-09 07:16:46,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-09 07:16:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 07:16:46,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,151 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 07:16:46,152 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2050028325, now seen corresponding path program 1 times [2018-12-09 07:16:46,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:46,181 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 07:16:46,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:46,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:46,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:46,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:46,182 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-09 07:16:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,359 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2018-12-09 07:16:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:46,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 07:16:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,360 INFO L225 Difference]: With dead ends: 530 [2018-12-09 07:16:46,360 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 07:16:46,360 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 07:16:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 07:16:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-09 07:16:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-09 07:16:46,367 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-09 07:16:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,367 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-09 07:16:46,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-09 07:16:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 07:16:46,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,367 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 07:16:46,368 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,368 INFO L82 PathProgramCache]: Analyzing trace with hash 216352861, now seen corresponding path program 1 times [2018-12-09 07:16:46,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:46,399 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 07:16:46,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:46,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:46,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:46,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:46,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:46,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:46,400 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-09 07:16:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,541 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-09 07:16:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:46,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 07:16:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,542 INFO L225 Difference]: With dead ends: 507 [2018-12-09 07:16:46,542 INFO L226 Difference]: Without dead ends: 272 [2018-12-09 07:16:46,543 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 07:16:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-09 07:16:46,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-09 07:16:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-09 07:16:46,549 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-09 07:16:46,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,549 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-09 07:16:46,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-09 07:16:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:16:46,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,550 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 07:16:46,550 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1019220863, now seen corresponding path program 1 times [2018-12-09 07:16:46,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:46,592 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 07:16:46,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:46,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:46,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:46,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:46,593 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-09 07:16:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,775 INFO L93 Difference]: Finished difference Result 530 states and 779 transitions. [2018-12-09 07:16:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:46,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-09 07:16:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,776 INFO L225 Difference]: With dead ends: 530 [2018-12-09 07:16:46,777 INFO L226 Difference]: Without dead ends: 295 [2018-12-09 07:16:46,777 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 07:16:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-09 07:16:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-09 07:16:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-09 07:16:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-09 07:16:46,788 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-09 07:16:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,788 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-09 07:16:46,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-09 07:16:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:16:46,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,789 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 07:16:46,789 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash 367564547, now seen corresponding path program 1 times [2018-12-09 07:16:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:46,822 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 07:16:46,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:46,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:16:46,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:46,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:16:46,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:16:46,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:16:46,823 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-09 07:16:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,872 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-09 07:16:46,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:16:46,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-09 07:16:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,873 INFO L225 Difference]: With dead ends: 728 [2018-12-09 07:16:46,873 INFO L226 Difference]: Without dead ends: 493 [2018-12-09 07:16:46,874 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 07:16:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-09 07:16:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-09 07:16:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-09 07:16:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-09 07:16:46,896 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-09 07:16:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,896 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-09 07:16:46,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:16:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-09 07:16:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 07:16:46,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,897 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 07:16:46,898 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1725725933, now seen corresponding path program 1 times [2018-12-09 07:16:46,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:46,924 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 07:16:46,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:46,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:16:46,924 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:46,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:16:46,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:16:46,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:16:46,925 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-09 07:16:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:46,967 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-09 07:16:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:16:46,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 07:16:46,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:46,969 INFO L225 Difference]: With dead ends: 1196 [2018-12-09 07:16:46,969 INFO L226 Difference]: Without dead ends: 728 [2018-12-09 07:16:46,970 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 07:16:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-09 07:16:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-09 07:16:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-09 07:16:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-09 07:16:46,989 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-09 07:16:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:46,989 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-09 07:16:46,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:16:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-09 07:16:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 07:16:46,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:46,990 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 07:16:46,990 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:46,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash 244952331, now seen corresponding path program 1 times [2018-12-09 07:16:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:46,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:47,019 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 07:16:47,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:47,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:16:47,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:47,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:16:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:16:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:16:47,020 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-09 07:16:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:47,075 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-09 07:16:47,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:16:47,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-09 07:16:47,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:47,077 INFO L225 Difference]: With dead ends: 1662 [2018-12-09 07:16:47,078 INFO L226 Difference]: Without dead ends: 961 [2018-12-09 07:16:47,078 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 07:16:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-09 07:16:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-09 07:16:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-09 07:16:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-09 07:16:47,102 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2018-12-09 07:16:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:47,102 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-09 07:16:47,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:16:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-09 07:16:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 07:16:47,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:47,103 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 07:16:47,104 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:47,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1740119302, now seen corresponding path program 1 times [2018-12-09 07:16:47,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:47,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:47,135 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 07:16:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:47,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:47,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:47,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:47,136 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-09 07:16:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:47,423 INFO L93 Difference]: Finished difference Result 2295 states and 3391 transitions. [2018-12-09 07:16:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:47,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 07:16:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:47,426 INFO L225 Difference]: With dead ends: 2295 [2018-12-09 07:16:47,426 INFO L226 Difference]: Without dead ends: 1361 [2018-12-09 07:16:47,427 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 07:16:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-12-09 07:16:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1115. [2018-12-09 07:16:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-09 07:16:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-09 07:16:47,455 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2018-12-09 07:16:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:47,455 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-09 07:16:47,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-09 07:16:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 07:16:47,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:47,457 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 07:16:47,457 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:47,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1883869130, now seen corresponding path program 1 times [2018-12-09 07:16:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:47,505 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 07:16:47,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:47,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:47,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:47,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:47,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:47,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:47,506 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-09 07:16:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:47,762 INFO L93 Difference]: Finished difference Result 2433 states and 3649 transitions. [2018-12-09 07:16:47,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:47,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-09 07:16:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:47,764 INFO L225 Difference]: With dead ends: 2433 [2018-12-09 07:16:47,764 INFO L226 Difference]: Without dead ends: 1343 [2018-12-09 07:16:47,765 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 07:16:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-12-09 07:16:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2018-12-09 07:16:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-09 07:16:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-09 07:16:47,792 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2018-12-09 07:16:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:47,792 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-09 07:16:47,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-09 07:16:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-09 07:16:47,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:47,793 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 07:16:47,793 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:47,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash -401210212, now seen corresponding path program 1 times [2018-12-09 07:16:47,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:47,821 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 07:16:47,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:47,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:16:47,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:47,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:16:47,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:16:47,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:16:47,822 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2018-12-09 07:16:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:47,879 INFO L93 Difference]: Finished difference Result 1341 states and 2010 transitions. [2018-12-09 07:16:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:16:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-09 07:16:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:47,882 INFO L225 Difference]: With dead ends: 1341 [2018-12-09 07:16:47,882 INFO L226 Difference]: Without dead ends: 1339 [2018-12-09 07:16:47,882 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 07:16:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-12-09 07:16:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2018-12-09 07:16:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2018-12-09 07:16:47,918 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2018-12-09 07:16:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:47,918 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2018-12-09 07:16:47,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:16:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2018-12-09 07:16:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 07:16:47,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:47,919 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 07:16:47,919 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:47,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1393716788, now seen corresponding path program 1 times [2018-12-09 07:16:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:47,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:47,960 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 07:16:47,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:47,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:47,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:47,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:47,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:47,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:47,961 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2018-12-09 07:16:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:48,247 INFO L93 Difference]: Finished difference Result 2984 states and 4448 transitions. [2018-12-09 07:16:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:48,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-09 07:16:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:48,250 INFO L225 Difference]: With dead ends: 2984 [2018-12-09 07:16:48,250 INFO L226 Difference]: Without dead ends: 1672 [2018-12-09 07:16:48,251 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 07:16:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-12-09 07:16:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2018-12-09 07:16:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2018-12-09 07:16:48,288 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2018-12-09 07:16:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:48,288 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2018-12-09 07:16:48,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2018-12-09 07:16:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 07:16:48,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:48,289 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 07:16:48,289 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:48,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash 547229759, now seen corresponding path program 1 times [2018-12-09 07:16:48,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:48,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:48,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:48,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:48,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:48,321 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 07:16:48,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:48,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:48,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:48,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:48,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:48,321 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2018-12-09 07:16:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:48,624 INFO L93 Difference]: Finished difference Result 2974 states and 4428 transitions. [2018-12-09 07:16:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:48,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-09 07:16:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:48,627 INFO L225 Difference]: With dead ends: 2974 [2018-12-09 07:16:48,627 INFO L226 Difference]: Without dead ends: 1662 [2018-12-09 07:16:48,628 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 07:16:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2018-12-09 07:16:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1337. [2018-12-09 07:16:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2018-12-09 07:16:48,668 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2018-12-09 07:16:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:48,668 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2018-12-09 07:16:48,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2018-12-09 07:16:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 07:16:48,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:48,669 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 07:16:48,669 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:48,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:48,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1110798656, now seen corresponding path program 1 times [2018-12-09 07:16:48,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:48,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:48,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 07:16:48,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:48,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:48,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:48,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:48,711 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2018-12-09 07:16:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:49,026 INFO L93 Difference]: Finished difference Result 2969 states and 4413 transitions. [2018-12-09 07:16:49,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:49,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-09 07:16:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:49,030 INFO L225 Difference]: With dead ends: 2969 [2018-12-09 07:16:49,030 INFO L226 Difference]: Without dead ends: 1657 [2018-12-09 07:16:49,032 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 07:16:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-09 07:16:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-09 07:16:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2018-12-09 07:16:49,086 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2018-12-09 07:16:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:49,087 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2018-12-09 07:16:49,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2018-12-09 07:16:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 07:16:49,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:49,088 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 07:16:49,088 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:49,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1131603569, now seen corresponding path program 1 times [2018-12-09 07:16:49,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:49,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:49,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:49,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:49,123 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 07:16:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:49,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:49,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:49,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:49,124 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2018-12-09 07:16:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:49,645 INFO L93 Difference]: Finished difference Result 2969 states and 4403 transitions. [2018-12-09 07:16:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:49,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-09 07:16:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:49,648 INFO L225 Difference]: With dead ends: 2969 [2018-12-09 07:16:49,648 INFO L226 Difference]: Without dead ends: 1657 [2018-12-09 07:16:49,649 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 07:16:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-09 07:16:49,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-09 07:16:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2018-12-09 07:16:49,689 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2018-12-09 07:16:49,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:49,689 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2018-12-09 07:16:49,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2018-12-09 07:16:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 07:16:49,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:49,691 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 07:16:49,691 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:49,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1771774716, now seen corresponding path program 1 times [2018-12-09 07:16:49,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:49,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:49,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:49,746 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 07:16:49,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:49,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:49,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:49,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:49,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:49,747 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2018-12-09 07:16:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:50,026 INFO L93 Difference]: Finished difference Result 2969 states and 4393 transitions. [2018-12-09 07:16:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-09 07:16:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:50,029 INFO L225 Difference]: With dead ends: 2969 [2018-12-09 07:16:50,029 INFO L226 Difference]: Without dead ends: 1657 [2018-12-09 07:16:50,030 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 07:16:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-09 07:16:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-09 07:16:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2018-12-09 07:16:50,070 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2018-12-09 07:16:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:50,070 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2018-12-09 07:16:50,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2018-12-09 07:16:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-09 07:16:50,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:50,071 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 07:16:50,071 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1479525396, now seen corresponding path program 1 times [2018-12-09 07:16:50,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:50,112 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 07:16:50,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:50,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:50,112 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:50,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:50,112 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2018-12-09 07:16:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:50,380 INFO L93 Difference]: Finished difference Result 2969 states and 4383 transitions. [2018-12-09 07:16:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:50,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-09 07:16:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:50,383 INFO L225 Difference]: With dead ends: 2969 [2018-12-09 07:16:50,383 INFO L226 Difference]: Without dead ends: 1657 [2018-12-09 07:16:50,384 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 07:16:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2018-12-09 07:16:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1337. [2018-12-09 07:16:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:50,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2018-12-09 07:16:50,427 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2018-12-09 07:16:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:50,428 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2018-12-09 07:16:50,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2018-12-09 07:16:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 07:16:50,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:50,429 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 07:16:50,429 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:50,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -812382953, now seen corresponding path program 1 times [2018-12-09 07:16:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:50,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:50,462 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 07:16:50,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:50,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:50,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:50,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:50,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:50,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:50,463 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2018-12-09 07:16:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:50,724 INFO L93 Difference]: Finished difference Result 2919 states and 4313 transitions. [2018-12-09 07:16:50,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:50,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 07:16:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:50,727 INFO L225 Difference]: With dead ends: 2919 [2018-12-09 07:16:50,727 INFO L226 Difference]: Without dead ends: 1607 [2018-12-09 07:16:50,728 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 07:16:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-09 07:16:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2018-12-09 07:16:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2018-12-09 07:16:50,770 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2018-12-09 07:16:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:50,771 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2018-12-09 07:16:50,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2018-12-09 07:16:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 07:16:50,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:50,771 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 07:16:50,772 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2057989827, now seen corresponding path program 1 times [2018-12-09 07:16:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:50,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:50,821 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 07:16:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:50,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:50,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:50,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:50,821 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2018-12-09 07:16:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:51,083 INFO L93 Difference]: Finished difference Result 2919 states and 4303 transitions. [2018-12-09 07:16:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:51,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 07:16:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:51,086 INFO L225 Difference]: With dead ends: 2919 [2018-12-09 07:16:51,086 INFO L226 Difference]: Without dead ends: 1607 [2018-12-09 07:16:51,087 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 07:16:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-09 07:16:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1337. [2018-12-09 07:16:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2018-12-09 07:16:51,131 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2018-12-09 07:16:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:51,131 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2018-12-09 07:16:51,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2018-12-09 07:16:51,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-09 07:16:51,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:51,132 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 07:16:51,132 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:51,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -88498670, now seen corresponding path program 1 times [2018-12-09 07:16:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:51,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:51,175 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 07:16:51,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:51,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:51,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:51,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:51,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:51,175 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2018-12-09 07:16:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:51,429 INFO L93 Difference]: Finished difference Result 2894 states and 4261 transitions. [2018-12-09 07:16:51,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:51,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-09 07:16:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:51,432 INFO L225 Difference]: With dead ends: 2894 [2018-12-09 07:16:51,432 INFO L226 Difference]: Without dead ends: 1582 [2018-12-09 07:16:51,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:16:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-09 07:16:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2018-12-09 07:16:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2018-12-09 07:16:51,478 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2018-12-09 07:16:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:51,478 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2018-12-09 07:16:51,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2018-12-09 07:16:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 07:16:51,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:51,479 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 07:16:51,479 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1557757070, now seen corresponding path program 1 times [2018-12-09 07:16:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:51,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:51,515 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 07:16:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:51,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:51,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:51,516 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2018-12-09 07:16:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:51,790 INFO L93 Difference]: Finished difference Result 2894 states and 4251 transitions. [2018-12-09 07:16:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:51,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 07:16:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:51,792 INFO L225 Difference]: With dead ends: 2894 [2018-12-09 07:16:51,792 INFO L226 Difference]: Without dead ends: 1582 [2018-12-09 07:16:51,793 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 07:16:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2018-12-09 07:16:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1337. [2018-12-09 07:16:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-09 07:16:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2018-12-09 07:16:51,838 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2018-12-09 07:16:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:51,838 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2018-12-09 07:16:51,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2018-12-09 07:16:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 07:16:51,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:51,839 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 07:16:51,839 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:51,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1693480643, now seen corresponding path program 1 times [2018-12-09 07:16:51,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:51,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:51,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:51,893 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 07:16:51,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:51,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:51,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:51,894 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2018-12-09 07:16:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:52,122 INFO L93 Difference]: Finished difference Result 2854 states and 4176 transitions. [2018-12-09 07:16:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:52,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 07:16:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:52,125 INFO L225 Difference]: With dead ends: 2854 [2018-12-09 07:16:52,125 INFO L226 Difference]: Without dead ends: 1542 [2018-12-09 07:16:52,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 07:16:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-09 07:16:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1317. [2018-12-09 07:16:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-09 07:16:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2018-12-09 07:16:52,173 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2018-12-09 07:16:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:52,173 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2018-12-09 07:16:52,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2018-12-09 07:16:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 07:16:52,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:52,174 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 07:16:52,175 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:52,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash -358853295, now seen corresponding path program 1 times [2018-12-09 07:16:52,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:52,210 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 07:16:52,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:52,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:52,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:52,211 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2018-12-09 07:16:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:52,484 INFO L93 Difference]: Finished difference Result 2834 states and 4136 transitions. [2018-12-09 07:16:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:52,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-09 07:16:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:52,487 INFO L225 Difference]: With dead ends: 2834 [2018-12-09 07:16:52,487 INFO L226 Difference]: Without dead ends: 1542 [2018-12-09 07:16:52,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 07:16:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-09 07:16:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2018-12-09 07:16:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-09 07:16:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2018-12-09 07:16:52,535 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2018-12-09 07:16:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:52,535 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2018-12-09 07:16:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2018-12-09 07:16:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 07:16:52,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:52,536 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 07:16:52,536 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:52,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -519508972, now seen corresponding path program 1 times [2018-12-09 07:16:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:52,588 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 07:16:52,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:52,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:52,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:52,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:52,589 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2018-12-09 07:16:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:52,832 INFO L93 Difference]: Finished difference Result 2859 states and 4166 transitions. [2018-12-09 07:16:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:52,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 07:16:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:52,834 INFO L225 Difference]: With dead ends: 2859 [2018-12-09 07:16:52,835 INFO L226 Difference]: Without dead ends: 1542 [2018-12-09 07:16:52,836 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 07:16:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-09 07:16:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1342. [2018-12-09 07:16:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-09 07:16:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2018-12-09 07:16:52,884 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2018-12-09 07:16:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:52,884 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2018-12-09 07:16:52,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2018-12-09 07:16:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 07:16:52,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:52,886 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 07:16:52,886 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -15622212, now seen corresponding path program 1 times [2018-12-09 07:16:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:52,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:52,947 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 07:16:52,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:52,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:52,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:52,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:52,948 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2018-12-09 07:16:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:53,189 INFO L93 Difference]: Finished difference Result 2849 states and 4146 transitions. [2018-12-09 07:16:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:53,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-09 07:16:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:53,191 INFO L225 Difference]: With dead ends: 2849 [2018-12-09 07:16:53,191 INFO L226 Difference]: Without dead ends: 1532 [2018-12-09 07:16:53,192 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 07:16:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-12-09 07:16:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1347. [2018-12-09 07:16:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-09 07:16:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2018-12-09 07:16:53,242 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2018-12-09 07:16:53,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:53,242 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2018-12-09 07:16:53,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:53,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2018-12-09 07:16:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 07:16:53,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:53,243 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 07:16:53,243 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:53,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1373847761, now seen corresponding path program 1 times [2018-12-09 07:16:53,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:53,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:53,278 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 07:16:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:53,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:53,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:53,278 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2018-12-09 07:16:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:53,516 INFO L93 Difference]: Finished difference Result 2839 states and 4126 transitions. [2018-12-09 07:16:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:53,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 07:16:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:53,518 INFO L225 Difference]: With dead ends: 2839 [2018-12-09 07:16:53,518 INFO L226 Difference]: Without dead ends: 1517 [2018-12-09 07:16:53,519 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 07:16:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-09 07:16:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2018-12-09 07:16:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-09 07:16:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1962 transitions. [2018-12-09 07:16:53,569 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1962 transitions. Word has length 156 [2018-12-09 07:16:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:53,569 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1962 transitions. [2018-12-09 07:16:53,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1962 transitions. [2018-12-09 07:16:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 07:16:53,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:53,570 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 07:16:53,570 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:53,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 775738825, now seen corresponding path program 1 times [2018-12-09 07:16:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:53,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:53,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:53,608 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 07:16:53,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:53,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:53,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:53,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:53,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:53,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:53,609 INFO L87 Difference]: Start difference. First operand 1352 states and 1962 transitions. Second operand 4 states. [2018-12-09 07:16:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:53,831 INFO L93 Difference]: Finished difference Result 2834 states and 4111 transitions. [2018-12-09 07:16:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:53,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-09 07:16:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:53,833 INFO L225 Difference]: With dead ends: 2834 [2018-12-09 07:16:53,833 INFO L226 Difference]: Without dead ends: 1507 [2018-12-09 07:16:53,834 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 07:16:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-12-09 07:16:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1352. [2018-12-09 07:16:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-09 07:16:53,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2018-12-09 07:16:53,883 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2018-12-09 07:16:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:53,883 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2018-12-09 07:16:53,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:53,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2018-12-09 07:16:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-09 07:16:53,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:53,884 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 07:16:53,884 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:53,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1787977568, now seen corresponding path program 1 times [2018-12-09 07:16:53,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:53,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:53,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:53,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:53,929 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 07:16:53,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:53,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:53,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:53,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:53,930 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2018-12-09 07:16:54,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:54,143 INFO L93 Difference]: Finished difference Result 2834 states and 4101 transitions. [2018-12-09 07:16:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:54,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-09 07:16:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:54,144 INFO L225 Difference]: With dead ends: 2834 [2018-12-09 07:16:54,144 INFO L226 Difference]: Without dead ends: 1507 [2018-12-09 07:16:54,145 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 07:16:54,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2018-12-09 07:16:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1357. [2018-12-09 07:16:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-12-09 07:16:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2018-12-09 07:16:54,211 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2018-12-09 07:16:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:54,211 INFO L480 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2018-12-09 07:16:54,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2018-12-09 07:16:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 07:16:54,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:54,213 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 07:16:54,213 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:54,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1281849680, now seen corresponding path program 1 times [2018-12-09 07:16:54,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:54,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:54,257 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 07:16:54,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:54,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:54,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:54,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:54,258 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2018-12-09 07:16:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:54,486 INFO L93 Difference]: Finished difference Result 2819 states and 4076 transitions. [2018-12-09 07:16:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:54,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 07:16:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:54,488 INFO L225 Difference]: With dead ends: 2819 [2018-12-09 07:16:54,489 INFO L226 Difference]: Without dead ends: 1487 [2018-12-09 07:16:54,490 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 07:16:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-09 07:16:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1362. [2018-12-09 07:16:54,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-09 07:16:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2018-12-09 07:16:54,540 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2018-12-09 07:16:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:54,541 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2018-12-09 07:16:54,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2018-12-09 07:16:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 07:16:54,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:54,542 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 07:16:54,542 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:54,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:54,543 INFO L82 PathProgramCache]: Analyzing trace with hash 97631154, now seen corresponding path program 1 times [2018-12-09 07:16:54,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:54,579 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 07:16:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:54,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:54,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:54,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:54,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:54,580 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2018-12-09 07:16:54,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:54,796 INFO L93 Difference]: Finished difference Result 2824 states and 4076 transitions. [2018-12-09 07:16:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:54,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-09 07:16:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:54,798 INFO L225 Difference]: With dead ends: 2824 [2018-12-09 07:16:54,798 INFO L226 Difference]: Without dead ends: 1487 [2018-12-09 07:16:54,799 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 07:16:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-09 07:16:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1367. [2018-12-09 07:16:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-12-09 07:16:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2018-12-09 07:16:54,850 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2018-12-09 07:16:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:54,851 INFO L480 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2018-12-09 07:16:54,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2018-12-09 07:16:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-09 07:16:54,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:54,852 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 07:16:54,852 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:54,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1346832834, now seen corresponding path program 1 times [2018-12-09 07:16:54,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:54,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:54,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:54,897 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 07:16:54,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:54,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:54,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:54,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:54,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:54,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:54,897 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2018-12-09 07:16:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:55,106 INFO L93 Difference]: Finished difference Result 2819 states and 4066 transitions. [2018-12-09 07:16:55,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:55,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-09 07:16:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:55,108 INFO L225 Difference]: With dead ends: 2819 [2018-12-09 07:16:55,108 INFO L226 Difference]: Without dead ends: 1477 [2018-12-09 07:16:55,109 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 07:16:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-09 07:16:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1372. [2018-12-09 07:16:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-09 07:16:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2018-12-09 07:16:55,160 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2018-12-09 07:16:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:55,160 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2018-12-09 07:16:55,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2018-12-09 07:16:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 07:16:55,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:55,161 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:16:55,161 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:55,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 811220269, now seen corresponding path program 1 times [2018-12-09 07:16:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:55,198 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 07:16:55,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:55,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:55,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:55,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:55,199 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2018-12-09 07:16:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:55,411 INFO L93 Difference]: Finished difference Result 2824 states and 4066 transitions. [2018-12-09 07:16:55,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:55,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-09 07:16:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:55,413 INFO L225 Difference]: With dead ends: 2824 [2018-12-09 07:16:55,413 INFO L226 Difference]: Without dead ends: 1477 [2018-12-09 07:16:55,414 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 07:16:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-09 07:16:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1377. [2018-12-09 07:16:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-12-09 07:16:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2018-12-09 07:16:55,471 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 161 [2018-12-09 07:16:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:55,472 INFO L480 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2018-12-09 07:16:55,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2018-12-09 07:16:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 07:16:55,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:55,473 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:16:55,473 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:55,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash 627757725, now seen corresponding path program 1 times [2018-12-09 07:16:55,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:55,543 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 07:16:55,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:16:55,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:16:55,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:16:55,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:16:55,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:16:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:16:55,543 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2018-12-09 07:16:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:16:55,769 INFO L93 Difference]: Finished difference Result 2819 states and 4056 transitions. [2018-12-09 07:16:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:16:55,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-09 07:16:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:16:55,771 INFO L225 Difference]: With dead ends: 2819 [2018-12-09 07:16:55,771 INFO L226 Difference]: Without dead ends: 1467 [2018-12-09 07:16:55,772 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 07:16:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-12-09 07:16:55,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2018-12-09 07:16:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-09 07:16:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2018-12-09 07:16:55,824 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 162 [2018-12-09 07:16:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:16:55,824 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2018-12-09 07:16:55,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:16:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2018-12-09 07:16:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 07:16:55,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:16:55,825 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 07:16:55,825 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:16:55,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1878575972, now seen corresponding path program 1 times [2018-12-09 07:16:55,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:16:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:16:55,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:16:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 07:16:56,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:16:56,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 07:16:56,207 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-09 07:16:56,208 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [489], [492], [508], [513], [516], [534], [539], [541], [544], [552], [555], [559], [580], [614], [616], [628], [631], [632], [633], [635] [2018-12-09 07:16:56,233 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 07:16:56,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 07:16:56,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 07:16:56,650 INFO L272 AbstractInterpreter]: Visited 76 different actions 236 times. Merged at 54 different actions 148 times. Never widened. Performed 1899 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1899 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 7 different actions. Largest state had 118 variables. [2018-12-09 07:16:56,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:16:56,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 07:16:56,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:16:56,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/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 07:16:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:16:56,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 07:16:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:16:56,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:16:56,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,814 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 07:16:56,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,863 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 07:16:56,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,883 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 07:16:56,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,908 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 07:16:56,909 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 07:16:56,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,912 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 07:16:56,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:56,917 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 07:16:56,918 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,924 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:56,940 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 07:16:56,940 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-09 07:16:56,969 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 07:16:56,971 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 07:16:56,986 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 07:16:56,989 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 07:16:57,004 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 07:16:57,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,012 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 07:16:57,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,028 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 07:16:57,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,045 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 07:16:57,045 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,060 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,072 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,087 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-09 07:16:57,105 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 07:16:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,111 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 07:16:57,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 07:16:57,134 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 07:16:57,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,139 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 07:16:57,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 07:16:57,159 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 07:16:57,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,167 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 07:16:57,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,193 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 07:16:57,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,201 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 07:16:57,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-09 07:16:57,223 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 07:16:57,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,237 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 07:16:57,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 07:16:57,263 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 07:16:57,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,271 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 07:16:57,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-09 07:16:57,294 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 07:16:57,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,297 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 07:16:57,298 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 07:16:57,302 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 07:16:57,321 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 07:16:57,323 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 07:16:57,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,342 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 07:16:57,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-09 07:16:57,408 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 07:16:57,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-09 07:16:57,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,467 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 07:16:57,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,475 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 07:16:57,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,501 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 07:16:57,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-09 07:16:57,533 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 07:16:57,535 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 07:16:57,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,559 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 07:16:57,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,566 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 07:16:57,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,591 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 07:16:57,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-09 07:16:57,625 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 07:16:57,627 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 07:16:57,627 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 07:16:57,629 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 07:16:57,646 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 07:16:57,648 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 07:16:57,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,658 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 07:16:57,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:57,674 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 07:16:57,682 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 07:16:57,683 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 07:16:57,683 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,686 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,690 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 07:16:57,690 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-09 07:16:57,710 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 07:16:57,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,713 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 07:16:57,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,722 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 07:16:57,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 07:16:57,756 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 07:16:57,757 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 07:16:57,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 07:16:57,763 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 07:16:57,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:57,768 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 07:16:57,768 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-09 07:16:57,905 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 07:16:57,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 07:16:57,950 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 07:16:57,951 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 07:16:57,951 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 07:16:57,953 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 07:16:57,954 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 07:16:57,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-09 07:16:58,037 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 07:16:58,039 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 07:16:58,042 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 07:16:58,055 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 07:16:58,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:58,061 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 07:16:58,062 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 07:16:58,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 07:16:58,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 07:16:58,067 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 07:16:58,070 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 07:16:58,070 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-09 07:16:58,101 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 07:16:58,102 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 07:16:58,110 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 07:16:58,111 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 07:16:58,112 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 07:16:58,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-09 07:16:58,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-09 07:16:58,128 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 07:16:58,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-12-09 07:16:58,130 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 07:16:58,134 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 07:16:58,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2018-12-09 07:16:58,172 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 07:16:58,175 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 07:16:58,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-09 07:16:58,224 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 07:16:58,227 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 07:16:58,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-09 07:16:58,275 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 07:16:58,278 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 07:16:58,284 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 07:16:58,286 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 07:16:58,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,289 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2018-12-09 07:16:58,336 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 07:16:58,338 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 07:16:58,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-09 07:16:58,390 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 07:16:58,392 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 07:16:58,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2018-12-09 07:16:58,439 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 07:16:58,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,452 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 07:16:58,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,461 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 07:16:58,464 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 07:16:58,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-12-09 07:16:58,466 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:110, output treesize:154 [2018-12-09 07:16:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-09 07:16:58,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 07:16:58,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2018-12-09 07:16:58,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 07:16:58,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 07:16:58,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 07:16:58,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-12-09 07:16:58,653 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 17 states. [2018-12-09 07:17:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:03,058 INFO L93 Difference]: Finished difference Result 4598 states and 6733 transitions. [2018-12-09 07:17:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 07:17:03,059 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 170 [2018-12-09 07:17:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:03,064 INFO L225 Difference]: With dead ends: 4598 [2018-12-09 07:17:03,064 INFO L226 Difference]: Without dead ends: 3241 [2018-12-09 07:17:03,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 319 SyntacticMatches, 17 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 07:17:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2018-12-09 07:17:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 1542. [2018-12-09 07:17:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-09 07:17:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2272 transitions. [2018-12-09 07:17:03,155 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2272 transitions. Word has length 170 [2018-12-09 07:17:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:03,156 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2272 transitions. [2018-12-09 07:17:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 07:17:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2272 transitions. [2018-12-09 07:17:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 07:17:03,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:03,158 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 07:17:03,158 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:03,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 548636406, now seen corresponding path program 1 times [2018-12-09 07:17:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:03,209 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 07:17:03,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:03,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:03,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:03,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:03,210 INFO L87 Difference]: Start difference. First operand 1542 states and 2272 transitions. Second operand 4 states. [2018-12-09 07:17:03,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:03,489 INFO L93 Difference]: Finished difference Result 3144 states and 4626 transitions. [2018-12-09 07:17:03,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:03,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-09 07:17:03,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:03,492 INFO L225 Difference]: With dead ends: 3144 [2018-12-09 07:17:03,492 INFO L226 Difference]: Without dead ends: 1627 [2018-12-09 07:17:03,493 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 07:17:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-12-09 07:17:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1542. [2018-12-09 07:17:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-09 07:17:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2267 transitions. [2018-12-09 07:17:03,569 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2267 transitions. Word has length 171 [2018-12-09 07:17:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:03,570 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2267 transitions. [2018-12-09 07:17:03,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2267 transitions. [2018-12-09 07:17:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-09 07:17:03,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:03,572 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 07:17:03,572 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2015859349, now seen corresponding path program 1 times [2018-12-09 07:17:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:03,625 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 07:17:03,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:03,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:03,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:03,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:03,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:03,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:03,626 INFO L87 Difference]: Start difference. First operand 1542 states and 2267 transitions. Second operand 4 states. [2018-12-09 07:17:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:03,861 INFO L93 Difference]: Finished difference Result 3124 states and 4589 transitions. [2018-12-09 07:17:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:03,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-09 07:17:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:03,863 INFO L225 Difference]: With dead ends: 3124 [2018-12-09 07:17:03,863 INFO L226 Difference]: Without dead ends: 1607 [2018-12-09 07:17:03,865 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 07:17:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-12-09 07:17:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1542. [2018-12-09 07:17:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2018-12-09 07:17:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2262 transitions. [2018-12-09 07:17:03,953 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2262 transitions. Word has length 172 [2018-12-09 07:17:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:03,953 INFO L480 AbstractCegarLoop]: Abstraction has 1542 states and 2262 transitions. [2018-12-09 07:17:03,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2262 transitions. [2018-12-09 07:17:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-09 07:17:03,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:03,954 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 07:17:03,954 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:03,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 79781090, now seen corresponding path program 1 times [2018-12-09 07:17:03,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:03,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:03,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:04,006 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 07:17:04,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:04,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:04,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:04,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:04,007 INFO L87 Difference]: Start difference. First operand 1542 states and 2262 transitions. Second operand 4 states. [2018-12-09 07:17:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:04,408 INFO L93 Difference]: Finished difference Result 3561 states and 5255 transitions. [2018-12-09 07:17:04,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:04,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-09 07:17:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:04,410 INFO L225 Difference]: With dead ends: 3561 [2018-12-09 07:17:04,410 INFO L226 Difference]: Without dead ends: 2044 [2018-12-09 07:17:04,411 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 07:17:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2018-12-09 07:17:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1737. [2018-12-09 07:17:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-09 07:17:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2617 transitions. [2018-12-09 07:17:04,495 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2617 transitions. Word has length 184 [2018-12-09 07:17:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:04,495 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 2617 transitions. [2018-12-09 07:17:04,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2617 transitions. [2018-12-09 07:17:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 07:17:04,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:04,496 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 07:17:04,496 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:04,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash -615129969, now seen corresponding path program 1 times [2018-12-09 07:17:04,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:04,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:04,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:04,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:04,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:04,567 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 07:17:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:17:04,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:17:04,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:17:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:17:04,568 INFO L87 Difference]: Start difference. First operand 1737 states and 2617 transitions. Second operand 5 states. [2018-12-09 07:17:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:04,962 INFO L93 Difference]: Finished difference Result 4186 states and 6365 transitions. [2018-12-09 07:17:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:04,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-09 07:17:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:04,965 INFO L225 Difference]: With dead ends: 4186 [2018-12-09 07:17:04,965 INFO L226 Difference]: Without dead ends: 2474 [2018-12-09 07:17:04,966 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 07:17:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-09 07:17:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 1737. [2018-12-09 07:17:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1737 states. [2018-12-09 07:17:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2617 transitions. [2018-12-09 07:17:05,044 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2617 transitions. Word has length 185 [2018-12-09 07:17:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:05,044 INFO L480 AbstractCegarLoop]: Abstraction has 1737 states and 2617 transitions. [2018-12-09 07:17:05,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:17:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2617 transitions. [2018-12-09 07:17:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 07:17:05,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:05,046 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 07:17:05,046 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:05,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1828760862, now seen corresponding path program 1 times [2018-12-09 07:17:05,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:05,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:05,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:05,109 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 07:17:05,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:05,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:05,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:05,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:05,110 INFO L87 Difference]: Start difference. First operand 1737 states and 2617 transitions. Second operand 4 states. [2018-12-09 07:17:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:05,484 INFO L93 Difference]: Finished difference Result 3929 states and 5933 transitions. [2018-12-09 07:17:05,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:05,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-09 07:17:05,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:05,487 INFO L225 Difference]: With dead ends: 3929 [2018-12-09 07:17:05,487 INFO L226 Difference]: Without dead ends: 2217 [2018-12-09 07:17:05,489 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 07:17:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-12-09 07:17:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1882. [2018-12-09 07:17:05,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2018-12-09 07:17:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2877 transitions. [2018-12-09 07:17:05,568 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2877 transitions. Word has length 185 [2018-12-09 07:17:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:05,568 INFO L480 AbstractCegarLoop]: Abstraction has 1882 states and 2877 transitions. [2018-12-09 07:17:05,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2877 transitions. [2018-12-09 07:17:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-09 07:17:05,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:05,570 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 07:17:05,570 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:05,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:05,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1896167211, now seen corresponding path program 1 times [2018-12-09 07:17:05,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:05,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:05,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:05,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:05,629 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 07:17:05,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:05,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:17:05,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:05,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:17:05,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:17:05,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:17:05,630 INFO L87 Difference]: Start difference. First operand 1882 states and 2877 transitions. Second operand 5 states. [2018-12-09 07:17:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:05,999 INFO L93 Difference]: Finished difference Result 4256 states and 6515 transitions. [2018-12-09 07:17:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:06,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-09 07:17:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:06,002 INFO L225 Difference]: With dead ends: 4256 [2018-12-09 07:17:06,002 INFO L226 Difference]: Without dead ends: 2399 [2018-12-09 07:17:06,003 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 07:17:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2018-12-09 07:17:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1827. [2018-12-09 07:17:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-09 07:17:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2802 transitions. [2018-12-09 07:17:06,087 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2802 transitions. Word has length 186 [2018-12-09 07:17:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:06,088 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2802 transitions. [2018-12-09 07:17:06,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:17:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2802 transitions. [2018-12-09 07:17:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-09 07:17:06,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:06,090 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 07:17:06,090 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:06,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -682214875, now seen corresponding path program 1 times [2018-12-09 07:17:06,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:06,155 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 07:17:06,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:06,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:06,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:06,156 INFO L87 Difference]: Start difference. First operand 1827 states and 2802 transitions. Second operand 4 states. [2018-12-09 07:17:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:06,388 INFO L93 Difference]: Finished difference Result 3694 states and 5659 transitions. [2018-12-09 07:17:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:06,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-09 07:17:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:06,390 INFO L225 Difference]: With dead ends: 3694 [2018-12-09 07:17:06,390 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 07:17:06,392 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 07:17:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 07:17:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1827. [2018-12-09 07:17:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-09 07:17:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2797 transitions. [2018-12-09 07:17:06,470 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2797 transitions. Word has length 195 [2018-12-09 07:17:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:06,470 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2797 transitions. [2018-12-09 07:17:06,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:06,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2797 transitions. [2018-12-09 07:17:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-09 07:17:06,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:06,471 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 07:17:06,472 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:06,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1577878837, now seen corresponding path program 1 times [2018-12-09 07:17:06,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:06,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:06,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:06,519 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 07:17:06,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:06,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:06,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:06,520 INFO L87 Difference]: Start difference. First operand 1827 states and 2797 transitions. Second operand 4 states. [2018-12-09 07:17:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:06,776 INFO L93 Difference]: Finished difference Result 3694 states and 5649 transitions. [2018-12-09 07:17:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:06,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-09 07:17:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:06,778 INFO L225 Difference]: With dead ends: 3694 [2018-12-09 07:17:06,778 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 07:17:06,780 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 07:17:06,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 07:17:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1827. [2018-12-09 07:17:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-09 07:17:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2792 transitions. [2018-12-09 07:17:06,867 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2792 transitions. Word has length 196 [2018-12-09 07:17:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:06,867 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2792 transitions. [2018-12-09 07:17:06,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2792 transitions. [2018-12-09 07:17:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-09 07:17:06,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:06,869 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 07:17:06,869 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:06,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1444910848, now seen corresponding path program 1 times [2018-12-09 07:17:06,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:06,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:06,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:06,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:17:06,915 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 07:17:06,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:17:06,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:17:06,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:17:06,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:17:06,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:17:06,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:17:06,916 INFO L87 Difference]: Start difference. First operand 1827 states and 2792 transitions. Second operand 4 states. [2018-12-09 07:17:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:17:07,147 INFO L93 Difference]: Finished difference Result 3679 states and 5622 transitions. [2018-12-09 07:17:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:17:07,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-09 07:17:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:17:07,149 INFO L225 Difference]: With dead ends: 3679 [2018-12-09 07:17:07,149 INFO L226 Difference]: Without dead ends: 1877 [2018-12-09 07:17:07,150 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 07:17:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2018-12-09 07:17:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1827. [2018-12-09 07:17:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-12-09 07:17:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2787 transitions. [2018-12-09 07:17:07,229 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2787 transitions. Word has length 197 [2018-12-09 07:17:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:17:07,230 INFO L480 AbstractCegarLoop]: Abstraction has 1827 states and 2787 transitions. [2018-12-09 07:17:07,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:17:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2787 transitions. [2018-12-09 07:17:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 07:17:07,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:17:07,231 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 07:17:07,231 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:17:07,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:17:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 844081357, now seen corresponding path program 1 times [2018-12-09 07:17:07,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:17:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:07,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:17:07,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:17:07,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:17:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:17:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:17:07,361 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 07:17:07,402 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24592 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 07:17:07,403 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24589 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 07:17:07,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:17:07 BoogieIcfgContainer [2018-12-09 07:17:07,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 07:17:07,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:17:07,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:17:07,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:17:07,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:16:37" (3/4) ... [2018-12-09 07:17:07,449 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 07:17:07,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:17:07,450 INFO L168 Benchmark]: Toolchain (without parser) took 30496.78 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 823.1 MB). Free memory was 945.9 MB in the beginning and 1.0 GB in the end (delta: -97.8 MB). Peak memory consumption was 725.4 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.06 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 07:17:07,451 INFO L168 Benchmark]: Boogie Preprocessor took 47.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: RCFGBuilder took 549.09 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: 84.5 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: TraceAbstraction took 29487.24 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -29.0 MB). Peak memory consumption was 656.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:07,451 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:17:07,452 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 38.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.06 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 47.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 549.09 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: 84.5 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29487.24 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 685.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -29.0 MB). Peak memory consumption was 656.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.9 GB. Free memory is still 1.0 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 24592 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24589 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24610, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24591:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={24598:0}, malloc(sizeof(SSL_CTX))={24613:0}, malloc(sizeof(SSL_SESSION))={24579:0}, malloc(sizeof(struct ssl3_state_st))={24604:0}, s={24598:0}, SSLv3_server_data={24591:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24598:0}, SSLv3_server_data={24591:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24598:0}, s={24598:0}, s->state=8464, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8496, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->hit=1, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=7, s={24598:0}, s={24598:0}, s->state=8656, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24598:0}, s={24598:0}, s->state=8672, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->hit=1, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=5, s={24598:0}, s={24598:0}, s->state=8448, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24583, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->s3={24604:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=5, s={24598:0}, s={24598:0}, s->state=8640, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1726] __VERIFIER_error() VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24598:0}, s={24598:0}, skip=0, SSLv3_server_data={24591:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 29.4s OverallTime, 76 OverallIterations, 7 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17158 SDtfs, 5656 SDslu, 26609 SDs, 0 SdLazy, 17616 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 467 SyntacticMatches, 113 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1882occurred in iteration=71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 75 MinimizatonAttempts, 10281 StatesRemovedByMinimization, 74 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 9160 NumberOfCodeBlocks, 9160 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 9054 ConstructedInterpolants, 206 QuantifiedInterpolants, 6311643 SizeOfPredicates, 17 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 77 InterpolantComputations, 74 PerfectInterpolantSequences, 8517/8919 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 07:17:08,774 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:17:08,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:17:08,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:17:08,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:17:08,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:17:08,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:17:08,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:17:08,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:17:08,784 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:17:08,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:17:08,785 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:17:08,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:17:08,785 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:17:08,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:17:08,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:17:08,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:17:08,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:17:08,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:17:08,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:17:08,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:17:08,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:17:08,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:17:08,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:17:08,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:17:08,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:17:08,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:17:08,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:17:08,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:17:08,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:17:08,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:17:08,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:17:08,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:17:08,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:17:08,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:17:08,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:17:08,795 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 07:17:08,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:17:08,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:17:08,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:17:08,803 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:17:08,803 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:17:08,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:17:08,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:17:08,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:17:08,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:17:08,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 07:17:08,806 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 07:17:08,806 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_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-12-09 07:17:08,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:17:08,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:17:08,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:17:08,834 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:17:08,835 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:17:08,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-09 07:17:08,872 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/8b0ee6b20/6cf84cfac21947a8a8a82afd39e99051/FLAG3a30965a7 [2018-12-09 07:17:09,323 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:17:09,324 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-12-09 07:17:09,332 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/8b0ee6b20/6cf84cfac21947a8a8a82afd39e99051/FLAG3a30965a7 [2018-12-09 07:17:09,341 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccc33824-b2db-4f1e-876e-7f771780bb77/bin-2019/utaipan/data/8b0ee6b20/6cf84cfac21947a8a8a82afd39e99051 [2018-12-09 07:17:09,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:17:09,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:17:09,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:17:09,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:17:09,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:17:09,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:09" (1/1) ... [2018-12-09 07:17:09,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3103db51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:17:09, skipping insertion in model container [2018-12-09 07:17:09,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:17:09" (1/1) ... [2018-12-09 07:17:09,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:17:09,386 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:17:09,613 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:17:09,624 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:17:09,722 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:17:09,723 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 07:17:09,725 INFO L168 Benchmark]: Toolchain (without parser) took 381.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:09,726 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 07:17:09,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-09 07:17:09,727 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.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -172.5 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...