./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c336041bbe834e5f5652b9c9de80bd23d0aa7014 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c336041bbe834e5f5652b9c9de80bd23d0aa7014 ............................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:47:38,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:47:38,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:47:38,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:47:38,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:47:38,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:47:38,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:47:38,574 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:47:38,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:47:38,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:47:38,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:47:38,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:47:38,578 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:47:38,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:47:38,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:47:38,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:47:38,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:47:38,581 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:47:38,583 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:47:38,584 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:47:38,585 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:47:38,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:47:38,587 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:47:38,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:47:38,587 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:47:38,588 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:47:38,589 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:47:38,589 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:47:38,590 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:47:38,591 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:47:38,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:47:38,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:47:38,591 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:47:38,591 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:47:38,592 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:47:38,592 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:47:38,593 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:47:38,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:47:38,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:47:38,604 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:47:38,604 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:47:38,604 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:47:38,604 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:47:38,604 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:47:38,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:47:38,604 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:47:38,605 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:47:38,605 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:47:38,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:47:38,607 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:47:38,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:47:38,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:47:38,607 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_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-12-03 01:47:38,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:47:38,640 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:47:38,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:47:38,643 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:47:38,644 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:47:38,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-03 01:47:38,684 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/9ac11c9d5/137bd1ca99674ce8b609feb6e38cea28/FLAG6f9ab4a2b [2018-12-03 01:47:39,073 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:47:39,074 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-03 01:47:39,083 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/9ac11c9d5/137bd1ca99674ce8b609feb6e38cea28/FLAG6f9ab4a2b [2018-12-03 01:47:39,418 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/9ac11c9d5/137bd1ca99674ce8b609feb6e38cea28 [2018-12-03 01:47:39,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:47:39,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:47:39,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:47:39,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:47:39,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:47:39,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6103ace6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39, skipping insertion in model container [2018-12-03 01:47:39,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:47:39,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:47:39,716 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:47:39,726 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:47:39,804 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:47:39,820 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:47:39,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39 WrapperNode [2018-12-03 01:47:39,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:47:39,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:47:39,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:47:39,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:47:39,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:47:39,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:47:39,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:47:39,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:47:39,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... [2018-12-03 01:47:39,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:47:39,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:47:39,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:47:39,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:47:39,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:47:39,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:47:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-03 01:47:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:47:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:47:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:47:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:47:40,099 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 01:47:40,099 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 01:47:40,486 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:47:40,486 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 01:47:40,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:40 BoogieIcfgContainer [2018-12-03 01:47:40,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:47:40,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:47:40,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:47:40,490 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:47:40,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:47:39" (1/3) ... [2018-12-03 01:47:40,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94cd71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:47:40, skipping insertion in model container [2018-12-03 01:47:40,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:47:39" (2/3) ... [2018-12-03 01:47:40,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94cd71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:47:40, skipping insertion in model container [2018-12-03 01:47:40,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:40" (3/3) ... [2018-12-03 01:47:40,492 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-03 01:47:40,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:47:40,503 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:47:40,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:47:40,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:47:40,532 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:47:40,532 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:47:40,532 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:47:40,532 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:47:40,532 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:47:40,532 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:47:40,532 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:47:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-03 01:47:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 01:47:40,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:40,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:40,554 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:40,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:40,559 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-12-03 01:47:40,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:40,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:40,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:40,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:40,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:40,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:40,776 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-03 01:47:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:41,040 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-03 01:47:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:41,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-03 01:47:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:41,051 INFO L225 Difference]: With dead ends: 333 [2018-12-03 01:47:41,051 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 01:47:41,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 01:47:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-03 01:47:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 01:47:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-03 01:47:41,084 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-03 01:47:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:41,084 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-03 01:47:41,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-03 01:47:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 01:47:41,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:41,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:41,086 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:41,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1978591950, now seen corresponding path program 1 times [2018-12-03 01:47:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:41,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:41,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:41,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:41,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:41,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:41,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:41,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:41,168 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-03 01:47:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:41,366 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-03 01:47:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:41,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 01:47:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:41,367 INFO L225 Difference]: With dead ends: 296 [2018-12-03 01:47:41,368 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 01:47:41,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 01:47:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-03 01:47:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 01:47:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-03 01:47:41,374 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-03 01:47:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:41,375 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-03 01:47:41,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-03 01:47:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:47:41,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:41,376 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:41,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:41,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash -659098542, now seen corresponding path program 1 times [2018-12-03 01:47:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:41,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:41,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:41,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:47:41,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:47:41,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:47:41,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:41,430 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-03 01:47:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:41,706 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-03 01:47:41,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:47:41,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-03 01:47:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:41,708 INFO L225 Difference]: With dead ends: 300 [2018-12-03 01:47:41,708 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 01:47:41,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:47:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 01:47:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-03 01:47:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 01:47:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-03 01:47:41,717 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-03 01:47:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:41,717 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-03 01:47:41,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:47:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-03 01:47:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:47:41,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:41,718 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:41,718 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:41,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1162543817, now seen corresponding path program 1 times [2018-12-03 01:47:41,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:41,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:41,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:41,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:41,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:41,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:41,783 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-03 01:47:41,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:41,967 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-03 01:47:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:41,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 01:47:41,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:41,968 INFO L225 Difference]: With dead ends: 333 [2018-12-03 01:47:41,968 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 01:47:41,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 01:47:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-03 01:47:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 01:47:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-03 01:47:41,976 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-03 01:47:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:41,976 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-03 01:47:41,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-03 01:47:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 01:47:41,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:41,978 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:41,978 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:41,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash -480987638, now seen corresponding path program 1 times [2018-12-03 01:47:41,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:41,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:41,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:41,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,031 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-03 01:47:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:42,179 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-03 01:47:42,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:42,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 01:47:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:42,180 INFO L225 Difference]: With dead ends: 332 [2018-12-03 01:47:42,180 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 01:47:42,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 01:47:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 01:47:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 01:47:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-03 01:47:42,185 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-03 01:47:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,185 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-03 01:47:42,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-03 01:47:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 01:47:42,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,186 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,186 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2014271313, now seen corresponding path program 1 times [2018-12-03 01:47:42,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,220 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-03 01:47:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:42,356 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-03 01:47:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:42,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-03 01:47:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:42,357 INFO L225 Difference]: With dead ends: 332 [2018-12-03 01:47:42,357 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 01:47:42,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 01:47:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 01:47:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 01:47:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-03 01:47:42,363 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-03 01:47:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,364 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-03 01:47:42,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-03 01:47:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 01:47:42,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,365 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,365 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash -515871290, now seen corresponding path program 1 times [2018-12-03 01:47:42,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,407 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-03 01:47:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:42,560 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-03 01:47:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:42,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-03 01:47:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:42,561 INFO L225 Difference]: With dead ends: 332 [2018-12-03 01:47:42,561 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 01:47:42,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 01:47:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-03 01:47:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 01:47:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-03 01:47:42,565 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-03 01:47:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,565 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-03 01:47:42,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-03 01:47:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 01:47:42,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,566 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,566 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,567 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-12-03 01:47:42,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,598 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-03 01:47:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:42,761 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-03 01:47:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:42,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-03 01:47:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:42,762 INFO L225 Difference]: With dead ends: 361 [2018-12-03 01:47:42,762 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 01:47:42,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 01:47:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-03 01:47:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-03 01:47:42,766 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-03 01:47:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,767 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-03 01:47:42,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-03 01:47:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 01:47:42,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,768 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1702821866, now seen corresponding path program 1 times [2018-12-03 01:47:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,800 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-03 01:47:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:42,943 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-03 01:47:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:42,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-03 01:47:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:42,944 INFO L225 Difference]: With dead ends: 376 [2018-12-03 01:47:42,944 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 01:47:42,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 01:47:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-03 01:47:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-03 01:47:42,948 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-03 01:47:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:42,948 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-03 01:47:42,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-03 01:47:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 01:47:42,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:42,949 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:42,949 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:42,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:42,949 INFO L82 PathProgramCache]: Analyzing trace with hash 480798369, now seen corresponding path program 1 times [2018-12-03 01:47:42,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:42,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:42,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:42,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:42,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:42,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:42,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:42,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:42,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:42,981 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-03 01:47:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:43,111 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-03 01:47:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:43,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 01:47:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:43,112 INFO L225 Difference]: With dead ends: 366 [2018-12-03 01:47:43,112 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 01:47:43,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 01:47:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-03 01:47:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-03 01:47:43,118 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-03 01:47:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:43,118 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-03 01:47:43,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-03 01:47:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 01:47:43,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:43,119 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:43,119 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:43,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1484856716, now seen corresponding path program 1 times [2018-12-03 01:47:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:43,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:43,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:43,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:43,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:43,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:43,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:43,174 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-03 01:47:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:43,360 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-03 01:47:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:43,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-03 01:47:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:43,362 INFO L225 Difference]: With dead ends: 383 [2018-12-03 01:47:43,362 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 01:47:43,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 01:47:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-03 01:47:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-03 01:47:43,370 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-03 01:47:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:43,370 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-03 01:47:43,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-03 01:47:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 01:47:43,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:43,371 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:43,371 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:43,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270063, now seen corresponding path program 1 times [2018-12-03 01:47:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:43,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:43,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:43,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:43,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:43,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:43,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:43,422 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-03 01:47:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:43,601 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-03 01:47:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:43,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-03 01:47:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:43,602 INFO L225 Difference]: With dead ends: 381 [2018-12-03 01:47:43,602 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 01:47:43,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 01:47:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-03 01:47:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-03 01:47:43,610 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-03 01:47:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:43,610 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-03 01:47:43,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-03 01:47:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 01:47:43,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:43,611 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:43,611 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:43,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:43,612 INFO L82 PathProgramCache]: Analyzing trace with hash -488261392, now seen corresponding path program 1 times [2018-12-03 01:47:43,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:43,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:43,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:43,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:43,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:43,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:43,674 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-03 01:47:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:43,844 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-03 01:47:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:43,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-03 01:47:43,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:43,845 INFO L225 Difference]: With dead ends: 380 [2018-12-03 01:47:43,845 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 01:47:43,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 01:47:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 01:47:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-03 01:47:43,852 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-03 01:47:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:43,852 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-03 01:47:43,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-03 01:47:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 01:47:43,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:43,853 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:43,853 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:43,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2055209609, now seen corresponding path program 1 times [2018-12-03 01:47:43,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:43,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:43,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:43,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:43,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:43,893 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-03 01:47:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:44,058 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-03 01:47:44,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:44,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-03 01:47:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:44,059 INFO L225 Difference]: With dead ends: 380 [2018-12-03 01:47:44,059 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 01:47:44,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 01:47:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 01:47:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-03 01:47:44,066 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-03 01:47:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,066 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-03 01:47:44,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-03 01:47:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 01:47:44,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,067 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,067 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1083985708, now seen corresponding path program 1 times [2018-12-03 01:47:44,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:44,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:44,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:44,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:44,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,133 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-03 01:47:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:44,277 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-03 01:47:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:44,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-03 01:47:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:44,278 INFO L225 Difference]: With dead ends: 380 [2018-12-03 01:47:44,278 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 01:47:44,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 01:47:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 01:47:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-03 01:47:44,283 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-03 01:47:44,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,284 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-03 01:47:44,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-03 01:47:44,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 01:47:44,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,284 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,284 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,284 INFO L82 PathProgramCache]: Analyzing trace with hash -241218748, now seen corresponding path program 1 times [2018-12-03 01:47:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:44,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:44,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:44,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:44,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:44,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,316 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-03 01:47:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:44,469 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-03 01:47:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:44,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-03 01:47:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:44,470 INFO L225 Difference]: With dead ends: 380 [2018-12-03 01:47:44,470 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 01:47:44,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 01:47:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-03 01:47:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-03 01:47:44,475 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-03 01:47:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,475 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-03 01:47:44,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-03 01:47:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 01:47:44,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,476 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,476 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 345081479, now seen corresponding path program 1 times [2018-12-03 01:47:44,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:47:44,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:44,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:44,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:44,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,517 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-03 01:47:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:44,663 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-03 01:47:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:44,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-03 01:47:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:44,664 INFO L225 Difference]: With dead ends: 370 [2018-12-03 01:47:44,664 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 01:47:44,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 01:47:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-03 01:47:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 01:47:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-03 01:47:44,669 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-03 01:47:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,669 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-03 01:47:44,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-03 01:47:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 01:47:44,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,670 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,670 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-12-03 01:47:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:44,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:44,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:44,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:44,709 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-03 01:47:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:44,970 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-03 01:47:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:44,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 01:47:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:44,972 INFO L225 Difference]: With dead ends: 469 [2018-12-03 01:47:44,972 INFO L226 Difference]: Without dead ends: 300 [2018-12-03 01:47:44,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-03 01:47:44,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-12-03 01:47:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-03 01:47:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-03 01:47:44,977 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-03 01:47:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:44,977 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-03 01:47:44,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-03 01:47:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 01:47:44,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:44,978 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:44,978 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:44,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:44,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1368287841, now seen corresponding path program 1 times [2018-12-03 01:47:44,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:44,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:44,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:45,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:45,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:45,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:45,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:45,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:45,022 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-03 01:47:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:45,206 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-03 01:47:45,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:45,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 01:47:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:45,207 INFO L225 Difference]: With dead ends: 472 [2018-12-03 01:47:45,207 INFO L226 Difference]: Without dead ends: 273 [2018-12-03 01:47:45,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-03 01:47:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-03 01:47:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-03 01:47:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-03 01:47:45,213 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-03 01:47:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:45,214 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-03 01:47:45,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-03 01:47:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 01:47:45,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:45,215 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:45,215 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:45,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2002550352, now seen corresponding path program 1 times [2018-12-03 01:47:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:45,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:45,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:45,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:45,262 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-03 01:47:45,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:45,515 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-03 01:47:45,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:45,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 01:47:45,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:45,515 INFO L225 Difference]: With dead ends: 539 [2018-12-03 01:47:45,516 INFO L226 Difference]: Without dead ends: 316 [2018-12-03 01:47:45,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-03 01:47:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-12-03 01:47:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-03 01:47:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-03 01:47:45,523 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-03 01:47:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:45,524 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-03 01:47:45,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-03 01:47:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 01:47:45,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:45,525 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:45,525 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:45,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash -959400867, now seen corresponding path program 1 times [2018-12-03 01:47:45,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:45,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:45,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:45,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:45,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:45,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:45,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:45,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:45,570 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-03 01:47:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:45,776 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-12-03 01:47:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:45,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-03 01:47:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:45,777 INFO L225 Difference]: With dead ends: 540 [2018-12-03 01:47:45,777 INFO L226 Difference]: Without dead ends: 316 [2018-12-03 01:47:45,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-03 01:47:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-12-03 01:47:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 01:47:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-03 01:47:45,783 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 86 [2018-12-03 01:47:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:45,783 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-03 01:47:45,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-03 01:47:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 01:47:45,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:45,784 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:45,784 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:45,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 316009449, now seen corresponding path program 1 times [2018-12-03 01:47:45,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:45,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:45,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:45,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:45,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:45,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:45,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:45,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:45,818 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-03 01:47:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:46,024 INFO L93 Difference]: Finished difference Result 544 states and 826 transitions. [2018-12-03 01:47:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:46,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-03 01:47:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:46,025 INFO L225 Difference]: With dead ends: 544 [2018-12-03 01:47:46,025 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 01:47:46,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 01:47:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-03 01:47:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-03 01:47:46,035 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 87 [2018-12-03 01:47:46,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:46,035 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-03 01:47:46,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-03 01:47:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 01:47:46,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:46,036 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:46,036 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:46,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash 62751798, now seen corresponding path program 1 times [2018-12-03 01:47:46,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:46,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:46,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:46,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:46,090 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-03 01:47:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:46,319 INFO L93 Difference]: Finished difference Result 545 states and 826 transitions. [2018-12-03 01:47:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:46,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-03 01:47:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:46,320 INFO L225 Difference]: With dead ends: 545 [2018-12-03 01:47:46,320 INFO L226 Difference]: Without dead ends: 310 [2018-12-03 01:47:46,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-12-03 01:47:46,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 260. [2018-12-03 01:47:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-03 01:47:46,327 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-03 01:47:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:46,327 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-03 01:47:46,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-03 01:47:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 01:47:46,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:46,328 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:46,328 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:46,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1991024500, now seen corresponding path program 1 times [2018-12-03 01:47:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:46,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:46,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:46,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:46,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:46,363 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-03 01:47:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:46,532 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-03 01:47:46,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:46,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-03 01:47:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:46,533 INFO L225 Difference]: With dead ends: 520 [2018-12-03 01:47:46,533 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 01:47:46,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 01:47:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-03 01:47:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-03 01:47:46,539 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-03 01:47:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:46,539 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-03 01:47:46,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-03 01:47:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:46,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:46,539 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:46,540 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:46,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash 19690565, now seen corresponding path program 1 times [2018-12-03 01:47:46,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:46,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:46,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:46,581 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:46,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:46,581 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-03 01:47:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:46,782 INFO L93 Difference]: Finished difference Result 543 states and 820 transitions. [2018-12-03 01:47:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:46,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 01:47:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:46,783 INFO L225 Difference]: With dead ends: 543 [2018-12-03 01:47:46,783 INFO L226 Difference]: Without dead ends: 308 [2018-12-03 01:47:46,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-03 01:47:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-03 01:47:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-03 01:47:46,791 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-03 01:47:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:46,791 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-03 01:47:46,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-03 01:47:46,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:46,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:46,792 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:46,792 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:46,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1623840890, now seen corresponding path program 1 times [2018-12-03 01:47:46,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:46,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:46,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:46,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:46,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:46,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:46,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:46,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:46,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:46,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:46,836 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-03 01:47:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,032 INFO L93 Difference]: Finished difference Result 542 states and 817 transitions. [2018-12-03 01:47:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:47,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 01:47:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,033 INFO L225 Difference]: With dead ends: 542 [2018-12-03 01:47:47,033 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 01:47:47,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 01:47:47,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-03 01:47:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-03 01:47:47,040 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-03 01:47:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:47,040 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-03 01:47:47,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-03 01:47:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:47,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:47,041 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:47,041 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:47,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash -333397817, now seen corresponding path program 1 times [2018-12-03 01:47:47,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:47,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:47,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:47,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:47,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:47,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:47,079 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-03 01:47:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,238 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-03 01:47:47,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:47,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 01:47:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,239 INFO L225 Difference]: With dead ends: 518 [2018-12-03 01:47:47,239 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 01:47:47,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 01:47:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-03 01:47:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-03 01:47:47,245 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-03 01:47:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:47,246 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-03 01:47:47,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-03 01:47:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 01:47:47,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:47,246 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:47,246 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:47,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1976929272, now seen corresponding path program 1 times [2018-12-03 01:47:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:47,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:47,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:47,274 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:47,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:47,275 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-03 01:47:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,424 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-03 01:47:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:47,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 01:47:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,425 INFO L225 Difference]: With dead ends: 517 [2018-12-03 01:47:47,425 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 01:47:47,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 01:47:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 01:47:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-03 01:47:47,431 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-03 01:47:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:47,431 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-03 01:47:47,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-03 01:47:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 01:47:47,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:47,431 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:47,432 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:47,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1211983539, now seen corresponding path program 1 times [2018-12-03 01:47:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:47,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:47,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:47,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:47,456 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-03 01:47:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,639 INFO L93 Difference]: Finished difference Result 542 states and 811 transitions. [2018-12-03 01:47:47,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:47,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-03 01:47:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,639 INFO L225 Difference]: With dead ends: 542 [2018-12-03 01:47:47,640 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 01:47:47,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 01:47:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-03 01:47:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-03 01:47:47,646 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-03 01:47:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:47,646 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-03 01:47:47,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-03 01:47:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 01:47:47,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:47,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:47,647 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:47,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1143821711, now seen corresponding path program 1 times [2018-12-03 01:47:47,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:47,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:47,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:47,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:47,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:47,674 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-03 01:47:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:47,822 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-03 01:47:47,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:47,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-03 01:47:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:47,823 INFO L225 Difference]: With dead ends: 517 [2018-12-03 01:47:47,823 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 01:47:47,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 01:47:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 01:47:47,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-03 01:47:47,829 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-03 01:47:47,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:47,830 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-03 01:47:47,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:47,830 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-03 01:47:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:47,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:47,830 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:47,830 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:47,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:47,830 INFO L82 PathProgramCache]: Analyzing trace with hash 713781314, now seen corresponding path program 1 times [2018-12-03 01:47:47,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:47,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:47,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:47,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:47,864 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:47,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:47,864 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-03 01:47:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:48,059 INFO L93 Difference]: Finished difference Result 542 states and 807 transitions. [2018-12-03 01:47:48,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:48,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-03 01:47:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:48,060 INFO L225 Difference]: With dead ends: 542 [2018-12-03 01:47:48,061 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 01:47:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 01:47:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-03 01:47:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-03 01:47:48,072 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-03 01:47:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:48,072 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-03 01:47:48,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-03 01:47:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 01:47:48,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:48,073 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:48,073 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:48,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash 698262596, now seen corresponding path program 1 times [2018-12-03 01:47:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:48,108 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:48,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:48,109 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-03 01:47:48,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:48,261 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-03 01:47:48,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:48,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-03 01:47:48,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:48,262 INFO L225 Difference]: With dead ends: 517 [2018-12-03 01:47:48,263 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 01:47:48,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 01:47:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 01:47:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:48,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-03 01:47:48,270 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-03 01:47:48,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:48,270 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-03 01:47:48,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:48,270 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-03 01:47:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 01:47:48,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:48,271 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:48,271 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:48,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1167346926, now seen corresponding path program 1 times [2018-12-03 01:47:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:48,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:48,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:48,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:48,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:48,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:48,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:48,307 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-03 01:47:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:48,488 INFO L93 Difference]: Finished difference Result 542 states and 803 transitions. [2018-12-03 01:47:48,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:48,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-03 01:47:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:48,489 INFO L225 Difference]: With dead ends: 542 [2018-12-03 01:47:48,489 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 01:47:48,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 01:47:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2018-12-03 01:47:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-03 01:47:48,496 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-03 01:47:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:48,496 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-03 01:47:48,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-03 01:47:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 01:47:48,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:48,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:48,497 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:48,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 686266668, now seen corresponding path program 1 times [2018-12-03 01:47:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:48,537 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:48,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:48,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:48,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:48,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:48,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:48,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:48,538 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-03 01:47:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:48,694 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-03 01:47:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:48,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-03 01:47:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:48,695 INFO L225 Difference]: With dead ends: 517 [2018-12-03 01:47:48,695 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 01:47:48,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 01:47:48,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-03 01:47:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-03 01:47:48,703 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-03 01:47:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:48,704 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-03 01:47:48,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:48,704 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-03 01:47:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 01:47:48,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:48,704 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:48,704 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:48,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:48,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1060944413, now seen corresponding path program 1 times [2018-12-03 01:47:48,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:48,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:48,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:48,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:48,751 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-03 01:47:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:48,929 INFO L93 Difference]: Finished difference Result 532 states and 787 transitions. [2018-12-03 01:47:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:48,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 01:47:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:48,930 INFO L225 Difference]: With dead ends: 532 [2018-12-03 01:47:48,930 INFO L226 Difference]: Without dead ends: 297 [2018-12-03 01:47:48,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-03 01:47:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-03 01:47:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-03 01:47:48,942 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-03 01:47:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:48,942 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-03 01:47:48,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-03 01:47:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 01:47:48,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:48,943 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:48,943 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:48,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:48,944 INFO L82 PathProgramCache]: Analyzing trace with hash -967641697, now seen corresponding path program 1 times [2018-12-03 01:47:48,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:48,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:48,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:48,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:48,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:48,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:48,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:48,991 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-03 01:47:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,140 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-03 01:47:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:49,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-03 01:47:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,141 INFO L225 Difference]: With dead ends: 507 [2018-12-03 01:47:49,141 INFO L226 Difference]: Without dead ends: 272 [2018-12-03 01:47:49,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-03 01:47:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-03 01:47:49,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-03 01:47:49,148 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-03 01:47:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,148 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-03 01:47:49,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-03 01:47:49,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 01:47:49,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,149 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,149 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1531434557, now seen corresponding path program 1 times [2018-12-03 01:47:49,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:49,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:49,178 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-03 01:47:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,351 INFO L93 Difference]: Finished difference Result 532 states and 783 transitions. [2018-12-03 01:47:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:49,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-03 01:47:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,352 INFO L225 Difference]: With dead ends: 532 [2018-12-03 01:47:49,352 INFO L226 Difference]: Without dead ends: 297 [2018-12-03 01:47:49,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-12-03 01:47:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 260. [2018-12-03 01:47:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 01:47:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-03 01:47:49,359 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-03 01:47:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,359 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-03 01:47:49,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-03 01:47:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 01:47:49,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,359 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,359 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,360 INFO L82 PathProgramCache]: Analyzing trace with hash -144649147, now seen corresponding path program 1 times [2018-12-03 01:47:49,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-03 01:47:49,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:47:49,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:47:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:47:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,384 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-03 01:47:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,433 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-03 01:47:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:47:49,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-03 01:47:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,434 INFO L225 Difference]: With dead ends: 728 [2018-12-03 01:47:49,434 INFO L226 Difference]: Without dead ends: 493 [2018-12-03 01:47:49,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-03 01:47:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-03 01:47:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-03 01:47:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-03 01:47:49,448 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-03 01:47:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-03 01:47:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:47:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-03 01:47:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 01:47:49,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,449 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,449 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -282131921, now seen corresponding path program 1 times [2018-12-03 01:47:49,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:49,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:47:49,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:47:49,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:47:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,473 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-03 01:47:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,511 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-03 01:47:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:47:49,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 01:47:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,512 INFO L225 Difference]: With dead ends: 1196 [2018-12-03 01:47:49,512 INFO L226 Difference]: Without dead ends: 728 [2018-12-03 01:47:49,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-03 01:47:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-03 01:47:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-03 01:47:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-03 01:47:49,532 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-03 01:47:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,532 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-03 01:47:49,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:47:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-03 01:47:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 01:47:49,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,533 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,533 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1666602963, now seen corresponding path program 1 times [2018-12-03 01:47:49,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:49,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:47:49,571 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:47:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:47:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,572 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-03 01:47:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,617 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-03 01:47:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:47:49,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-03 01:47:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,619 INFO L225 Difference]: With dead ends: 1662 [2018-12-03 01:47:49,619 INFO L226 Difference]: Without dead ends: 961 [2018-12-03 01:47:49,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-03 01:47:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-03 01:47:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-03 01:47:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-03 01:47:49,646 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 110 [2018-12-03 01:47:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:49,646 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-03 01:47:49,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:47:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-03 01:47:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 01:47:49,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:49,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:49,647 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:49,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash -37863631, now seen corresponding path program 1 times [2018-12-03 01:47:49,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:49,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:49,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:49,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:49,679 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:49,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:49,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:49,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:49,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:49,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:49,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:49,679 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-03 01:47:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:49,984 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-12-03 01:47:49,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:49,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-03 01:47:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:49,988 INFO L225 Difference]: With dead ends: 2303 [2018-12-03 01:47:49,988 INFO L226 Difference]: Without dead ends: 1369 [2018-12-03 01:47:49,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-12-03 01:47:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-12-03 01:47:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-03 01:47:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-03 01:47:50,019 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 127 [2018-12-03 01:47:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:50,019 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-03 01:47:50,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-03 01:47:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 01:47:50,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:50,021 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:50,021 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:50,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1181107307, now seen corresponding path program 1 times [2018-12-03 01:47:50,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:50,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:50,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:50,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:50,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:50,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:50,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:50,059 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-03 01:47:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:50,329 INFO L93 Difference]: Finished difference Result 2441 states and 3659 transitions. [2018-12-03 01:47:50,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:50,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-03 01:47:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:50,332 INFO L225 Difference]: With dead ends: 2441 [2018-12-03 01:47:50,332 INFO L226 Difference]: Without dead ends: 1351 [2018-12-03 01:47:50,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-12-03 01:47:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1075. [2018-12-03 01:47:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-03 01:47:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-03 01:47:50,361 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 128 [2018-12-03 01:47:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:50,361 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-03 01:47:50,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-03 01:47:50,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 01:47:50,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:50,362 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:50,362 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:50,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2028637021, now seen corresponding path program 1 times [2018-12-03 01:47:50,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 01:47:50,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:47:50,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:47:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:47:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:50,402 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 3 states. [2018-12-03 01:47:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:50,469 INFO L93 Difference]: Finished difference Result 1341 states and 2010 transitions. [2018-12-03 01:47:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:47:50,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-12-03 01:47:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:50,472 INFO L225 Difference]: With dead ends: 1341 [2018-12-03 01:47:50,472 INFO L226 Difference]: Without dead ends: 1339 [2018-12-03 01:47:50,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:47:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-12-03 01:47:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2018-12-03 01:47:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2007 transitions. [2018-12-03 01:47:50,509 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2007 transitions. Word has length 133 [2018-12-03 01:47:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:50,509 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2007 transitions. [2018-12-03 01:47:50,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:47:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2007 transitions. [2018-12-03 01:47:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 01:47:50,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:50,510 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:50,510 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:50,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1213729120, now seen corresponding path program 1 times [2018-12-03 01:47:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:50,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:50,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:50,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:50,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:50,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:50,552 INFO L87 Difference]: Start difference. First operand 1337 states and 2007 transitions. Second operand 4 states. [2018-12-03 01:47:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:50,951 INFO L93 Difference]: Finished difference Result 2994 states and 4461 transitions. [2018-12-03 01:47:50,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:50,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-03 01:47:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:50,954 INFO L225 Difference]: With dead ends: 2994 [2018-12-03 01:47:50,954 INFO L226 Difference]: Without dead ends: 1682 [2018-12-03 01:47:50,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-12-03 01:47:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1337. [2018-12-03 01:47:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2002 transitions. [2018-12-03 01:47:50,992 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2002 transitions. Word has length 140 [2018-12-03 01:47:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:50,992 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 2002 transitions. [2018-12-03 01:47:50,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2002 transitions. [2018-12-03 01:47:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 01:47:50,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:50,993 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:50,993 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:50,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1413134743, now seen corresponding path program 1 times [2018-12-03 01:47:50,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:50,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:51,030 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:51,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:51,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:51,030 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:51,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:51,031 INFO L87 Difference]: Start difference. First operand 1337 states and 2002 transitions. Second operand 4 states. [2018-12-03 01:47:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:51,419 INFO L93 Difference]: Finished difference Result 2984 states and 4441 transitions. [2018-12-03 01:47:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:51,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-03 01:47:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:51,422 INFO L225 Difference]: With dead ends: 2984 [2018-12-03 01:47:51,422 INFO L226 Difference]: Without dead ends: 1672 [2018-12-03 01:47:51,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2018-12-03 01:47:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1337. [2018-12-03 01:47:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1997 transitions. [2018-12-03 01:47:51,462 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1997 transitions. Word has length 141 [2018-12-03 01:47:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:51,462 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1997 transitions. [2018-12-03 01:47:51,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1997 transitions. [2018-12-03 01:47:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 01:47:51,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:51,463 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:51,463 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:51,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash -244893672, now seen corresponding path program 1 times [2018-12-03 01:47:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:51,497 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:51,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:51,497 INFO L87 Difference]: Start difference. First operand 1337 states and 1997 transitions. Second operand 4 states. [2018-12-03 01:47:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:51,772 INFO L93 Difference]: Finished difference Result 2979 states and 4426 transitions. [2018-12-03 01:47:51,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:51,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-03 01:47:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:51,776 INFO L225 Difference]: With dead ends: 2979 [2018-12-03 01:47:51,776 INFO L226 Difference]: Without dead ends: 1667 [2018-12-03 01:47:51,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-03 01:47:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-03 01:47:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1992 transitions. [2018-12-03 01:47:51,827 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1992 transitions. Word has length 141 [2018-12-03 01:47:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:51,827 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1992 transitions. [2018-12-03 01:47:51,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1992 transitions. [2018-12-03 01:47:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 01:47:51,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:51,829 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:51,829 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:51,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1997763491, now seen corresponding path program 1 times [2018-12-03 01:47:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:51,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:51,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:51,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:51,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:51,883 INFO L87 Difference]: Start difference. First operand 1337 states and 1992 transitions. Second operand 4 states. [2018-12-03 01:47:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:52,232 INFO L93 Difference]: Finished difference Result 2979 states and 4416 transitions. [2018-12-03 01:47:52,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:52,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-12-03 01:47:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:52,235 INFO L225 Difference]: With dead ends: 2979 [2018-12-03 01:47:52,235 INFO L226 Difference]: Without dead ends: 1667 [2018-12-03 01:47:52,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-03 01:47:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-03 01:47:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1987 transitions. [2018-12-03 01:47:52,276 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1987 transitions. Word has length 142 [2018-12-03 01:47:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:52,276 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1987 transitions. [2018-12-03 01:47:52,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1987 transitions. [2018-12-03 01:47:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 01:47:52,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:52,277 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:52,277 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:52,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:52,277 INFO L82 PathProgramCache]: Analyzing trace with hash -656974124, now seen corresponding path program 1 times [2018-12-03 01:47:52,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:52,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:52,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:52,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:52,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:52,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:52,307 INFO L87 Difference]: Start difference. First operand 1337 states and 1987 transitions. Second operand 4 states. [2018-12-03 01:47:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:52,582 INFO L93 Difference]: Finished difference Result 2979 states and 4406 transitions. [2018-12-03 01:47:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:52,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-03 01:47:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:52,585 INFO L225 Difference]: With dead ends: 2979 [2018-12-03 01:47:52,585 INFO L226 Difference]: Without dead ends: 1667 [2018-12-03 01:47:52,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-03 01:47:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-03 01:47:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1982 transitions. [2018-12-03 01:47:52,627 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1982 transitions. Word has length 143 [2018-12-03 01:47:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:52,627 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1982 transitions. [2018-12-03 01:47:52,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1982 transitions. [2018-12-03 01:47:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 01:47:52,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:52,628 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:52,628 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:52,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash 631021400, now seen corresponding path program 1 times [2018-12-03 01:47:52,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:52,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:52,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:52,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:52,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:52,671 INFO L87 Difference]: Start difference. First operand 1337 states and 1982 transitions. Second operand 4 states. [2018-12-03 01:47:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:52,985 INFO L93 Difference]: Finished difference Result 2979 states and 4396 transitions. [2018-12-03 01:47:52,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:52,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-03 01:47:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:52,988 INFO L225 Difference]: With dead ends: 2979 [2018-12-03 01:47:52,988 INFO L226 Difference]: Without dead ends: 1667 [2018-12-03 01:47:52,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:52,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-12-03 01:47:53,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1337. [2018-12-03 01:47:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1977 transitions. [2018-12-03 01:47:53,031 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1977 transitions. Word has length 144 [2018-12-03 01:47:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:53,031 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1977 transitions. [2018-12-03 01:47:53,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1977 transitions. [2018-12-03 01:47:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 01:47:53,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:53,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:53,032 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 282407791, now seen corresponding path program 1 times [2018-12-03 01:47:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:53,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:53,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:53,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:53,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:53,070 INFO L87 Difference]: Start difference. First operand 1337 states and 1977 transitions. Second operand 4 states. [2018-12-03 01:47:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:53,384 INFO L93 Difference]: Finished difference Result 2929 states and 4326 transitions. [2018-12-03 01:47:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:53,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-03 01:47:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:53,387 INFO L225 Difference]: With dead ends: 2929 [2018-12-03 01:47:53,387 INFO L226 Difference]: Without dead ends: 1617 [2018-12-03 01:47:53,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-03 01:47:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-03 01:47:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1972 transitions. [2018-12-03 01:47:53,432 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1972 transitions. Word has length 145 [2018-12-03 01:47:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:53,432 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1972 transitions. [2018-12-03 01:47:53,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1972 transitions. [2018-12-03 01:47:53,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 01:47:53,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:53,433 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:53,433 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:53,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:53,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1267678059, now seen corresponding path program 1 times [2018-12-03 01:47:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:53,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:53,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:53,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:53,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:53,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:53,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:53,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:53,468 INFO L87 Difference]: Start difference. First operand 1337 states and 1972 transitions. Second operand 4 states. [2018-12-03 01:47:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:53,791 INFO L93 Difference]: Finished difference Result 2929 states and 4316 transitions. [2018-12-03 01:47:53,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-03 01:47:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:53,794 INFO L225 Difference]: With dead ends: 2929 [2018-12-03 01:47:53,794 INFO L226 Difference]: Without dead ends: 1617 [2018-12-03 01:47:53,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2018-12-03 01:47:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1337. [2018-12-03 01:47:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1967 transitions. [2018-12-03 01:47:53,838 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1967 transitions. Word has length 149 [2018-12-03 01:47:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:53,838 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1967 transitions. [2018-12-03 01:47:53,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1967 transitions. [2018-12-03 01:47:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 01:47:53,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:53,840 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:53,840 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:53,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1266288130, now seen corresponding path program 1 times [2018-12-03 01:47:53,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:53,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:53,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:53,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:53,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:53,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:53,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:53,886 INFO L87 Difference]: Start difference. First operand 1337 states and 1967 transitions. Second operand 4 states. [2018-12-03 01:47:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:54,153 INFO L93 Difference]: Finished difference Result 2904 states and 4274 transitions. [2018-12-03 01:47:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:54,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-12-03 01:47:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:54,155 INFO L225 Difference]: With dead ends: 2904 [2018-12-03 01:47:54,156 INFO L226 Difference]: Without dead ends: 1592 [2018-12-03 01:47:54,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-03 01:47:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-03 01:47:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1962 transitions. [2018-12-03 01:47:54,202 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1962 transitions. Word has length 150 [2018-12-03 01:47:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:54,202 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1962 transitions. [2018-12-03 01:47:54,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1962 transitions. [2018-12-03 01:47:54,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 01:47:54,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:54,203 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:54,204 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:54,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash -881845026, now seen corresponding path program 1 times [2018-12-03 01:47:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:54,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:54,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:54,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:54,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:54,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:54,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:54,241 INFO L87 Difference]: Start difference. First operand 1337 states and 1962 transitions. Second operand 4 states. [2018-12-03 01:47:54,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:54,513 INFO L93 Difference]: Finished difference Result 2904 states and 4264 transitions. [2018-12-03 01:47:54,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:54,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-03 01:47:54,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:54,515 INFO L225 Difference]: With dead ends: 2904 [2018-12-03 01:47:54,515 INFO L226 Difference]: Without dead ends: 1592 [2018-12-03 01:47:54,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:54,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2018-12-03 01:47:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1337. [2018-12-03 01:47:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2018-12-03 01:47:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1957 transitions. [2018-12-03 01:47:54,572 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1957 transitions. Word has length 152 [2018-12-03 01:47:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:54,572 INFO L480 AbstractCegarLoop]: Abstraction has 1337 states and 1957 transitions. [2018-12-03 01:47:54,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1957 transitions. [2018-12-03 01:47:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 01:47:54,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:54,573 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:54,574 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:54,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2122694251, now seen corresponding path program 1 times [2018-12-03 01:47:54,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:54,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:54,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:54,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:54,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:54,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:54,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:54,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:54,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:54,611 INFO L87 Difference]: Start difference. First operand 1337 states and 1957 transitions. Second operand 4 states. [2018-12-03 01:47:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:54,855 INFO L93 Difference]: Finished difference Result 2864 states and 4189 transitions. [2018-12-03 01:47:54,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:54,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-03 01:47:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:54,857 INFO L225 Difference]: With dead ends: 2864 [2018-12-03 01:47:54,857 INFO L226 Difference]: Without dead ends: 1552 [2018-12-03 01:47:54,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-03 01:47:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1317. [2018-12-03 01:47:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2018-12-03 01:47:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1922 transitions. [2018-12-03 01:47:54,915 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1922 transitions. Word has length 153 [2018-12-03 01:47:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:54,915 INFO L480 AbstractCegarLoop]: Abstraction has 1317 states and 1922 transitions. [2018-12-03 01:47:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1922 transitions. [2018-12-03 01:47:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 01:47:54,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:54,916 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:54,916 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:54,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash -687223747, now seen corresponding path program 1 times [2018-12-03 01:47:54,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:54,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:54,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:54,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:54,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:54,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:54,954 INFO L87 Difference]: Start difference. First operand 1317 states and 1922 transitions. Second operand 4 states. [2018-12-03 01:47:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:55,211 INFO L93 Difference]: Finished difference Result 2844 states and 4149 transitions. [2018-12-03 01:47:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:55,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-03 01:47:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:55,214 INFO L225 Difference]: With dead ends: 2844 [2018-12-03 01:47:55,214 INFO L226 Difference]: Without dead ends: 1552 [2018-12-03 01:47:55,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-03 01:47:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-03 01:47:55,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-03 01:47:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1957 transitions. [2018-12-03 01:47:55,295 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1957 transitions. Word has length 154 [2018-12-03 01:47:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:55,295 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1957 transitions. [2018-12-03 01:47:55,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1957 transitions. [2018-12-03 01:47:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 01:47:55,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:55,297 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:55,297 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:55,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2016708884, now seen corresponding path program 1 times [2018-12-03 01:47:55,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:55,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:55,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:55,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:55,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:55,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:55,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:55,341 INFO L87 Difference]: Start difference. First operand 1342 states and 1957 transitions. Second operand 4 states. [2018-12-03 01:47:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:55,613 INFO L93 Difference]: Finished difference Result 2869 states and 4179 transitions. [2018-12-03 01:47:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:55,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-03 01:47:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:55,616 INFO L225 Difference]: With dead ends: 2869 [2018-12-03 01:47:55,616 INFO L226 Difference]: Without dead ends: 1552 [2018-12-03 01:47:55,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2018-12-03 01:47:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1342. [2018-12-03 01:47:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2018-12-03 01:47:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1952 transitions. [2018-12-03 01:47:55,694 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1952 transitions. Word has length 155 [2018-12-03 01:47:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:55,694 INFO L480 AbstractCegarLoop]: Abstraction has 1342 states and 1952 transitions. [2018-12-03 01:47:55,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1952 transitions. [2018-12-03 01:47:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 01:47:55,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:55,696 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:55,696 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:55,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1512822124, now seen corresponding path program 1 times [2018-12-03 01:47:55,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:55,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:55,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:55,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:55,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:55,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:55,762 INFO L87 Difference]: Start difference. First operand 1342 states and 1952 transitions. Second operand 4 states. [2018-12-03 01:47:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:55,995 INFO L93 Difference]: Finished difference Result 2859 states and 4159 transitions. [2018-12-03 01:47:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:55,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-03 01:47:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:55,997 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 01:47:55,997 INFO L226 Difference]: Without dead ends: 1542 [2018-12-03 01:47:55,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2018-12-03 01:47:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1347. [2018-12-03 01:47:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-12-03 01:47:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1957 transitions. [2018-12-03 01:47:56,049 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1957 transitions. Word has length 155 [2018-12-03 01:47:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 1347 states and 1957 transitions. [2018-12-03 01:47:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1957 transitions. [2018-12-03 01:47:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 01:47:56,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:56,050 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:56,050 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:56,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash -450055269, now seen corresponding path program 1 times [2018-12-03 01:47:56,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:56,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:56,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:56,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:56,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:56,088 INFO L87 Difference]: Start difference. First operand 1347 states and 1957 transitions. Second operand 4 states. [2018-12-03 01:47:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:56,317 INFO L93 Difference]: Finished difference Result 2849 states and 4139 transitions. [2018-12-03 01:47:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:56,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 01:47:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:56,319 INFO L225 Difference]: With dead ends: 2849 [2018-12-03 01:47:56,319 INFO L226 Difference]: Without dead ends: 1527 [2018-12-03 01:47:56,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2018-12-03 01:47:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1352. [2018-12-03 01:47:56,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-03 01:47:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1962 transitions. [2018-12-03 01:47:56,369 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1962 transitions. Word has length 156 [2018-12-03 01:47:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:56,369 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1962 transitions. [2018-12-03 01:47:56,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1962 transitions. [2018-12-03 01:47:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 01:47:56,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:56,370 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:56,370 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:56,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1699531317, now seen corresponding path program 1 times [2018-12-03 01:47:56,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:56,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:56,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:56,405 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:56,405 INFO L87 Difference]: Start difference. First operand 1352 states and 1962 transitions. Second operand 4 states. [2018-12-03 01:47:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:56,629 INFO L93 Difference]: Finished difference Result 2844 states and 4124 transitions. [2018-12-03 01:47:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:56,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-03 01:47:56,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:56,630 INFO L225 Difference]: With dead ends: 2844 [2018-12-03 01:47:56,631 INFO L226 Difference]: Without dead ends: 1517 [2018-12-03 01:47:56,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-03 01:47:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1352. [2018-12-03 01:47:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-03 01:47:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1957 transitions. [2018-12-03 01:47:56,681 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1957 transitions. Word has length 156 [2018-12-03 01:47:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:56,681 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1957 transitions. [2018-12-03 01:47:56,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1957 transitions. [2018-12-03 01:47:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 01:47:56,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:56,682 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:56,682 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:56,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:56,682 INFO L82 PathProgramCache]: Analyzing trace with hash -845450932, now seen corresponding path program 1 times [2018-12-03 01:47:56,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:56,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:56,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:56,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:56,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:56,721 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:56,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:56,721 INFO L87 Difference]: Start difference. First operand 1352 states and 1957 transitions. Second operand 4 states. [2018-12-03 01:47:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:56,957 INFO L93 Difference]: Finished difference Result 2844 states and 4114 transitions. [2018-12-03 01:47:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:56,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-03 01:47:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:56,959 INFO L225 Difference]: With dead ends: 2844 [2018-12-03 01:47:56,959 INFO L226 Difference]: Without dead ends: 1517 [2018-12-03 01:47:56,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-12-03 01:47:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1357. [2018-12-03 01:47:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-12-03 01:47:57,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1962 transitions. [2018-12-03 01:47:57,010 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1962 transitions. Word has length 158 [2018-12-03 01:47:57,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:57,011 INFO L480 AbstractCegarLoop]: Abstraction has 1357 states and 1962 transitions. [2018-12-03 01:47:57,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1962 transitions. [2018-12-03 01:47:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 01:47:57,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:57,012 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:57,012 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:57,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1221405048, now seen corresponding path program 1 times [2018-12-03 01:47:57,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:57,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:57,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:57,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:57,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:57,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:57,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:57,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:57,054 INFO L87 Difference]: Start difference. First operand 1357 states and 1962 transitions. Second operand 4 states. [2018-12-03 01:47:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:57,302 INFO L93 Difference]: Finished difference Result 2829 states and 4089 transitions. [2018-12-03 01:47:57,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:57,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 01:47:57,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:57,304 INFO L225 Difference]: With dead ends: 2829 [2018-12-03 01:47:57,304 INFO L226 Difference]: Without dead ends: 1497 [2018-12-03 01:47:57,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-03 01:47:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1362. [2018-12-03 01:47:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-12-03 01:47:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1967 transitions. [2018-12-03 01:47:57,357 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1967 transitions. Word has length 159 [2018-12-03 01:47:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:57,357 INFO L480 AbstractCegarLoop]: Abstraction has 1362 states and 1967 transitions. [2018-12-03 01:47:57,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1967 transitions. [2018-12-03 01:47:57,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 01:47:57,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:57,359 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:57,359 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:57,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:57,359 INFO L82 PathProgramCache]: Analyzing trace with hash 158075786, now seen corresponding path program 1 times [2018-12-03 01:47:57,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:57,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:57,413 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:57,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:57,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:57,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:57,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:57,414 INFO L87 Difference]: Start difference. First operand 1362 states and 1967 transitions. Second operand 4 states. [2018-12-03 01:47:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:57,628 INFO L93 Difference]: Finished difference Result 2834 states and 4089 transitions. [2018-12-03 01:47:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:57,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-03 01:47:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:57,630 INFO L225 Difference]: With dead ends: 2834 [2018-12-03 01:47:57,630 INFO L226 Difference]: Without dead ends: 1497 [2018-12-03 01:47:57,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2018-12-03 01:47:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1367. [2018-12-03 01:47:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2018-12-03 01:47:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1972 transitions. [2018-12-03 01:47:57,683 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1972 transitions. Word has length 159 [2018-12-03 01:47:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:57,683 INFO L480 AbstractCegarLoop]: Abstraction has 1367 states and 1972 transitions. [2018-12-03 01:47:57,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1972 transitions. [2018-12-03 01:47:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 01:47:57,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:57,684 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:57,684 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:57,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash -982001362, now seen corresponding path program 1 times [2018-12-03 01:47:57,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:57,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:57,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:57,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:57,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:57,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:57,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:57,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:57,727 INFO L87 Difference]: Start difference. First operand 1367 states and 1972 transitions. Second operand 4 states. [2018-12-03 01:47:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:57,957 INFO L93 Difference]: Finished difference Result 2829 states and 4079 transitions. [2018-12-03 01:47:57,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:57,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-03 01:47:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:57,959 INFO L225 Difference]: With dead ends: 2829 [2018-12-03 01:47:57,959 INFO L226 Difference]: Without dead ends: 1487 [2018-12-03 01:47:57,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-03 01:47:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1372. [2018-12-03 01:47:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-03 01:47:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1977 transitions. [2018-12-03 01:47:58,013 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1977 transitions. Word has length 160 [2018-12-03 01:47:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:58,013 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 1977 transitions. [2018-12-03 01:47:58,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1977 transitions. [2018-12-03 01:47:58,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 01:47:58,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:58,014 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:58,014 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:58,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1227853683, now seen corresponding path program 1 times [2018-12-03 01:47:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:58,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:58,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:58,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:58,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:58,052 INFO L87 Difference]: Start difference. First operand 1372 states and 1977 transitions. Second operand 4 states. [2018-12-03 01:47:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:58,274 INFO L93 Difference]: Finished difference Result 2834 states and 4079 transitions. [2018-12-03 01:47:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:58,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-03 01:47:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:58,276 INFO L225 Difference]: With dead ends: 2834 [2018-12-03 01:47:58,276 INFO L226 Difference]: Without dead ends: 1487 [2018-12-03 01:47:58,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-12-03 01:47:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1377. [2018-12-03 01:47:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-12-03 01:47:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1982 transitions. [2018-12-03 01:47:58,335 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1982 transitions. Word has length 162 [2018-12-03 01:47:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:58,335 INFO L480 AbstractCegarLoop]: Abstraction has 1377 states and 1982 transitions. [2018-12-03 01:47:58,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1982 transitions. [2018-12-03 01:47:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 01:47:58,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:58,337 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:58,337 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:58,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1322913775, now seen corresponding path program 1 times [2018-12-03 01:47:58,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:58,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:58,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:47:58,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:58,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:58,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:58,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:58,404 INFO L87 Difference]: Start difference. First operand 1377 states and 1982 transitions. Second operand 4 states. [2018-12-03 01:47:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:58,626 INFO L93 Difference]: Finished difference Result 2819 states and 4056 transitions. [2018-12-03 01:47:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:58,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-03 01:47:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:58,627 INFO L225 Difference]: With dead ends: 2819 [2018-12-03 01:47:58,627 INFO L226 Difference]: Without dead ends: 1467 [2018-12-03 01:47:58,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-03 01:47:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-12-03 01:47:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1382. [2018-12-03 01:47:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2018-12-03 01:47:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1987 transitions. [2018-12-03 01:47:58,680 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1987 transitions. Word has length 163 [2018-12-03 01:47:58,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:58,681 INFO L480 AbstractCegarLoop]: Abstraction has 1382 states and 1987 transitions. [2018-12-03 01:47:58,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1987 transitions. [2018-12-03 01:47:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 01:47:58,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:58,682 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:58,682 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:58,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:58,682 INFO L82 PathProgramCache]: Analyzing trace with hash -976864343, now seen corresponding path program 1 times [2018-12-03 01:47:58,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:58,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:58,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 01:47:58,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:47:58,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:47:58,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:47:58,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:47:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:47:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:47:58,726 INFO L87 Difference]: Start difference. First operand 1382 states and 1987 transitions. Second operand 4 states. [2018-12-03 01:47:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:47:58,985 INFO L93 Difference]: Finished difference Result 3054 states and 4427 transitions. [2018-12-03 01:47:58,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:47:58,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-03 01:47:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:47:58,987 INFO L225 Difference]: With dead ends: 3054 [2018-12-03 01:47:58,987 INFO L226 Difference]: Without dead ends: 1697 [2018-12-03 01:47:58,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:47:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2018-12-03 01:47:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1522. [2018-12-03 01:47:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2018-12-03 01:47:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2232 transitions. [2018-12-03 01:47:59,043 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2232 transitions. Word has length 169 [2018-12-03 01:47:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:47:59,043 INFO L480 AbstractCegarLoop]: Abstraction has 1522 states and 2232 transitions. [2018-12-03 01:47:59,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:47:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2232 transitions. [2018-12-03 01:47:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 01:47:59,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:47:59,044 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:47:59,044 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:47:59,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash 397999207, now seen corresponding path program 1 times [2018-12-03 01:47:59,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:47:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:59,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:59,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:47:59,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:47:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:47:59,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:47:59,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:47:59,376 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-12-03 01:47:59,377 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [114], [119], [124], [129], [134], [139], [144], [149], [154], [159], [164], [169], [174], [179], [184], [187], [189], [194], [197], [199], [204], [207], [278], [281], [289], [291], [294], [302], [305], [309], [500], [503], [519], [524], [527], [535], [540], [542], [545], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-12-03 01:47:59,405 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:47:59,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:47:59,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:47:59,833 INFO L272 AbstractInterpreter]: Visited 76 different actions 236 times. Merged at 54 different actions 148 times. Never widened. Performed 1891 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1891 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 7 different actions. Largest state had 118 variables. [2018-12-03 01:47:59,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:47:59,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:47:59,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:47:59,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:47:59,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:47:59,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:47:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:47:59,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:47:59,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:47:59,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-03 01:48:00,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-03 01:48:00,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-03 01:48:00,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-12-03 01:48:00,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-03 01:48:00,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-12-03 01:48:00,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-03 01:48:00,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,116 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,131 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-03 01:48:00,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-03 01:48:00,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-03 01:48:00,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-03 01:48:00,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-03 01:48:00,262 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,278 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,291 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,306 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-03 01:48:00,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 01:48:00,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 01:48:00,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-03 01:48:00,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 01:48:00,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-03 01:48:00,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-03 01:48:00,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-03 01:48:00,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-03 01:48:00,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-03 01:48:00,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 113 [2018-12-03 01:48:00,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-12-03 01:48:00,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:106 [2018-12-03 01:48:00,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 111 [2018-12-03 01:48:00,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 155 [2018-12-03 01:48:00,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 195 [2018-12-03 01:48:00,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,757 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:144, output treesize:106 [2018-12-03 01:48:00,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-03 01:48:00,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 01:48:00,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-03 01:48:00,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 154 [2018-12-03 01:48:00,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:115 [2018-12-03 01:48:00,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-03 01:48:00,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-03 01:48:00,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 107 [2018-12-03 01:48:00,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 62 [2018-12-03 01:48:00,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-03 01:48:00,923 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-03 01:48:00,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-03 01:48:00,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,941 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,944 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:146, output treesize:23 [2018-12-03 01:48:00,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-12-03 01:48:00,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:00,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-03 01:48:00,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:00,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:00,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-03 01:48:01,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-12-03 01:48:01,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:01,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 01:48:01,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 01:48:01,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-03 01:48:01,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,023 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-03 01:48:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-03 01:48:01,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:48:01,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-03 01:48:01,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-12-03 01:48:01,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-12-03 01:48:01,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-12-03 01:48:01,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-03 01:48:01,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-12-03 01:48:01,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-03 01:48:01,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:48:01,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,314 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2018-12-03 01:48:01,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:15 [2018-12-03 01:48:01,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-12-03 01:48:01,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 01:48:01,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 52 [2018-12-03 01:48:01,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:44 [2018-12-03 01:48:01,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,406 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:01,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-03 01:48:01,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:93 [2018-12-03 01:48:05,463 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-12-03 01:48:05,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,519 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:05,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:48:05,564 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 01:48:07,666 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,737 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,754 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,762 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,804 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,805 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,824 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,828 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:07,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 01:48:07,834 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:144, output treesize:68 [2018-12-03 01:48:10,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,149 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,161 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:10,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:48:10,206 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 01:48:12,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:12,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:12,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:12,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:12,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 01:48:12,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:63 [2018-12-03 01:48:14,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,525 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,648 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,657 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,657 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,665 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,666 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,673 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,762 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,768 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,775 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,781 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,790 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,795 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,841 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,844 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,881 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,883 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 01:48:14,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-03 01:48:14,892 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 9 variables, input treesize:184, output treesize:93 [2018-12-03 01:48:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 28 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 01:48:15,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:48:15,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-12-03 01:48:15,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:48:15,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 01:48:15,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 01:48:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=517, Unknown=1, NotChecked=0, Total=600 [2018-12-03 01:48:15,086 INFO L87 Difference]: Start difference. First operand 1522 states and 2232 transitions. Second operand 18 states. [2018-12-03 01:48:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:19,328 INFO L93 Difference]: Finished difference Result 4888 states and 7236 transitions. [2018-12-03 01:48:19,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:48:19,329 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 170 [2018-12-03 01:48:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:19,336 INFO L225 Difference]: With dead ends: 4888 [2018-12-03 01:48:19,336 INFO L226 Difference]: Without dead ends: 3391 [2018-12-03 01:48:19,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 321 SyntacticMatches, 13 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=220, Invalid=1039, Unknown=1, NotChecked=0, Total=1260 [2018-12-03 01:48:19,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2018-12-03 01:48:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 1682. [2018-12-03 01:48:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-03 01:48:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2517 transitions. [2018-12-03 01:48:19,443 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2517 transitions. Word has length 170 [2018-12-03 01:48:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:19,444 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2517 transitions. [2018-12-03 01:48:19,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 01:48:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2517 transitions. [2018-12-03 01:48:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 01:48:19,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:19,445 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:19,446 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:19,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:19,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1098050897, now seen corresponding path program 1 times [2018-12-03 01:48:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:19,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:19,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:19,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:19,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:48:19,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:19,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:19,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:19,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:19,490 INFO L87 Difference]: Start difference. First operand 1682 states and 2517 transitions. Second operand 4 states. [2018-12-03 01:48:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:19,773 INFO L93 Difference]: Finished difference Result 3424 states and 5116 transitions. [2018-12-03 01:48:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:19,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-12-03 01:48:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:19,776 INFO L225 Difference]: With dead ends: 3424 [2018-12-03 01:48:19,776 INFO L226 Difference]: Without dead ends: 1767 [2018-12-03 01:48:19,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:19,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2018-12-03 01:48:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1682. [2018-12-03 01:48:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-03 01:48:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2512 transitions. [2018-12-03 01:48:19,873 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2512 transitions. Word has length 171 [2018-12-03 01:48:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:19,873 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2512 transitions. [2018-12-03 01:48:19,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2512 transitions. [2018-12-03 01:48:19,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 01:48:19,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:19,874 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:19,874 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:19,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash -901662024, now seen corresponding path program 1 times [2018-12-03 01:48:19,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:19,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:48:19,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:19,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:19,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:19,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:19,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:19,914 INFO L87 Difference]: Start difference. First operand 1682 states and 2512 transitions. Second operand 4 states. [2018-12-03 01:48:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:20,177 INFO L93 Difference]: Finished difference Result 3404 states and 5079 transitions. [2018-12-03 01:48:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:20,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-03 01:48:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:20,179 INFO L225 Difference]: With dead ends: 3404 [2018-12-03 01:48:20,179 INFO L226 Difference]: Without dead ends: 1747 [2018-12-03 01:48:20,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:20,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2018-12-03 01:48:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1682. [2018-12-03 01:48:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-03 01:48:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2507 transitions. [2018-12-03 01:48:20,255 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2507 transitions. Word has length 172 [2018-12-03 01:48:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2507 transitions. [2018-12-03 01:48:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2507 transitions. [2018-12-03 01:48:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 01:48:20,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:20,257 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:20,257 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:20,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799216, now seen corresponding path program 1 times [2018-12-03 01:48:20,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:20,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:20,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:20,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:20,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:20,317 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:20,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:20,318 INFO L87 Difference]: Start difference. First operand 1682 states and 2507 transitions. Second operand 4 states. [2018-12-03 01:48:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:20,686 INFO L93 Difference]: Finished difference Result 3509 states and 5212 transitions. [2018-12-03 01:48:20,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:20,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-03 01:48:20,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:20,688 INFO L225 Difference]: With dead ends: 3509 [2018-12-03 01:48:20,689 INFO L226 Difference]: Without dead ends: 1852 [2018-12-03 01:48:20,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2018-12-03 01:48:20,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1682. [2018-12-03 01:48:20,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-12-03 01:48:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2502 transitions. [2018-12-03 01:48:20,763 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2502 transitions. Word has length 183 [2018-12-03 01:48:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:20,763 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2502 transitions. [2018-12-03 01:48:20,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2502 transitions. [2018-12-03 01:48:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 01:48:20,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:20,765 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:20,765 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:20,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash -6578482, now seen corresponding path program 1 times [2018-12-03 01:48:20,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:20,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:20,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:20,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-03 01:48:20,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:20,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:20,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:20,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:20,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:20,817 INFO L87 Difference]: Start difference. First operand 1682 states and 2502 transitions. Second operand 4 states. [2018-12-03 01:48:21,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:21,202 INFO L93 Difference]: Finished difference Result 3851 states and 5748 transitions. [2018-12-03 01:48:21,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:21,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-03 01:48:21,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:21,204 INFO L225 Difference]: With dead ends: 3851 [2018-12-03 01:48:21,204 INFO L226 Difference]: Without dead ends: 2194 [2018-12-03 01:48:21,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-12-03 01:48:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1877. [2018-12-03 01:48:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-03 01:48:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2857 transitions. [2018-12-03 01:48:21,284 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2857 transitions. Word has length 184 [2018-12-03 01:48:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:21,284 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2857 transitions. [2018-12-03 01:48:21,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2857 transitions. [2018-12-03 01:48:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 01:48:21,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:21,285 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:21,286 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:21,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1206962623, now seen corresponding path program 1 times [2018-12-03 01:48:21,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:21,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:21,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:21,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:21,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:21,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:21,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:21,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:21,344 INFO L87 Difference]: Start difference. First operand 1877 states and 2857 transitions. Second operand 4 states. [2018-12-03 01:48:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:21,656 INFO L93 Difference]: Finished difference Result 3899 states and 5912 transitions. [2018-12-03 01:48:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:21,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-12-03 01:48:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:21,659 INFO L225 Difference]: With dead ends: 3899 [2018-12-03 01:48:21,659 INFO L226 Difference]: Without dead ends: 2047 [2018-12-03 01:48:21,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-12-03 01:48:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1877. [2018-12-03 01:48:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-03 01:48:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2852 transitions. [2018-12-03 01:48:21,741 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2852 transitions. Word has length 184 [2018-12-03 01:48:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:21,741 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2852 transitions. [2018-12-03 01:48:21,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2852 transitions. [2018-12-03 01:48:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 01:48:21,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:21,744 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:21,744 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:21,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1095040103, now seen corresponding path program 1 times [2018-12-03 01:48:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:21,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-03 01:48:21,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:21,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:21,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:21,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:21,843 INFO L87 Difference]: Start difference. First operand 1877 states and 2852 transitions. Second operand 5 states. [2018-12-03 01:48:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:22,249 INFO L93 Difference]: Finished difference Result 4476 states and 6848 transitions. [2018-12-03 01:48:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:22,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-12-03 01:48:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:22,252 INFO L225 Difference]: With dead ends: 4476 [2018-12-03 01:48:22,252 INFO L226 Difference]: Without dead ends: 2624 [2018-12-03 01:48:22,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2018-12-03 01:48:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1877. [2018-12-03 01:48:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2018-12-03 01:48:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2852 transitions. [2018-12-03 01:48:22,334 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2852 transitions. Word has length 185 [2018-12-03 01:48:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:22,334 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 2852 transitions. [2018-12-03 01:48:22,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2852 transitions. [2018-12-03 01:48:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 01:48:22,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:22,335 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:22,335 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:22,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -211267688, now seen corresponding path program 1 times [2018-12-03 01:48:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:22,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:22,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:22,381 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-12-03 01:48:22,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:22,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:22,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:22,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:22,382 INFO L87 Difference]: Start difference. First operand 1877 states and 2852 transitions. Second operand 4 states. [2018-12-03 01:48:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:22,759 INFO L93 Difference]: Finished difference Result 4219 states and 6416 transitions. [2018-12-03 01:48:22,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:22,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-03 01:48:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:22,761 INFO L225 Difference]: With dead ends: 4219 [2018-12-03 01:48:22,761 INFO L226 Difference]: Without dead ends: 2367 [2018-12-03 01:48:22,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2018-12-03 01:48:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2022. [2018-12-03 01:48:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-12-03 01:48:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3112 transitions. [2018-12-03 01:48:22,845 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3112 transitions. Word has length 185 [2018-12-03 01:48:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:22,845 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 3112 transitions. [2018-12-03 01:48:22,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3112 transitions. [2018-12-03 01:48:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 01:48:22,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:22,846 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:22,846 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:22,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1913718796, now seen corresponding path program 1 times [2018-12-03 01:48:22,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:22,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:22,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:22,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:22,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:22,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:22,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:22,905 INFO L87 Difference]: Start difference. First operand 2022 states and 3112 transitions. Second operand 4 states. [2018-12-03 01:48:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:23,293 INFO L93 Difference]: Finished difference Result 4189 states and 6422 transitions. [2018-12-03 01:48:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:23,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-12-03 01:48:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:23,295 INFO L225 Difference]: With dead ends: 4189 [2018-12-03 01:48:23,296 INFO L226 Difference]: Without dead ends: 2192 [2018-12-03 01:48:23,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:23,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-03 01:48:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2022. [2018-12-03 01:48:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-12-03 01:48:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 3107 transitions. [2018-12-03 01:48:23,381 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 3107 transitions. Word has length 185 [2018-12-03 01:48:23,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:23,381 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 3107 transitions. [2018-12-03 01:48:23,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 3107 transitions. [2018-12-03 01:48:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 01:48:23,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:23,382 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:23,382 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:23,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash -420829921, now seen corresponding path program 1 times [2018-12-03 01:48:23,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:23,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:23,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-12-03 01:48:23,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:23,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:23,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:23,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:23,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:23,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:23,441 INFO L87 Difference]: Start difference. First operand 2022 states and 3107 transitions. Second operand 5 states. [2018-12-03 01:48:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:23,845 INFO L93 Difference]: Finished difference Result 4546 states and 6988 transitions. [2018-12-03 01:48:23,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:23,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2018-12-03 01:48:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:23,847 INFO L225 Difference]: With dead ends: 4546 [2018-12-03 01:48:23,847 INFO L226 Difference]: Without dead ends: 2549 [2018-12-03 01:48:23,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2018-12-03 01:48:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1967. [2018-12-03 01:48:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3032 transitions. [2018-12-03 01:48:23,933 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3032 transitions. Word has length 186 [2018-12-03 01:48:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:23,933 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3032 transitions. [2018-12-03 01:48:23,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3032 transitions. [2018-12-03 01:48:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 01:48:23,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:23,934 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:23,935 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:23,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:23,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1119703676, now seen corresponding path program 1 times [2018-12-03 01:48:23,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:23,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:23,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:23,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:23,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:23,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:23,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:23,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:23,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:23,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:23,983 INFO L87 Difference]: Start difference. First operand 1967 states and 3032 transitions. Second operand 4 states. [2018-12-03 01:48:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:24,350 INFO L93 Difference]: Finished difference Result 4079 states and 6262 transitions. [2018-12-03 01:48:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:24,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-12-03 01:48:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:24,352 INFO L225 Difference]: With dead ends: 4079 [2018-12-03 01:48:24,352 INFO L226 Difference]: Without dead ends: 2137 [2018-12-03 01:48:24,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2018-12-03 01:48:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1967. [2018-12-03 01:48:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3027 transitions. [2018-12-03 01:48:24,439 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3027 transitions. Word has length 186 [2018-12-03 01:48:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:24,439 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3027 transitions. [2018-12-03 01:48:24,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3027 transitions. [2018-12-03 01:48:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 01:48:24,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:24,441 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:24,441 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:24,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -770819865, now seen corresponding path program 1 times [2018-12-03 01:48:24,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:24,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:24,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:24,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:24,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:24,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:24,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:24,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:24,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:24,505 INFO L87 Difference]: Start difference. First operand 1967 states and 3027 transitions. Second operand 4 states. [2018-12-03 01:48:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:24,872 INFO L93 Difference]: Finished difference Result 4029 states and 6192 transitions. [2018-12-03 01:48:24,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:24,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-12-03 01:48:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:24,875 INFO L225 Difference]: With dead ends: 4029 [2018-12-03 01:48:24,875 INFO L226 Difference]: Without dead ends: 2087 [2018-12-03 01:48:24,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-03 01:48:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-03 01:48:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3022 transitions. [2018-12-03 01:48:24,962 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3022 transitions. Word has length 187 [2018-12-03 01:48:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:24,962 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3022 transitions. [2018-12-03 01:48:24,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3022 transitions. [2018-12-03 01:48:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 01:48:24,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:24,965 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:24,965 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:24,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1815194303, now seen corresponding path program 1 times [2018-12-03 01:48:24,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:24,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:24,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:24,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:24,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:25,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:25,012 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:25,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:25,012 INFO L87 Difference]: Start difference. First operand 1967 states and 3022 transitions. Second operand 4 states. [2018-12-03 01:48:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:25,308 INFO L93 Difference]: Finished difference Result 4029 states and 6182 transitions. [2018-12-03 01:48:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:25,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-03 01:48:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:25,310 INFO L225 Difference]: With dead ends: 4029 [2018-12-03 01:48:25,310 INFO L226 Difference]: Without dead ends: 2087 [2018-12-03 01:48:25,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:25,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-03 01:48:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-03 01:48:25,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3017 transitions. [2018-12-03 01:48:25,396 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3017 transitions. Word has length 191 [2018-12-03 01:48:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:25,396 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3017 transitions. [2018-12-03 01:48:25,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3017 transitions. [2018-12-03 01:48:25,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 01:48:25,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:25,397 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:25,397 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:25,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash -306585971, now seen corresponding path program 1 times [2018-12-03 01:48:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:25,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:25,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:25,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:25,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:25,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:25,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:25,443 INFO L87 Difference]: Start difference. First operand 1967 states and 3017 transitions. Second operand 4 states. [2018-12-03 01:48:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:25,740 INFO L93 Difference]: Finished difference Result 4029 states and 6172 transitions. [2018-12-03 01:48:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:25,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-03 01:48:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:25,742 INFO L225 Difference]: With dead ends: 4029 [2018-12-03 01:48:25,742 INFO L226 Difference]: Without dead ends: 2087 [2018-12-03 01:48:25,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2018-12-03 01:48:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1967. [2018-12-03 01:48:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3012 transitions. [2018-12-03 01:48:25,844 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3012 transitions. Word has length 191 [2018-12-03 01:48:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:25,844 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3012 transitions. [2018-12-03 01:48:25,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3012 transitions. [2018-12-03 01:48:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 01:48:25,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:25,845 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:25,845 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:25,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash -157594570, now seen corresponding path program 1 times [2018-12-03 01:48:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:25,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:25,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:25,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:25,885 INFO L87 Difference]: Start difference. First operand 1967 states and 3012 transitions. Second operand 4 states. [2018-12-03 01:48:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:26,174 INFO L93 Difference]: Finished difference Result 4009 states and 6135 transitions. [2018-12-03 01:48:26,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:26,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-12-03 01:48:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:26,176 INFO L225 Difference]: With dead ends: 4009 [2018-12-03 01:48:26,176 INFO L226 Difference]: Without dead ends: 2067 [2018-12-03 01:48:26,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2018-12-03 01:48:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1967. [2018-12-03 01:48:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3007 transitions. [2018-12-03 01:48:26,266 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3007 transitions. Word has length 192 [2018-12-03 01:48:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:26,266 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3007 transitions. [2018-12-03 01:48:26,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3007 transitions. [2018-12-03 01:48:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 01:48:26,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:26,268 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:26,268 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1272372770, now seen corresponding path program 1 times [2018-12-03 01:48:26,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:26,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 01:48:26,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:26,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:26,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:26,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:26,310 INFO L87 Difference]: Start difference. First operand 1967 states and 3007 transitions. Second operand 4 states. [2018-12-03 01:48:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:26,601 INFO L93 Difference]: Finished difference Result 3984 states and 6093 transitions. [2018-12-03 01:48:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:26,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2018-12-03 01:48:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:26,603 INFO L225 Difference]: With dead ends: 3984 [2018-12-03 01:48:26,603 INFO L226 Difference]: Without dead ends: 2042 [2018-12-03 01:48:26,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2018-12-03 01:48:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1967. [2018-12-03 01:48:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2018-12-03 01:48:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3002 transitions. [2018-12-03 01:48:26,690 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3002 transitions. Word has length 192 [2018-12-03 01:48:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:26,691 INFO L480 AbstractCegarLoop]: Abstraction has 1967 states and 3002 transitions. [2018-12-03 01:48:26,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3002 transitions. [2018-12-03 01:48:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 01:48:26,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:26,692 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:26,692 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:26,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash 169569154, now seen corresponding path program 1 times [2018-12-03 01:48:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:26,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-03 01:48:26,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:26,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:26,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:26,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:26,737 INFO L87 Difference]: Start difference. First operand 1967 states and 3002 transitions. Second operand 4 states. [2018-12-03 01:48:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:27,104 INFO L93 Difference]: Finished difference Result 4244 states and 6487 transitions. [2018-12-03 01:48:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:27,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2018-12-03 01:48:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:27,107 INFO L225 Difference]: With dead ends: 4244 [2018-12-03 01:48:27,107 INFO L226 Difference]: Without dead ends: 2302 [2018-12-03 01:48:27,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2018-12-03 01:48:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2117. [2018-12-03 01:48:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3267 transitions. [2018-12-03 01:48:27,198 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3267 transitions. Word has length 194 [2018-12-03 01:48:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:27,199 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3267 transitions. [2018-12-03 01:48:27,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3267 transitions. [2018-12-03 01:48:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 01:48:27,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:27,200 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:27,200 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 530671035, now seen corresponding path program 1 times [2018-12-03 01:48:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:27,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 01:48:27,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:27,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:27,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:27,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:27,240 INFO L87 Difference]: Start difference. First operand 2117 states and 3267 transitions. Second operand 4 states. [2018-12-03 01:48:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:27,500 INFO L93 Difference]: Finished difference Result 4274 states and 6589 transitions. [2018-12-03 01:48:27,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:27,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2018-12-03 01:48:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:27,502 INFO L225 Difference]: With dead ends: 4274 [2018-12-03 01:48:27,502 INFO L226 Difference]: Without dead ends: 2182 [2018-12-03 01:48:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-03 01:48:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-03 01:48:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3262 transitions. [2018-12-03 01:48:27,594 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3262 transitions. Word has length 195 [2018-12-03 01:48:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:27,595 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3262 transitions. [2018-12-03 01:48:27,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3262 transitions. [2018-12-03 01:48:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 01:48:27,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:27,596 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:27,596 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:27,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 601945695, now seen corresponding path program 1 times [2018-12-03 01:48:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:27,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 01:48:27,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:27,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:27,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:27,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:27,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:27,644 INFO L87 Difference]: Start difference. First operand 2117 states and 3262 transitions. Second operand 4 states. [2018-12-03 01:48:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:27,931 INFO L93 Difference]: Finished difference Result 4274 states and 6579 transitions. [2018-12-03 01:48:27,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:27,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-03 01:48:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:27,933 INFO L225 Difference]: With dead ends: 4274 [2018-12-03 01:48:27,933 INFO L226 Difference]: Without dead ends: 2182 [2018-12-03 01:48:27,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-03 01:48:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-03 01:48:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3257 transitions. [2018-12-03 01:48:28,025 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3257 transitions. Word has length 196 [2018-12-03 01:48:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:28,025 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3257 transitions. [2018-12-03 01:48:28,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3257 transitions. [2018-12-03 01:48:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 01:48:28,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:28,026 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:28,026 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:28,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1283046229, now seen corresponding path program 1 times [2018-12-03 01:48:28,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-03 01:48:28,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:28,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:28,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:28,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:28,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:28,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:28,067 INFO L87 Difference]: Start difference. First operand 2117 states and 3257 transitions. Second operand 4 states. [2018-12-03 01:48:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:28,352 INFO L93 Difference]: Finished difference Result 4284 states and 6593 transitions. [2018-12-03 01:48:28,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:28,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-03 01:48:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:28,354 INFO L225 Difference]: With dead ends: 4284 [2018-12-03 01:48:28,354 INFO L226 Difference]: Without dead ends: 2192 [2018-12-03 01:48:28,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2018-12-03 01:48:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2117. [2018-12-03 01:48:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3252 transitions. [2018-12-03 01:48:28,449 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3252 transitions. Word has length 196 [2018-12-03 01:48:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:28,449 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3252 transitions. [2018-12-03 01:48:28,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3252 transitions. [2018-12-03 01:48:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 01:48:28,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:28,451 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:28,451 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:28,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1554757866, now seen corresponding path program 1 times [2018-12-03 01:48:28,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:28,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 01:48:28,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:28,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:28,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:28,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:28,492 INFO L87 Difference]: Start difference. First operand 2117 states and 3252 transitions. Second operand 4 states. [2018-12-03 01:48:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:28,740 INFO L93 Difference]: Finished difference Result 4259 states and 6542 transitions. [2018-12-03 01:48:28,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:28,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-03 01:48:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:28,742 INFO L225 Difference]: With dead ends: 4259 [2018-12-03 01:48:28,742 INFO L226 Difference]: Without dead ends: 2167 [2018-12-03 01:48:28,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:28,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2018-12-03 01:48:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2117. [2018-12-03 01:48:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3247 transitions. [2018-12-03 01:48:28,834 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3247 transitions. Word has length 197 [2018-12-03 01:48:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:28,835 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3247 transitions. [2018-12-03 01:48:28,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3247 transitions. [2018-12-03 01:48:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 01:48:28,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:28,836 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:28,836 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:28,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash 312564918, now seen corresponding path program 1 times [2018-12-03 01:48:28,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:28,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:28,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-03 01:48:28,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:28,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:28,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:28,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:28,882 INFO L87 Difference]: Start difference. First operand 2117 states and 3247 transitions. Second operand 4 states. [2018-12-03 01:48:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:29,157 INFO L93 Difference]: Finished difference Result 4274 states and 6563 transitions. [2018-12-03 01:48:29,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:29,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-03 01:48:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:29,159 INFO L225 Difference]: With dead ends: 4274 [2018-12-03 01:48:29,160 INFO L226 Difference]: Without dead ends: 2182 [2018-12-03 01:48:29,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2018-12-03 01:48:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2117. [2018-12-03 01:48:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-12-03 01:48:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3242 transitions. [2018-12-03 01:48:29,252 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3242 transitions. Word has length 197 [2018-12-03 01:48:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:29,252 INFO L480 AbstractCegarLoop]: Abstraction has 2117 states and 3242 transitions. [2018-12-03 01:48:29,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3242 transitions. [2018-12-03 01:48:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 01:48:29,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:29,253 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:29,254 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1533851099, now seen corresponding path program 1 times [2018-12-03 01:48:29,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:29,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:29,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:48:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:48:29,403 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 01:48:29,444 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24590 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 01:48:29,445 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 01:48:29,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:48:29 BoogieIcfgContainer [2018-12-03 01:48:29,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:48:29,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:48:29,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:48:29,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:48:29,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:47:40" (3/4) ... [2018-12-03 01:48:29,499 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 01:48:29,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:48:29,499 INFO L168 Benchmark]: Toolchain (without parser) took 50076.71 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 910.2 MB). Free memory was 945.9 MB in the beginning and 793.5 MB in the end (delta: 152.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: Boogie Preprocessor took 46.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: RCFGBuilder took 587.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 84.5 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: TraceAbstraction took 49007.93 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 803.7 MB). Free memory was 988.5 MB in the beginning and 793.5 MB in the end (delta: 195.0 MB). Peak memory consumption was 998.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:29,500 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 1.9 GB. Free memory is still 793.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:48:29,501 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 587.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 988.5 MB in the end (delta: 84.5 MB). Peak memory consumption was 84.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49007.93 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 803.7 MB). Free memory was 988.5 MB in the beginning and 793.5 MB in the end (delta: 195.0 MB). Peak memory consumption was 998.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 ms. Allocated memory is still 1.9 GB. Free memory is still 793.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24590 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24588 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1727]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24609, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24589:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={24595:0}, malloc(sizeof(SSL_CTX))={24611:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24614:0}, s={24595:0}, SSLv3_server_data={24589:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24595:0}, SSLv3_server_data={24589:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24595:0}, s={24595:0}, s->state=8464, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8496, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->hit=1, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8656, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1599] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->s3={24614:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24595:0}, s={24595:0}, s->state=8672, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->hit=1, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->s3={24614:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, ret=7, s={24595:0}, s={24595:0}, s->state=8448, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24577, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->s3={24614:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8448, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=7, s={24595:0}, s={24595:0}, s->state=8640, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1727] __VERIFIER_error() VAL [={2:-1}, blastFlag=4, got_new_session=1, init=1, num1=0, ret=0, s={24595:0}, s={24595:0}, skip=0, SSLv3_server_data={24589:0}, state=8640, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 48.9s OverallTime, 89 OverallIterations, 8 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20482 SDtfs, 6698 SDslu, 31051 SDs, 0 SdLazy, 20680 SolverSat, 988 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 911 GetRequests, 495 SyntacticMatches, 132 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2117occurred in iteration=83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 88 MinimizatonAttempts, 12296 StatesRemovedByMinimization, 87 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 11609 NumberOfCodeBlocks, 11609 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 11490 ConstructedInterpolants, 161 QuantifiedInterpolants, 6877494 SizeOfPredicates, 17 NumberOfNonLiveVariables, 759 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 90 InterpolantComputations, 87 PerfectInterpolantSequences, 12757/13215 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:48:30,851 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:48:30,852 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:48:30,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:48:30,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:48:30,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:48:30,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:48:30,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:48:30,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:48:30,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:48:30,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:48:30,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:48:30,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:48:30,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:48:30,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:48:30,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:48:30,867 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:48:30,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:48:30,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:48:30,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:48:30,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:48:30,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:48:30,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:48:30,874 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:48:30,874 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:48:30,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:48:30,876 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:48:30,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:48:30,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:48:30,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:48:30,878 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:48:30,878 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:48:30,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:48:30,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:48:30,879 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:48:30,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:48:30,879 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 01:48:30,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:48:30,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:48:30,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:48:30,887 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:48:30,887 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:48:30,888 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:48:30,888 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:48:30,888 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:48:30,888 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:48:30,888 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:48:30,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 01:48:30,889 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:48:30,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:48:30,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:48:30,891 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:48:30,891 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 01:48:30,892 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 01:48:30,892 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_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-12-03 01:48:30,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:48:30,920 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:48:30,923 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:48:30,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:48:30,924 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:48:30,925 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-03 01:48:30,967 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/31e9ab4b9/d87701a6c2a84f1291c80d58ca0a668b/FLAG1ea97509f [2018-12-03 01:48:31,433 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:48:31,433 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-12-03 01:48:31,446 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/31e9ab4b9/d87701a6c2a84f1291c80d58ca0a668b/FLAG1ea97509f [2018-12-03 01:48:31,457 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b7d1650-d781-427f-99b2-65e259ebc041/bin-2019/utaipan/data/31e9ab4b9/d87701a6c2a84f1291c80d58ca0a668b [2018-12-03 01:48:31,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:48:31,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:48:31,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:48:31,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:48:31,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:48:31,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:48:31" (1/1) ... [2018-12-03 01:48:31,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:31, skipping insertion in model container [2018-12-03 01:48:31,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:48:31" (1/1) ... [2018-12-03 01:48:31,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:48:31,505 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:48:31,721 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:48:31,732 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:48:31,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:48:31,830 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 01:48:31,832 INFO L168 Benchmark]: Toolchain (without parser) took 372.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:31,833 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:48:31,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:48:31,835 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.17 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 370.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -181.0 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...